Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((q ∧ ¬p ∧ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)) ∨ (¬(¬¬q ∧ ¬p) ∧ ¬((r ↔ s) ∨ ¬s))) ∧ ((¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s))
ready: noFeedback
Path 1
path | [0, 2, 0, 0, 0, 5, 4, 0, 0, 0, 2, 0, 0, 3, 2, 2, 0, 2, 0, 1] |
steps | 20 |
major rules | 2 |
active labels |
|