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