Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.nottrue

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