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