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