Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬(T ∧ (q → p)) ↔ (¬¬(r ↔ s) ∨ F ∨ ¬s)) ∨ (¬(T ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∨ F
⇒ logic.propositional.falsezeroor(¬(T ∧ (q → p)) ↔ (¬¬(r ↔ s) ∨ ¬s)) ∨ (¬(T ∧ (q → p)) ↔ ((r ↔ s) ∨ ¬s)) ∨ F