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