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