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