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