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