Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬(T ∧ ((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T ∧ 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, 0, 3, 3, 0, 0, 0, 0, 0, 0, 2]
steps29
major rules3
active labels
  • cnf
  • andrules

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, check, enter eliminateimplequiv, logic.propositional.defequiv, exit eliminateimplequiv, navigator.up, navigator.up, navigator.up, navigator.up, enter andrules, logic.propositional.idempand