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