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, 1, 3, 3, 0, 2, 0, 0, 3, 2, 2, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 5, 6, 0, 3] |
| steps | 25 |
| major rules | 3 |
| active labels | |
enter dnf,
check,
enter eliminateimplequiv,
logic.propositional.defequiv,
exit eliminateimplequiv,
check,
navigator.down,
check,
enter eliminateimplequiv,
navigator.down,
navigator.right,
navigator.down,
logic.propositional.defequiv,
navigator.up,
navigator.up,
exit eliminateimplequiv,
navigator.up,
check,
navigator.down,
check,
enter simplify,
navigator.down,
navigator.right,
enter orrules,
logic.propositional.absorpor