Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬((((r ∨ F) ↔ r) ∧ r) ∨ (((r ∨ F) ↔ r) ∧ r ∧ ((r ∨ F) ↔ r) ∧ r) ∨ (((r ∨ F) ↔ r) ∧ r ∧ (r ↔ r) ∧ r))

ready: no

Feedback

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

Path 1

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