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