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