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