Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
¬(((((r ↔ r) ∧ T ∧ r ∧ T) ∨ (r ↔ r)) ∧ (((r ↔ (r ∨ F)) ∧ T ∧ r) ∨ T) ∧ (((r ↔ r) ∧ T ∧ r) ∨ r)) ∨ ((((r ↔ r) ∧ T ∧ r) ∨ (r ↔ r)) ∧ (((r ↔ r) ∧ T ∧ r) ∨ T) ∧ (((r ↔ r) ∧ T ∧ r) ∨ r)))
ready: noFeedback
Path 1
path | [] |
steps | 0 |
major rules | 0 |
active labels |