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