SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_BVFPLRA (Incremental Track)

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

Results were generated on 2026-07-25

Benchmarks: 64
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
Bitwuzla032784274.59274.59064000
cvc5032729172.67172.67064010
z3-BooledASS ne00
(base +0)		0.380.49064000
z3-BooledASS-base n000.000.00064000
(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
cvc5032061136.45136.45063100
Bitwuzla010139129.28129.28061300
z3-BooledASS ne00
(base +0)		0.380.49064000
z3-BooledASS-base n000.000.00064000
(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