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