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