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

Competition results for the QF_ABVFP division in the Incremental Track.

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

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

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Bitwuzla-fixedn 0 22259120.35959120.4664747 0
Bitwuzla 0 22160221.93360222.0654848 0
MathSAT5n 0 21960056.32160056.0615050 0
CVC4-inc 0 21861310.55361310.2515151 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.