SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_UFLRA (Incremental Track)

Competition results for the QF_UFLRA logic in the Incremental Track.

Page generated on 2021-07-18 17:30:28 +0000

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

Winners

Parallel Performance
Yices2 incremental

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2020-z3n 0 1310414102.4213802.69610 0
Yices2 incremental 0 1309013469.46413134.742152 0
cvc5-inc 0 1304648630.51347934.0495914 0
MathSAT5n 0 1293416253.67615942.3741715 0
SMTInterpol 0 1260062854.6950406.8850524 0
z3n 0 12414136477.111136331.28369183 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.