Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

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

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