Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

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