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