Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ↔ ((r ↔ s) ∨ ¬s)) ∧ ((¬(q → p) ∧ ((r ↔ s) ∨ ¬(s ∧ T))) ∨ ((q → p) ∧ ¬((r ↔ s) ∨ ¬(s ∧ T))))
ready: noFeedback
Path 1
path | [0, 2, 0, 2, 0, 0, 5, 4] |
steps | 8 |
major rules | 1 |
active labels |
|