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