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