Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 0, 1, 0, 1, 0, 2]
steps	7
major rules	2
active labels	cnf simplify