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