Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.nottrue

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