Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

((T ∧ ¬(q → p)) ∨ (T ∧ ¬((q ∧ T) → p))) ↔ (((r ∨ r) ↔ s) ∨ ¬s)

⇒ logic.propositional.truezeroand

((T ∧ ¬(q → p)) ∨ (T ∧ ¬(q → p))) ↔ (((r ∨ r) ↔ s) ∨ ¬s)