Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[]
steps	0
major rules	0
active labels