Gym-saturation: an OpenAI Gym environment for saturation provers
Not on the map. Why?
Abstract (arXiv)
`gym-saturation` is an OpenAI Gym environment for reinforcement learning (RL) agents capable of proving theorems. Currently, only theorems written in a formal language of the Thousands of Problems for Theorem Provers (TPTP) library in clausal normal form (CNF) are supported. `gym-saturation` implements the 'given clause' algorithm (similar to the one used in Vampire and E Prover). Being written in Python, `gym-saturation` was inspired by PyRes. In contrast to the monolithic architecture of a typical Automated Theorem Prover (ATP), `gym-saturation` gives different agents opportunities to select clauses themselves and train from their experience. Combined with a particular agent, `gym-saturation` can work as an ATP. Even with a non trained agent based on heuristics, `gym-saturation` can find refutations for 688 (of 8257) CNF problems from TPTP v7.5.0.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 6 of its 17 references that are in the map. First posted on arXiv 9 Mar 2022.
Builds on
6 of 17 references.
References · 6
- 2016OpenAI Gymcited by 1,736
- 2019Graph Representations for Higher-Order Logic and Theorem Provingcited by 55
- 2018GamePad: A Learning Environment for Theorem Provingcited by 48
- 2019Learning to Reason in Large Theories without Imitationcited by 27
- 2020ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description)cited by 26
- 2021Learning to Guide a Saturation-Based Theorem Provercited by 15
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.