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