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