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