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