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