SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_Equality_LinearArith (Incremental Track)

Competition results for the QF_Equality_LinearArith division in the Incremental Track. Chart

Results were generated on 2025-08-11

Benchmarks: 2031
Time Limit: 1200 seconds
Memory Limit: 30720 GB

Logics:

Winners

Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
SMTInterpol - - Yices2

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
SMTInterpol 0 4437647 135729.58 133683.28 0 2031 0 103 0
cvc5 0 4245014 155811.28 155807.00 0 2031 0 104 0
Yices2 0 3451284 87203.32 87190.66 0 2031 0 81 0
OpenSMT 0 449310 224544.23 224546.53 0 2031 0 189 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 667780 1336.03 1336.03 0 1871 160 0 0
SMTInterpol 0 325978 3650.90 3650.90 0 1746 285 0 0
cvc5 0 312027 2634.89 2634.89 0 1774 257 2 0
OpenSMT 0 40228 1343.26 1346.09 0 1726 305 9 0