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