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