paper-with-me

홈 › Papers

Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP

2026-03-20 · Guillaume Baudart, Marc Lelarge, Tristan Stérin, Jules Viennot arxiv

We report on an experiment in which Claude Opus~4.6, equipped with a suite of Model Context Protocol (MCP) tools for the Rocq proof assistant, autonomously proved 10 of 12 problems from the 2025 Putnam Mathematical Competition. The MCP tools, designed with Claude by analyzing logs from a prior experiment on miniF2F-Rocq, encode a "compile-first, interactive-fallback" strategy. Running on an isolated VM with no internet access, the agent deployed 141 subagents over 17.7 hours of active compute (51.6h wall-clock), consuming approximately 1.9 billion tokens. All proofs are publicly available.

📄 PDF Abstract BibTeX arXiv:2603.20405

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

MiniF2F in Rocq: Automatic Translation Between Proof Assistants -- A Case Study

2025-02-11 · Jules Viennot, Guillaume Baudart, Emilio Jesùs Gallego Arias, Marc Lelarge

In this work, we conduct an experiment using state-of-the-art LLMs to translate MiniF2F into Rocq. The translation task focuses on generating a Rocq theorem based on three sources: a natural language description, the Lea…

Translation

RocqStar: Leveraging Similarity-driven Retrieval and Agentic Systems for Rocq generation

2025-05-28 · Nikita Khramov, Andrei Kozyrev, Gleb Solovev, Anton Podkopaev

Interactive Theorem Proving was repeatedly shown to be fruitful combined with Generative Artificial Intelligence. This paper assesses multiple approaches to Rocq generation and illuminates potential avenues for improveme…

Automated Theorem ProvingRetrieval

RocqSmith: Can Automatic Optimization Forge Better Proof Agents?

2026-02-05 · Andrei Kozyrev, Nikita Khramov, Denis Lochmelis, Valerio Morelli 외 arxiv

This work studies the applicability of automatic AI agent optimization methods to real-world agents in formal verification settings, focusing on automated theorem proving in Rocq as a representative and challenging domai…

Automated Theorem Proving

PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs

2026-08-13 · Sadat Shahriyar, Shareef Ahmed, Abdullah Al Arafat arxiv

Schedulability analysis is essential for certifying real-time systems, but existing tests are often developed through pen-and-paper proofs that are difficult to scale, validate, and maintain. Mechanized verification in P…

ProCQA: A Large-scale Community-based Programming Question Answering Dataset for Code Search

2024-03-25 · Zehan Li, Jianfei Zhang, Chuantao Yin, Yuanxin Ouyang 외

Retrieval-based code question answering seeks to match user queries in natural language to relevant code snippets. Previous approaches typically rely on pretraining models using crafted bi-modal and uni-modal datasets to…

Code SearchQuestion AnsweringRetrieval