Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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