SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_Equality_LinearArith (Parallel Track)

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

Results were generated on 2025-08-11

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

Logics:

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
-SMTSYices2SMTSYices2

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
SMTS015549824.764812.8515213530460
Yices2010443774.953480.681073580580
SMTS (32 cores) n000.000.0000068000
SMTS (64 cores) n000.000.0000068000
n: non-competing solver

SAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Yices207355486.102787.2977065560
SMTS0230476.05241.202201155100
SMTS (32 cores) n000.000.00000135500
SMTS (64 cores) n000.000.00000135500
n: non-competing solver

UNSAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
SMTS013519348.704571.65130132332210
Yices20388288.86693.393033332330
SMTS (32 cores) n000.000.00000363200
SMTS (64 cores) n000.000.00000363200
n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Yices2012772.2622.7711006700
SMTS (32 cores) n000.000.0000068000
SMTS (64 cores) n000.000.0000068000
n: non-competing solver