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