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