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