SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

UFDTNIA (Single Query Track)

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

Results were generated on 2025-08-11

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
cvc5cvc5-cvc5cvc5

Sequential Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
cvc5036655708.0355761.13366036613801320
iProver v3.9.3016831413.538204.612190219285024639
SMTInterpol0541475.01616.075405445001950

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
cvc5036655708.0355761.13366036613801320
iProver v3.9.30219168468.7742850.282190219285024639
SMTInterpol0541475.01616.075405445001950

UNSAT Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
cvc5036655708.0355761.13366036613801320
iProver v3.9.30219168468.7742850.282190219285024639
SMTInterpol0541475.01616.075405445001950

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeoutMemout
cvc50199831.08855.651990199130400
iProver v3.9.3079857.02275.6179079042500
SMTInterpol047702.31297.0647047045700