Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

(¬(¬q ∨ p ∨ F) ∧ ((r ↔ (s ∧ T)) ∨ ¬s)) ∨ (¬((r ↔ s) ∨ ¬s) ∧ ¬¬(¬q ∨ p))

⇒ logic.propositional.truezeroand

(¬(¬q ∨ p ∨ F) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬((r ↔ s) ∨ ¬s) ∧ ¬¬(¬q ∨ p))