Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.nottrue

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