SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_AUFBV (Unsat Core Track)

Competition results for the QF_AUFBV logic in the Unsat Core Track.

Page generated on 2021-07-18 17:31:25 +0000

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

Winners

Sequential PerformanceParallel Performance
Yices2Yices2

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
2020-Yices2n 0 18287 4498.159 4499.2482 0
Yices2 0 18287 4560.53 4516.9462 0
2020-z3n 0 16572 5554.971 5556.73 0
cvc5-uc 0 15959 9544.718 9535.3337 0
z3n 0 15235 11046.874 11790.9029 0
Bitwuzla 0 15171 216.436 216.5390 0
MathSAT5n 0 0 2.847 3.0830 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
2020-Yices2n 0 182874498.6294499.1982 0
Yices2 0 182874560.684516.7862 0
2020-z3n 0 165725556.1015556.573 0
cvc5-uc 0 159599546.8489534.9137 0
z3n 0 1523511570.53411790.4029 0
Bitwuzla 0 15171216.436216.5390 0
MathSAT5n 0 02.8473.0830 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.