Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels