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

QF_NIA (Incremental Track)

Competition results for the QF_NIA division in the Incremental Track.

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

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

Winners

Parallel Performance
MathSAT-default

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
MathSAT-default 0 4181657 1765.619 1548.16200 0
MathSAT-na-ext 0 4181657 1798.052 1583.03800 0
2018-CVC4 (incremental)n 0 4165515 9395.719 9121.03161421 0
CVC4-inc 0 3635509 14554.658 14363.5255461483 0
Z3n 0 3250402 6375.376 6233.9539312552 0
Yices 2.6.2 Incremental 0 37804 24000.0 24000.0414385310 0

n Non-competing.