Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

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

Path 1

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