Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬(q → (p ∧ T)) ↔ (¬s ∨ (r ↔ s))) ∧ (F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)))
⇒ logic.propositional.defequiv(¬(q → (p ∧ T)) ↔ (¬s ∨ (r ∧ s) ∨ (¬r ∧ ¬s))) ∧ (F ∨ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s)))