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