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