Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬(¬q ∨ p) ∧ ¬((r ↔ (s ∨ s)) ∨ ¬s))
ready: noFeedback
- (no onefirst)
- allfirsts (0)
- allapplications
- derivation
- microsteps
Path 1
path | [0, 1, 0, 1, 2, 0, 0, 1, 3, 0] |
steps | 10 |
major rules | 2 |
active labels |
|