Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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