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

Competition results for the QF_UFLIA division in the Incremental Track.

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

Benchmarks: 386
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 762722 175266.991 175209.006387258 0
Z3n 0 759715 198487.166 198467.982687979 0
SMTInterpol 0 757451 242787.652 241991.895914395 0
CVC4-inc 0 756992 210123.105 210094.716960278 0
Yices 2.6.2 Incremental 0 756304 192201.894 192186.0351029077 0

n Non-competing.