Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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