Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

Feedback

Path 1

path[]
steps0
major rules0
active labels