Borrprover

Borrprover is an automated theorem prover for formal logic, designed to assist researchers, developers, and students in constructing and checking formal proofs. It targets first-order logic with equality and can export proofs for external verification. The tool is applicable in educational settings, formal verification tasks, and mathematical proof exploration, providing a practical platform for automated reasoning.

The prover uses a saturation-based inference system that combines techniques such as the superposition calculus, paramodulation for equality reasoning, and robust rewriting and simplification rules. It accepts standard problem formats like the TPTP language, offers proof objects and trace logs, and supports multiple proving strategies, including parallel search and strategy-driven control. This mix of methods aims to balance completeness, efficiency, and transparency of results.

Architecture and implementation: Borrprover comprises a core inference kernel, a clause database with indexing, a parser for input formats, a proof checker, and a strategy manager. It is designed to be cross-platform, with builds for major operating systems and an open-source license. The project emphasizes modularity to allow researchers to experiment with new strategies and to facilitate integration with other tools and proof assistants.

History and reception: Borrprover arose from a university research project in the mid-2010s and has seen subsequent releases that added modular strategies, proof objects, and API bindings. It is used in academic settings for experiments in automated reasoning and benchmarking against other provers; ongoing community contributions and documentation support broader adoption and evolution.

See also: automated theorem proving, superposition calculus, paramodulation, formal verification, proof assistants.