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