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