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