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