Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.nottrue

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