Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

T ∧ (¬(q → (p ∨ ¬¬p)) ↔ ((r ↔ s) ∨ ¬s))

⇒ logic.propositional.notnot

T ∧ (¬(q → (p ∨ p)) ↔ ((r ↔ s) ∨ ¬s))