SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2020

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

QF_UF (Incremental Track)

Competition results for the QF_UF division in the Incremental Track.

Page generated on 2020-07-04 11:47:56 +0000

Benchmarks: 306
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
Yices2 incremental

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
2019-Yices 2.6.2 Incrementaln 0 61273.19361.38300 0
Yices2-fixed incrementaln 0 61277.41564.33800 0
Yices2 incremental 0 61278.50565.09700 0
z3n 0 612186.102173.30500 0
CVC4-inc 0 612438.578410.300 0
SMTInterpol 0 6121297.261469.07500 0
SMTInterpol-fixedn 0 6121291.405472.12600 0
OpenSMT 0 6112858.2482840.58111 0
MathSAT5n 0 574144.304127.049380 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.