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