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