Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 2, 0, 0, 0, 5, 5, 4]
steps	8
major rules	1
active labels	dnf simplify