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