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