Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

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

ready: no

Feedback

• (no onefirst)
• allfirsts (0)
• allapplications
• derivation
• microsteps

Path 1

path	[0, 0, 1]
steps	3
major rules	1
active labels	cnf andrules