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