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