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