Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬(((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ r)
ready: no

Feedback

Path 1

path[0, 1, 0, 5, 6, 5, 6, 1, 1, 0, 0, 0, 0, 1, 0, 5, 1, 1, 0, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 3, 3]
steps32
major rules4
active labels
  • cnf
  • eliminateimplequiv

enter cnf, check, enter simplify, navigator.down, navigator.right, navigator.down, navigator.right, enter andrules, logic.propositional.truezeroand, exit andrules, navigator.up, navigator.up, exit simplify, check, enter simplify, navigator.down, enter andrules, logic.propositional.truezeroand, exit andrules, navigator.up, exit simplify, check, enter simplify, enter orrules, logic.propositional.idempor, exit orrules, exit simplify, check, navigator.down, check, enter eliminateimplequiv, logic.propositional.defequiv