SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_LinearIntArith (Incremental Track)

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

Results were generated on 2025-08-11

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

Logics:

Winners

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

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 14770476 26783.62 26783.62 0 69 0 18 0
SMTInterpol 0 14543206 43915.76 43915.76 0 69 0 36 0
cvc5 0 3879902 61271.27 61271.27 0 69 0 54 0
OpenSMT 0 1265584 50943.69 50943.69 0 69 0 40 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Unsolved Abstained Timeout Memout
Yices2 0 874094 108.69 108.69 0 18 51 0 0
OpenSMT 0 1818 82.51 82.51 0 13 56 0 0
cvc5 0 1111 61.90 61.90 0 9 60 0 0
SMTInterpol 0 606 37.78 37.78 0 4 65 0 0