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