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