Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels