Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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