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