mlsanityData to 14 Oct 2026

Solving Hard Mizar Problems with Instantiation and Strategy Invention

arXiv 2406.17762 ↗First posted 25 Jun 2024cs.AI cs.LG cs.LOcited by 1

Not on the map. Why?

Abstract (arXiv)

In this work, we prove over 3000 previously ATP-unproved Mizar/MPTP problems by using several ATP and AI methods, raising the number of ATP-solved Mizar problems from 75% to above 80%. First, we start to experiment with the cvc5 SMT solver which uses several instantiation-based heuristics that differ from the superposition-based systems, that were previously applied to Mizar,and add many new solutions. Then we use automated strategy invention to develop cvc5 strategies that largely improve cvc5's performance on the hard problems. In particular, the best invented strategy solves over 14% more problems than the best previously available cvc5 strategy. We also show that different clausification methods have a high impact on such instantiation-based methods, again producing many new solutions. In total, the methods solve 3021 (21.3%) of the 14163 previously unsolved hard Mizar problems. This is a new milestone over the Mizar large-theory benchmark and a large strengthening of the hammer methods for Mizar.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 56 references that are in the map. First posted on arXiv 25 Jun 2024.

Builds on

16 of 56 references.

References · 16

  1. 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 230
  2. 2014ParamILS: An Automatic Algorithm Configuration Frameworkcited by 89
  3. 2017ENIGMA: Efficient Learning-based Inference Guiding Machinecited by 26
  4. 2013MizAR 40 for Mizar 40cited by 23
  5. 2019Property Invariant Embedding for Automated Reasoningcited by 22
  6. 2019Hammering Mizar by Learning Clause Guidancecited by 20
  7. 2021Vampire With a Brain Is a Good ITP Hammercited by 10
  8. 2021Fast and Slow Enigmas and Parental Guidancecited by 8
  9. 2022The Isabelle ENIGMAcited by 8
  10. 2023MizAR 60 for Mizar 50cited by 6
  11. 2016BliStrTune: Hierarchical Invention of Theorem Proving Strategiescited by 5
  12. 2023Graph Sequence Learning for Premise Selectioncited by 5
4 more
  1. 2022Lash 1.0 (System Description)cited by 4
  2. 2021Fair and Adventurous Enumeration of Quantifier Instantiationscited by 3
  3. 2018On Solving Quantified Bit-Vectors using Invertibility Conditionscited by 1
  4. 2020Bitwuzla at the SMT-COMP 2020cited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Agentic MIP Research: Accelerated Constraint Handler Generation
  2. 2026LLM-Guided Quantified SMT Solving over Uninterpreted Functions
  3. 2021Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
  4. 2026FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving
  5. 2025MOTIF: Multi-strategy Optimization via Turn-based Interactive Framework
  6. 2026GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs
  7. 2025Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
  8. 2026Teaching LLMs to Generate Challenging MILP Instances via Solver Feedback