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