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