SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_UFDTLIA (Single Query Track)

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

Results were generated on 2025-08-11

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

Winners

Sequential Performance Parallel Performance SAT Performance (parallel) UNSAT Performance (parallel) 24 seconds Performance (parallel)
SMTInterpol SMTInterpol SMTInterpol 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
SMTInterpol 0 57 10536.93 9377.87 57 44 13 19 0 18 0
cvc5 0 40 5722.07 5727.87 40 33 7 36 0 36 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
SMTInterpol 0 57 10536.93 9377.87 57 44 13 19 0 18 0
cvc5 0 40 5722.07 5727.87 40 33 7 36 0 36 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Solved UNSAT Unsolved Abstained Timeout Memout
SMTInterpol 0 44 8081.79 7211.96 44 44 0 1 31 0 0
cvc5 0 33 5332.20 5337.10 33 33 0 12 31 12 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 13 2455.14 2165.91 13 0 13 0 63 0 0
cvc5 0 7 389.87 390.77 7 0 7 6 63 6 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 24 476.90 208.31 24 18 6 0 52 0 0
cvc5 0 21 187.59 190.18 21 17 4 0 55 0 0