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_UFDT (Proof Exhibition Track)

Competition results for the QF_UFDT logic in the Proof Exhibition Track.

Page generated on 2022-08-10 11:19:33 +0000

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

This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 13 116077.972 113938.2318791 0
cvc5 0 0 119964.34 120005.710099 1
cvc5-lfsc 0 0 119965.47 120005.4110099 1

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
smtinterpol 0 13116325.342113009.6058787 0
cvc5 0 0120000.0120000.010099 1
cvc5-lfsc 0 0120000.0120000.010099 1

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