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