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