Exercise

Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (2)
allapplications
derivation
microsteps

Path 1

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

enter cnf, check, enter simplify, enter orrules, logic.propositional.falsezeroor, exit orrules, exit simplify, check, enter eliminateimplequiv, logic.propositional.defequiv

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