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