SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_ABVFP (Incremental Track)

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

Results were generated on 2026-07-25

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

Winners

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

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Bitwuzla0689197860.757860.2902242020
cvc5060359268274.44268273.540224203100
z3-BooledASS ne00
(base +0)		13.3317.0002242000
z3-BooledASS-base n000.000.0002242000
(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
Bitwuzla0675521108.561108.56021994300
cvc50385333500.193500.1901685557430
z3-BooledASS ne00
(base +0)		13.3317.0002242000
z3-BooledASS-base n000.000.0002242000
(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