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