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