Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

¬((q → (p ∨ p)) ∧ (q → p)) ↔ ((((F ∨ r) ↔ (F ∨ s)) ∨ ¬s) ∧ (((F ∨ r) ↔ (F ∨ s)) ∨ ¬s))
ready: no

Feedback

Path 1

path[]
steps0
major rules0
active labels