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