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

QF_LRA (Unsat Core Track)

Competition results for the QF_LRA division in the Unsat Core Track.

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

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

Winners

Sequential PerformanceParallel Performance
Yices 2.6.2Yices 2.6.2

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
Yices 2.6.2 0 152565 117784.495 117791.80931 0
CVC4-uc 0 149296 46960.281 46967.2753 0
2018-SMTInterpol (unsat core)n 0 148987 86877.656 76175.74414 0
Z3n 0 128066 85962.205 85954.76419 0
SMTInterpol 0 110008 155484.085 151624.53132 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
Yices 2.6.2 0 152565117787.755117791.02931 0
CVC4-uc 0 14929646961.44146967.0953 0
2018-SMTInterpol (unsat core)n 0 14898786877.65676175.74414 0
Z3n 0 12806685964.39585954.27419 0
SMTInterpol 0 110008155484.085151624.53132 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.