Research

Paper

AI LLM March 20, 2026

FormalEvolve: Neuro-Symbolic Evolutionary Search for Diverse and Prover-Effective Autoformalization

Authors

Haijian Lu, Wei Wang, Jing Liu

Abstract

Autoformalization aims to translate natural-language mathematics into compilable, machine-checkable statements. However, semantic consistency does not imply prover effectiveness: even semantically consistent formalizations can differ substantially in proof-search cost and success rate. In this work, we formulate autoformalization as a budgeted, test-time search for semantically consistent repertoires, and propose FormalEvolve, a compilation-gated neuro-symbolic evolutionary framework. FormalEvolve generates diverse candidates via LLM-driven mutation and crossover with bounded patch repair, while symbolic Abstract Syntax Tree (AST) rewrite operations further inject structural diversity. On CombiBench and ProofNet, under a strict generator-call budget of T = 100, FormalEvolve reaches semantic hit rates (SH@100) of 58.0% and 84.9%, and reduces cross-problem concentration of semantic successes(lower Gini). Under a fixed prover budget, FormalEvolve also improves downstream proving performance on CombiBench. Code will be released publicly.

Metadata

arXiv ID: 2603.19828
Provider: ARXIV
Primary Category: cs.AI
Published: 2026-03-20
Fetched: 2026-03-23 16:54

Related papers

Raw Data (Debug)
{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.19828v1</id>\n    <title>FormalEvolve: Neuro-Symbolic Evolutionary Search for Diverse and Prover-Effective Autoformalization</title>\n    <updated>2026-03-20T10:14:00Z</updated>\n    <link href='https://arxiv.org/abs/2603.19828v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.19828v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>Autoformalization aims to translate natural-language mathematics into compilable, machine-checkable statements. However, semantic consistency does not imply prover effectiveness: even semantically consistent formalizations can differ substantially in proof-search cost and success rate. In this work, we formulate autoformalization as a budgeted, test-time search for semantically consistent repertoires, and propose FormalEvolve, a compilation-gated neuro-symbolic evolutionary framework. FormalEvolve generates diverse candidates via LLM-driven mutation and crossover with bounded patch repair, while symbolic Abstract Syntax Tree (AST) rewrite operations further inject structural diversity. On CombiBench and ProofNet, under a strict generator-call budget of T = 100, FormalEvolve reaches semantic hit rates (SH@100) of 58.0% and 84.9%, and reduces cross-problem concentration of semantic successes(lower Gini). Under a fixed prover budget, FormalEvolve also improves downstream proving performance on CombiBench. Code will be released publicly.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.AI'/>\n    <published>2026-03-20T10:14:00Z</published>\n    <arxiv:comment>31 pages, 12 figures</arxiv:comment>\n    <arxiv:primary_category term='cs.AI'/>\n    <author>\n      <name>Haijian Lu</name>\n      <arxiv:affiliation>School of Artificial Intelligence, Xidian University, Beijing Institute for General Artificial Intelligence</arxiv:affiliation>\n    </author>\n    <author>\n      <name>Wei Wang</name>\n      <arxiv:affiliation>Beijing Institute for General Artificial Intelligence</arxiv:affiliation>\n    </author>\n    <author>\n      <name>Jing Liu</name>\n      <arxiv:affiliation>School of Artificial Intelligence, Xidian University</arxiv:affiliation>\n    </author>\n  </entry>"
}