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