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