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