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