Journal of Automated Reasoning

, Volume 50, Issue 3, pp 243-277

First online:

6 Years of SMT-COMP

  • Clark BarrettAffiliated withNew York University
  • , Morgan DetersAffiliated withNew York University
  • , Leonardo de MouraAffiliated withMicrosoft Research
  • , Albert OliverasAffiliated withTechnical University of Catalonia Email author 
  • , Aaron StumpAffiliated withThe University of Iowa

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The annual Satisfiability Modulo Theories Competition (SMT-COMP) was initiated in 2005 in order to stimulate the advance of state-of-the-art techniques and tools developed by the Satisfiability Modulo Theories (SMT) community. This paper summarizes the first six editions of the competition. We present the evolution of the competition’s organization and rules, show how the state of the art has improved over the course of the competition, and discuss the impact SMT-COMP has had on the SMT community and beyond. Additionally, we include an exhaustive list of all competitors, and present experimental results showing significant improvement in SMT solvers during these six years. Finally, we analyze to what extent the initial goals of the competition have been achieved, and sketch future directions for the competition.


SAT Modulo Theories Competition Experimental evaluation