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