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