Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬(((r ∨ F) ∧ (F ∨ (((r ∧ r) ∨ (¬r ∧ ¬r)) ∧ T))) ∨ ((r ↔ r) ∧ T ∧ (r ∨ F)))
ready: no

Feedback

Path 1

path[]
steps0
major rules0
active labels