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