🤖 AI Summary
This work addresses functional equation solving in International Mathematical Olympiad (IMO) problems—specifically those involving uninterpreted functions and nonlinear real constraints—a domain requiring only high-school mathematics yet posing severe challenges for state-of-the-art SMT solvers. We propose the first dedicated SMT framework for this class, integrating novel techniques: semantic abstraction of function symbols, symbolic-numerical hybrid search, interval-analysis- and CEGAR-guided constraint propagation, and domain-specific heuristic search strategies. Evaluated on 32 authentic IMO problems and variants, our solver achieves an 87% success rate in computing complete solution sets, outperforming baseline solvers (Z3, dReal) by an average factor of 12× in runtime. It delivers the first fully automated, formally verifiable solutions to several long-standing IMO classics. This advances the frontier of SMT applicability in higher-order mathematical reasoning.
📝 Abstract
We use SMT technology to address a class of problems involving uninterpreted functions and nonlinear real arithmetic. In particular, we focus on problems commonly found in mathematical competitions, such as the International Mathematical Olympiad (IMO), where the task is to determine all solutions to constraints on an uninterpreted function. Although these problems require only high-school-level mathematics, state-of-the-art SMT solvers often struggle with them. We propose several techniques to improve SMT performance in this setting.