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