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