Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

• onefirst
• allfirsts (15)
• allapplications
• derivation
• microsteps

Path 1

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