Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
((¬(q → p) ↔ ((r ↔ s) ∨ ¬(T ∧ s))) ∧ (¬(q → p) ↔ ((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, 1] |
steps | 5 |
major rules | 1 |
active labels |
|