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