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