SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_NonLinearIntArith (Incremental Track)

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

Results were generated on 2025-08-11

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

Logics:

Winners

Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
Z3-Inc-Z3++ - - Yices2

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Z3-Inc-Z3++ 0 4228444
(base +1576)
37335.66 37336.38 0 119 0 7 0
SMTInterpol 0 4202459 30562.64 30304.78 0 119 0 16 0
cvc5 0 1693653 129698.38 129769.63 0 119 0 106 0
Yices2 0 314141 99078.29 99125.48 0 119 0 86 0
Z3-Inc-Z3++-base n 0 4226868 90321.79 90360.28 0 119 0 69 0
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 3659 154.16 154.16 0 19 100 1 0
SMTInterpol 0 1585 288.24 288.24 0 64 55 0 0
Z3-Inc-Z3++ 0 1250
(base -81)
40.15 40.15 0 9 110 0 0
cvc5 0 1035 21.17 21.17 0 5 114 0 0
Z3-Inc-Z3++-base n 0 1331 68.61 68.61 0 12 107 2 0
(base +/- n): for derived solvers: increment over base solver
n: non-competing solver