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