Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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