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