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