Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
(T ∧ (¬(q → p) ∨ F)) ↔ (((F ∨ (r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s) ∧ F) ∨ ((F ∨ (r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s) ∧ r ∧ s) ∨ ((F ∨ (r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s) ∧ ((¬r ∧ ¬s) ∨ ¬s)))
ready: noFeedback
Path 1
| path | [] |
| steps | 0 |
| major rules | 0 |
| active labels |