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