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