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_LIA (Unsat Core Track)

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

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

Benchmarks: 1003
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
Yices2 0 4905914 23312.794 23317.06916 0
z3-4.8.17n 0 4809398 53382.023 53316.40138 0
MathSATn 0 4807969 59821.702 59774.58442 1
2021-cvc5-ucn 0 4385575 98334.369 98777.08265 0
smtinterpol 0 4330734 68646.023 62147.3534 0
cvc5 0 4108148 125280.049 125300.86785 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Yices2 0 490591423317.28423316.47916 0
z3-4.8.17n 0 480939853389.57353315.15138 0
MathSATn 0 480796959828.10259772.97442 1
2021-cvc5-ucn 0 438557598653.02998773.96265 0
smtinterpol 0 433073669301.30362026.532 0
cvc5 0 4108148125293.259125297.53785 0

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