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