极光节点

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.
初级翻墙-傻瓜式搭建Shadowsocks/R教程(适用于PC、安卓 ...:2021-6-16 · 搬瓦工已经取消了一键搭建shadowsocks这个功能，可众尝试使用秋水大大的一键脚本解决问题。
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.

极光节点

Feb 11, 2024

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

极光节点

May 9, 2024

A new release of the SMT-LIB benchmark library (2024-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). shadowsockr安卓客户端4.7.4

极光节点

May 20, 2018

A new release of the SMT-LIB benchmark library (2018-05-20) is now available, both on the GitLab server and on shadowsock r. For this release we have fixed minor errors in formatting; removed duplicate benchmarks; updated statuses of previously unknown non-incremental benchmarks; and added new benchmarks in new logics. [More]

SMT-LIB The Satisfiability Modulo Theories Library

极光节点

极光节点

极光节点

SMT-LIB
The Satisfiability Modulo Theories Library