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