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