Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.nottrue

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