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