SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_AUFBV (Model Validation Track)

Competition results for the QF_AUFBV logic in the Model Validation Track. Chart

Results were generated on 2025-08-11

Benchmarks: 25
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 Unsolved Abstained Timeout Memout
Bitwuzla 0 25 656.52 659.72 25 25 0 0 0 0
cvc5 0 12 798.23 799.85 12 12 13 0 10 2
SMTInterpol 0 4 1162.98 1092.39 4 4 21 0 12 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 25 656.52 659.72 25 25 0 0 0 0
cvc5 0 12 798.23 799.85 12 12 13 0 10 2
SMTInterpol 0 4 1162.98 1092.39 4 4 21 0 12 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 25 656.52 659.72 25 25 0 0 0 0
cvc5 0 12 798.23 799.85 12 12 13 0 10 2
SMTInterpol 0 4 1162.98 1092.39 4 4 21 0 12 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
Bitwuzla 0 16 26.19 28.18 16 16 0 9 0 0
cvc5 0 10 43.66 44.87 10 10 1 14 0 0
SMTInterpol 0 2 4.69 2.00 2 2 6 17 0 0