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