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