Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

¬((((r ↔ r) ∧ T ∧ r) ∨ (r ↔ r)) ∧ T ∧ (((r ↔ r) ∧ T ∧ r) ∨ r))
ready: no

Feedback

Path 1

path[0, 0, 3]
steps3
major rules1
active labels
  • cnf
  • andrules

enter cnf, enter andrules, logic.propositional.absorpand