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