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