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