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