SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

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

UF (Incremental Track)

Competition results for the UF logic in the Incremental Track.

Page generated on 2023-07-06 16:05:24 +0000

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

Winners

Parallel Performance
cvc5

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2020-z3n 0 107078536819.18537015.77252499919 0
cvc5 0 2688139903.8740050.99332696932 0
SMTInterpol 0 18342138811.7678847.433412351621 0
UltimateEliminator+MathSAT 0 00.00.03595770 0
Yices2 0 00.00.03595770 0
Yices2 Fixedn 0 00.00.03595770 0

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