Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels