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