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