Exercise

Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (6)
allapplications
derivation
microsteps

Path 1

path [0, 0, 1, 0, 2, 0, 2, 1, 0, 0, 3, 3]
steps 12
major rules 2
active labels
cnf
eliminateimplequiv

enter cnf, enter andrules, logic.propositional.truezeroand, exit andrules, check, navigator.down, navigator.right, check, navigator.down, check, enter eliminateimplequiv, logic.propositional.defequiv

path	[0, 0, 1, 0, 2, 0, 2, 1, 0, 0, 3, 3]
steps	12
major rules	2
active labels	cnf eliminateimplequiv