Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

path	[0, 2, 0, 0, 3, 2, 2, 1]
steps	8
major rules	1
active labels	cnf eliminateimplequiv