Proving Group Isomorphism Theorems (Extended Abstract)

We report the first computer proof of the three isomorphism theorems in group theory. The first theorem, the easiest of the three, was considered by Larry Wos as one of challenging problems for theorem provers. The technique we used is conditional completion which consists of one simplification rule called contextual rewriting and one inference rule called clausal superposition. Conditional completion works on conditional equations made from clauses and is a powerful method for clause-based theorem proving with equality.