Exercise

Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ T ∧ r) ∧ ¬((r ↔ r) ∧ r)

ready: no

Feedback

onefirst
allfirsts (19)
allapplications
derivation
microsteps

Path 1

path [0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 0, 0, 5, 5, 6, 1, 1]
steps 29
major rules 1
active labels
cnf
simplify
andrules

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, navigator.right, check, navigator.down, navigator.right, check, navigator.down, navigator.right, check, enter simplify, navigator.down, navigator.down, navigator.right, enter andrules, logic.propositional.truezeroand

path	[0, 2, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 0, 0, 5, 5, 6, 1, 1]
steps	29
major rules	1
active labels	cnf simplify andrules