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