SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2017

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides
Report

QF_ALIA (Application Track)

Competition results for the QF_ALIA division as of Tue Jul 18 22:06:21 GMT

Benchmarks in this division: 44
Time Limit: 2400s

Winner : SMTInterpol

Result table1

Parallel Performance

Solver Error Score Correct Score avg. CPU time avg. WALL time
CVC4 0 520081 13371.52 13782.18
SMTInterpol 0 530398 2292.31 1421.82
Yices2 0 530385 2790.88 2721.81
mathsat-5.4.1n 0 523277 2156.04 2071.51
z3-4.5.0n 0 530398 757.37 688.65

n. Non-competing.

1. Scores are computed according to Section 7 of the rules.