SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFNIA (Incremental Track)

Competition results for the QF_UFNIA logic in the Incremental Track. Chart

Results were generated on 2026-07-25

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

Winners

Parallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
cvc5--SMTInterpol

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
cvc50979548684.268684.340501050
SMTInterpol096854563.29563.290501000
Yices20355322423.382423.380501080
z3-BooledASS ne00
(base +0)		3.033.850501000
z3-BooledASS-base n000.000.000501000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
SMTInterpol012281495.97495.970500100
Yices2011856368.09368.0904841760
cvc509618955.39955.3904584340
z3-BooledASS ne00
(base +0)		3.033.850501000
z3-BooledASS-base n000.000.000501000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver