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