Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
((¬(q → (F ∨ p)) ∨ (T ∧ ¬(q → p))) ↔ ((r ↔ s) ∨ ¬s)) ∨ F
⇒ logic.propositional.falsezeroor((¬(q → p) ∨ (T ∧ ¬(q → p))) ↔ ((r ↔ s) ∨ ¬s)) ∨ F