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