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