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