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