Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.notnot

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