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