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