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