SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2019

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

LRA (Incremental Track)

Competition results for the LRA division in the Incremental Track.

Page generated on 2019-07-23 17:57:24 +0000

Benchmarks: 5
Time Limit: 2400 seconds
Memory Limit: 60 GB

Winners

Parallel Performance

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
CVC4-inc 0 00.030.043159690 0
Z3n 0 00.1690.168159690 0
SMTInterpol 0 01.0160.886159690 0
UltimateEliminator+SMTInterpol 0 015.1729.788159690 0
UltimateEliminator+MathSAT-5.5.4 0 015.33910.952159690 0
UltimateEliminator+Yices-2.6.1 0 015.71911.028159690 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.