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