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