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))) ∧ (¬(q → p) ↔ ((r ↔ s) ∨ ¬s))
ready: noFeedback
Path 1
path | [0, 2, 0, 0, 3, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 1] |
steps | 19 |
major rules | 2 |
active labels |
|