Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

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