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_UFFPDTLIRA (Single Query Track)

Competition results for the QF_UFFPDTLIRA logic in the Single Query Track.

Page generated on 2021-07-18 17:29:07 +0000

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24s Performance (parallel)
cvc5cvc5cvc5 cvc5 cvc5

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 - fixedn 0 154 123.536 123.5561542413000 0
cvc5 0 154 124.047 124.0091542413000 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 - fixedn 0 154123.536123.5561542413000 0
cvc5 0 154124.047124.0091542413000 0

SAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 - fixedn 0 2467.13567.1762424001300 0
cvc5 0 2467.90967.9062424001300 0

UNSAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 0 13056.13856.10313001300240 0
cvc5 - fixedn 0 13056.40256.3813001300240 0

24 seconds Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 15387.69387.6491532313011 0
cvc5 - fixedn 0 15387.96787.9841532313011 0

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