SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

Rules
Benchmarks
Specs
Model Validation Track
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_NonLinearIntArith (Model Validation Track)

Competition results for the QF_NonLinearIntArith division in the Model Validation Track.

Page generated on 2023-07-06 16:06:00 +0000

Benchmarks: 7607
Time Limit: 1200 seconds
Memory Limit: 60 GB

Logics: This division is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
Z3++ 0 7450 256987.989 256551.118138 0
ismt 0 7316 297844.868 296688.184165 0
Yices2 0 5724 98630.792 98278.5661883 0
cvc5 0 4841 310043.635 309461.5872766 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
Z3++ 0 7450256987.989256551.118138 0
ismt 0 7316297844.868296688.184281 0
Yices2 0 572498630.79298278.5661883 0
cvc5 0 4841310043.635309461.5872766 0

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.