SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

AUFBVDTLIA (Single Query Track)

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

Results were generated on 2025-08-11

Benchmarks: 784
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 cvc5 cvc5

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 387 72595.46 72652.62 387 178 209 397 0 357 0
SMTInterpol 0 127 1194.11 866.04 127 1 126 657 0 435 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 387 72595.46 72652.62 387 178 209 397 0 357 0
SMTInterpol 0 127 1194.11 866.04 127 1 126 657 0 435 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 178 47029.29 47057.41 178 178 0 0 606 0 0
SMTInterpol 0 1 0.42 0.43 1 1 0 177 606 88 0

UNSAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
cvc5 0 209 25566.17 25595.22 209 0 209 0 575 0 0
SMTInterpol 0 126 1193.69 865.62 126 0 126 83 575 79 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
cvc5 0 146 62.22 80.28 146 8 138 0 638 0 0
SMTInterpol 0 123 375.89 162.86 123 1 122 188 473 0 0