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