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