SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2022

Rules
Benchmarks
Tools
Specs
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_LRA (Unsat Core Track)

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

Page generated on 2022-08-10 11:18:51 +0000

Benchmarks: 204
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 149491 68959.75 69039.98534 0
Yices2 0 146537 77503.152 77463.75342 0
cvc5 0 142733 45921.027 45899.98514 0
z3-4.8.17n 0 122655 75791.029 75792.74638 0
MathSATn 0 106426 154206.359 154236.018110 0
smtinterpol 0 86704 116041.785 110903.88960 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
2020-Yices2n 0 14949169046.9169038.48534 0
Yices2 0 14653777508.09277462.15342 0
cvc5 0 14273345924.20745899.38514 0
z3-4.8.17n 0 12265575795.81975791.00638 0
smtinterpol 0 106531116372.135110599.05956 0
MathSATn 0 106426154226.639154230.858110 0

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