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