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