Exercise

Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

onefirst
allfirsts (4)
allapplications
derivation
microsteps

Path 1

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

enter cnf, check, navigator.down, navigator.right, check, enter simplify, navigator.down, enter andrules, logic.propositional.absorpand, exit andrules

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