Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 1, 0, 5, 6, 5, 6, 5, 5, 5, 5, 0, 0]
steps	13
major rules	1
active labels	dnf simplify orrules