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