SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

AUFBVDTNIA (Single Query Track)

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

Results were generated on 2025-08-11

Benchmarks: 300
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

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 277 1062.32 1096.57 277 0 277 23 0 23 0
SMTInterpol 0 221 1768.95 1398.67 221 0 221 79 0 53 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 277 1062.32 1096.57 277 0 277 23 0 23 0
SMTInterpol 0 221 1768.95 1398.67 221 0 221 79 0 53 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 277 1062.32 1096.57 277 0 277 23 0 23 0
SMTInterpol 0 221 1768.95 1398.67 221 0 221 79 0 53 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 274 64.36 98.12 274 0 274 0 26 0 0
SMTInterpol 0 194 374.16 175.81 194 0 194 0 106 0 0