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