SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Previous Competitions
SMT-LIB

SMT-COMP 2019

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

QF_LIA (Incremental Track)

Competition results for the QF_LIA division in the Incremental Track.

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

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

Winners

Parallel Performance
Yices 2.6.2 Incremental

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
2018-Yices (incremental)n 0 20040582 51875.963 51416.51363214 0
Yices 2.6.2 Incremental 0 20040572 52785.18 52329.3864214 0
Z3n 0 20039935 80948.221 80421.128127924 0
SMTInterpol 0 19927683 92010.063 89918.03111353128 0
CVC4-inc-fixedn 0 12152396 108396.413 108217.908788881839 0
CVC4-inc 0 0 1.726 4.551200412140 0

n Non-competing.