SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2020

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

QF_UFLRA (Incremental Track)

Competition results for the QF_UFLRA division in the Incremental Track.

Page generated on 2020-07-04 11:47:56 +0000

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

Winners

Parallel Performance
Yices2 incremental

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
z3n 0 97938634.8438344.72500 0
2019-Z3n 0 97938972.9148891.38700 0
MathSAT5n 0 97918750.5768476.95621 0
Yices2 incremental 0 978011944.71711753.99134 0
Yices2-fixed incrementaln 0 978011995.88111804.362134 0
SMTInterpol 0 977734926.13728766.239168 0
SMTInterpol-fixedn 0 977735175.42929015.765168 0
CVC4-inc 0 977637957.08437574.441179 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.