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