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