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