Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
¬(((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T ∧ r)
ready: no
Feedback
Path 1
| path | [0, 1, 0, 4, 0, 0, 1, 0, 2, 0, 0, 0, 5, 6, 0, 2, 0, 0, 0, 0, 2, 0, 0, 3, 3] |
| steps | 25 |
| major rules | 4 |
| active labels | |
enter cnf,
check,
enter simplify,
logic.propositional.notnot,
exit simplify,
enter andrules,
logic.propositional.truezeroand,
exit andrules,
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