SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2019

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

BVFP (Incremental Track)

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

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
CVC4-inc 0 322416839.11116838.96528317 0
UltimateEliminator+MathSAT-5.5.4 0 237882.0652.7936770 0
Z3n 0 00.030.10660550 0

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.