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