Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

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