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