A Mathematical Benchmark for Inductive Theorem Provers
Not on the map. Why?
Abstract (arXiv)
We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectured by a learning-guided synthesis system using a language with looping operators. The operators implement recursion, and thus many of the proofs require induction on natural numbers. The benchmark contains problems of varying difficulty from a wide area of mathematical domains. We believe that these characteristics will make it an effective judge for the progress of inductive theorem provers in this domain for years to come.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Apr 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2025Learning Conjecturing from Scratchcited by 3
- 2024Artifical intelligence and inherent mathematical difficultycited by 0
- 2025Learning Conjecturing from Scratch3 Mar 2025
- 2024Artifical intelligence and inherent mathematical difficulty1 Aug 2024