Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((¬(q → p) ∧ ¬(q → p)) ∨ (¬¬(q → p) ∧ T ∧ ¬((r ↔ s) ∨ ¬s))) ∧ ((r ↔ s) ∨ ¬s ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬s))) ∧ ((¬(q → p) ∧ ¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬s)))
ready: noFeedback
Path 1
path | [] |
steps | 0 |
major rules | 0 |
active labels |