SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

FPLRA (Single Query Track)

Competition results for the FPLRA logic in the Single Query Track. Chart

Results were generated on 2025-08-11

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
BitwuzlaBitwuzlaBitwuzla-Bitwuzla

Sequential Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla03713.2317.82373704040
cvc5024831.79834.8724240170160
UltimateEliminator+MathSAT01260.0634.591212029000

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla03713.2317.82373704040
cvc5024831.79834.8724240170160
UltimateEliminator+MathSAT01260.0634.591212029000

SAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla03713.2317.82373700400
cvc5024831.79834.8724240134120
UltimateEliminator+MathSAT01260.0634.591212025400

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
Bitwuzla03713.2317.82373700400
cvc50228.9011.632222011800
UltimateEliminator+MathSAT01260.0634.591212029000