Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
![](http://ideas.cs.uu.nl/images/external.png)
¬(((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r)
ready: no
Feedback
Path 1
path | [0, 2, 0, 0, 0, 5, 5, 6, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 3, 2, 0, 1] |
steps | 22 |
major rules | 2 |
active labels | |
enter cnf,
check,
navigator.down,
check,
enter simplify,
navigator.down,
navigator.down,
navigator.right,
enter andrules,
logic.propositional.truezeroand,
exit andrules,
navigator.up,
navigator.up,
exit simplify,
navigator.up,
check,
navigator.down,
check,
enter eliminateimplequiv,
navigator.down,
navigator.down,
logic.propositional.defequiv