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