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

UFDTNIA (Single Query Track)

Competition results for the UFDTNIA division in the Single Query Track.

Page generated on 2019-07-23 17:56:09 +0000

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24s Performance (parallel)
VampireVampire Vampire Vampire

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Vampire 0 1 0.133 0.25510100 0
CVC4 0 1 5.653 5.65310100 0
Alt-Ergo 0 0 2400.0 2400.000011 0

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Vampire 0 1 0.133 0.25510100 0
CVC4 0 1 5.653 5.65310100 0
Alt-Ergo 0 1 7818.71 1970.9710100 0

SAT Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Alt-Ergo 0 0 0.0 0.000010 0
CVC4 0 0 0.0 0.000010 0
Vampire 0 0 0.0 0.000010 0

UNSAT Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Vampire 0 1 0.133 0.25510100 0
CVC4 0 1 5.653 5.65310100 0
Alt-Ergo 0 1 7818.71 1970.9710100 0

24 seconds Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
Vampire 0 1 0.133 0.25510100 0
CVC4 0 1 5.653 5.65310100 0
Alt-Ergo 0 0 24.0 24.000011 0

n Non-competing.