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