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