SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

ABVFPLRA (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla-fixed n0226945.7245.7204000
Bitwuzla0226946.4846.4804000
cvc5081811.9011.9004010
UltimateEliminator+MathSAT081867.3567.3504000
z3-BooledASS ne00
(base +0)
0.020.0304000
z3-BooledASS-base n000.000.0004000
(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
cvc5081811.9011.9004010
UltimateEliminator+MathSAT074222.2622.2603100
Bitwuzla06242.912.9103100
Bitwuzla-fixed n06242.972.9703100
z3-BooledASS ne00
(base +0)
0.020.0304000
z3-BooledASS-base n000.000.0004000
(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