Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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