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