Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
(¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s)) ∨ (¬(¬q ∨ p) ↔ ((r ↔ s) ∨ ¬s))
ready: no
Feedback
Path 1
| path | [0, 2, 0, 0, 3, 1, 1, 0, 0, 0, 0, 0, 2, 0, 2, 0, 3, 1, 1, 0] |
| steps | 20 |
| major rules | 2 |
| active labels | |
enter dnf,
check,
navigator.down,
check,
enter eliminateimplequiv,
navigator.down,
navigator.down,
logic.propositional.defimpl,
navigator.up,
navigator.up,
exit eliminateimplequiv,
navigator.up,
check,
navigator.down,
navigator.right,
check,
enter eliminateimplequiv,
navigator.down,
navigator.down,
logic.propositional.defimpl