Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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