Induction and Skolemization in saturation theorem proving

05/17/2021

∙

by   Stefan Hetzl, et al.

∙

0

∙

share

We consider a typical integration of induction in saturation-based theorem provers and investigate the effects of Skolem symbols occurring in the induction formulas. In a practically relevant setting we establish a Skolem-free characterization of refutation in saturation-based proof systems with induction. Finally, we use this characterization to obtain unprovability results for a concrete saturation-based induction prover.