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