Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

• onefirst
• allfirsts (3)
• allapplications
• derivation
• microsteps

Path 1

path	[]
steps	0
major rules	0
active labels