SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_DT (Single Query Track)

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

Results were generated on 2025-08-11

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

Winners

Sequential Performance Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
cvc5 cvc5 cvc5 SMTInterpol SMTInterpol

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
cvc5 0 167 29768.39 29793.10 167 54 113 185 0 185 0
SMTInterpol 0 153 15825.96 10471.27 154 20 134 198 0 184 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
cvc5 0 167 29768.39 29793.10 167 54 113 185 0 185 0
SMTInterpol 0 154 17039.34 11651.14 154 20 134 198 0 184 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
cvc5 0 54 7531.58 7539.56 54 54 0 8 290 8 0
SMTInterpol 0 20 3281.17 3059.08 20 20 0 42 290 42 0

UNSAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
SMTInterpol 0 134 13758.18 8592.06 134 0 134 53 165 43 0
cvc5 0 113 22236.81 22253.54 113 0 113 74 165 74 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
SMTInterpol 0 111 929.79 450.07 111 10 101 0 241 0 0
cvc5 0 83 260.61 270.84 83 16 67 0 269 0 0