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