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