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_ANIA (Incremental Track)

Competition results for the QF_ANIA logic in the Incremental Track.

Page generated on 2021-07-18 17:30:28 +0000

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

Winners

Parallel Performance
SMTInterpol

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
z3n 0 5172456.44252.7100 0
SMTInterpol 0 51724272.45494.90900 0
cvc5-inc 0 434292017.7322014.14182951 0
2020-MathSAT5n 0 1210112.88312.717396230 0
MathSAT5n 0 1210115.13814.956396230 0

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