SMT-LIB is an international initiative aimed at facilitating research and development in Satisfiability Modulo Theories (SMT). Since its inception in 2003, the initiative has pursued these aims by focusing on the following concrete goals.

  • Provide standard rigorous descriptions of background theories used in SMT systems.
  • Develop and promote common input and output languages for SMT solvers.
  • Connect developers, researchers and users of SMT, and develop a community around it.
  • Establish and make available to the research community a large library of benchmarks for SMT solvers.
  • Collect and promote software tools useful to the SMT community.
This website provides access to the following main artifacts of the initiative.
  • Documents describing the SMT-LIB input/output language for SMT solvers and its semantics;
  • Specifications of background theories and logics;
  • A large library of input problems, or benchmarks, written in the SMT-LIB language.
  • Links to SMT solvers and related tools and utilities.

Latest News

April 2, 2021

A new release of the SMT-LIB 2.6 reference document is now available. This is a minor release addressing a few errors in the 2017-07-18 release.

Previous News

Latest News

Feb 11, 2020

A theory of Unicode character strings and regular expressions has been added to the set of SMT-LIB theories.

Older News

May 9, 2019

A new release of the SMT-LIB benchmark library (2019-05-09) is now available, both on the GitLab server and on StarExec. For this release, we have added 49,005 new benchmarks in new logics: non-incremental: QF_BVFPLRA (1), QF_FPLRA (13), QF_S (1976), QF_SLIA (46,350), UFDTNIA (1); incremental: QF_AUFBVLIA (441), QF_AUFBVNIA (44), QF_UFBVLIA (179). [More]