Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.nottrue

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