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