Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
¬(T ∧ (r ↔ r) ∧ ¬¬(r ∨ r ∨ F))
⇒ logic.propositional.notnot¬(T ∧ (r ↔ r) ∧ (r ∨ r ∨ F))
⇒ logic.propositional.falsezeroor¬(T ∧ (r ↔ r) ∧ (r ∨ r))
⇒ logic.propositional.idempor¬(T ∧ (r ↔ r) ∧ r)