Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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