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