SMT-COMP 2025

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2025

QF_ANIA (Model Validation Track)

Competition results for the QF_ANIA logic in the Model Validation Track. Chart

Results were generated on 2025-08-11

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

Sequential Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 115 335.15 143.32 115 115 6 0 0 0
cvc5 0 95 4968.40 4980.55 95 95 26 0 24 0

Parallel Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 115 335.15 143.32 115 115 6 0 0 0
cvc5 0 95 4968.40 4980.55 95 95 26 0 24 0

SAT Performance Performance

Solver Error Score Correct Score CPU Time Score Wall Time Score Solved Solved SAT Unsolved Abstained Timeout Memout
SMTInterpol 0 115 335.15 143.32 115 115 6 0 0 0
cvc5 0 95 4968.40 4980.55 95 95 26 0 24 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 115 335.15 143.32 115 115 6 0 0 0
cvc5 0 74 134.97 143.93 74 74 2 45 0 0