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