Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

(F ∨ ¬(q → p)) ↔ ((r ↔ (F ∨ s)) ∨ ¬s)