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