Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

• (no onefirst)
• allfirsts (0)
• allapplications
• derivation
• microsteps

Path 1

path	[0, 0, 0]
steps	3
major rules	1
active labels	cnf andrules