Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
¬((r ∨ (¬r ∧ ¬r)) ∧ r ∧ T)
ready: no
Feedback
Path 1
| path | [0, 2, 0, 0, 0, 5, 6, 0, 2, 0, 0, 0, 0, 2, 0, 0, 3, 3, 0, 0, 2, 0, 0, 0, 5, 1, 2] |
| steps | 27 |
| major rules | 3 |
| active labels | |
enter cnf,
check,
navigator.down,
check,
enter simplify,
navigator.down,
navigator.right,
enter orrules,
logic.propositional.idempor,
exit orrules,
navigator.up,
exit simplify,
navigator.up,
check,
navigator.down,
check,
enter eliminateimplequiv,
logic.propositional.defequiv,
exit eliminateimplequiv,
navigator.up,
check,
navigator.down,
check,
enter simplify,
navigator.down,
enter andrules,
logic.propositional.idempand