SMT-COMP 2019

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Papers
Benchmark Submission
Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

Previous Competitions

SMT-LIB

LIA (Incremental Track)

Competition results for the LIA division in the Incremental Track.

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

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

Winners

Parallel Performance
SMTInterpol

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
2018-Z3 (incremental)n 0 25393 8.565 7.72100 0
Z3n 0 25393 8.924 8.10800 0
SMTInterpol 0 25391 59.775 20.58320 0
UltimateEliminator+SMTInterpol 0 25383 91.89 32.496100 0
UltimateEliminator+MathSAT-5.5.4 0 25383 97.09 39.91100 0
CVC4-inc 0 24486 2416.871 2415.99071 0
UltimateEliminator+Yices-2.6.1 0 0 17.784 8.997253930 0

n Non-competing.