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_ANIA (Incremental Track)

Competition results for the QF_ANIA 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
CVC4-inc

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
2018-Z3 (incremental)n 0 51724 56.624 53.17800 0
Z3n 0 51724 59.406 56.02800 0
CVC4-inc 0 48503 2822.621 2818.97432211 0
MathSAT-default 0 12101 12.547 12.005396230 0
MathSAT-na-ext 0 12101 14.018 13.442396230 0

n Non-competing.