Exercise

Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (1)
allapplications
derivation
microsteps

Path 1

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

enter cnf, check, enter eliminateimplequiv, navigator.down, logic.propositional.defequiv, navigator.up, exit eliminateimplequiv, check, enter simplify, navigator.down, navigator.down, enter andrules, logic.propositional.idempand

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