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