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 Performance Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
Bitwuzla Bitwuzla Bitwuzla - Bitwuzla

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 37 13.23 17.82 37 37 0 4 0 4 0
cvc5 0 24 831.79 834.87 24 24 0 17 0 16 0
UltimateEliminator+MathSAT 0 12 60.06 34.59 12 12 0 29 0 0 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 37 13.23 17.82 37 37 0 4 0 4 0
cvc5 0 24 831.79 834.87 24 24 0 17 0 16 0
UltimateEliminator+MathSAT 0 12 60.06 34.59 12 12 0 29 0 0 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 37 13.23 17.82 37 37 0 0 4 0 0
cvc5 0 24 831.79 834.87 24 24 0 13 4 12 0
UltimateEliminator+MathSAT 0 12 60.06 34.59 12 12 0 25 4 0 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
Bitwuzla 0 37 13.23 17.82 37 37 0 0 4 0 0
cvc5 0 22 8.90 11.63 22 22 0 1 18 0 0
UltimateEliminator+MathSAT 0 12 60.06 34.59 12 12 0 29 0 0 0