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