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