ToMap presents a multi-agent pipeline for full-proof autoformalization with three roles: Decomposer, Formalizer, and Prover. Its bottleneck analysis identifies decomposition quality as the main constraint, so test-time optimization is concentrated on refining atomic, self-contained proof units instead of distributing compute uniformly. Inspired by GEPA, the method evolves decomposition prompts using formal-verification progress and semantic proof rubrics, maintaining a Pareto frontier across candidate decompositions. On ProofFlowBench, ToMap reportedly improves the previous best method by 19.0% under combined syntactic-correctness and semantic-faithfulness evaluation, while using less test-time computation.
No heat snapshots are available in the last 24 hours.