Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

path[0, 2, 0, 2, 1, 0, 0, 3, 3, 0, 0, 0, 2, 0, 2, 1, 0, 0, 0, 5, 6, 1, 2, 0, 0, 0, 0, 0, 2, 0, 2, 1, 0, 0, 0, 5, 1, 2]
steps38
major rules3
active labels
  • cnf

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