Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

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

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