SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_Datatypes (Model Validation Track)

Competition results for the QF_Datatypes division in the Model Validation Track. Chart

Results were generated on 2025-08-11

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

Logics:

Winners

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

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 1835 9923.94 9411.30 1835 1835 108 0 106 0
cvc5 0 1315 13982.47 14144.89 1315 1315 628 0 25 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 1835 9923.94 9411.30 1835 1835 108 0 106 0
cvc5 0 1315 13982.47 14144.89 1315 1315 628 0 25 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 1835 9923.94 9411.30 1835 1835 108 0 106 0
cvc5 0 1315 13982.47 14144.89 1315 1315 628 0 25 0

24 seconds Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 1807 961.89 901.95 1807 1807 2 134 0 0
cvc5 0 1221 433.17 581.91 1221 1221 603 119 0 0