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

AUFBVDTNIA (Single Query Track)

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

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

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

Winners

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

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 0 0.022 0.02100010 0
cvc5 - fixedn 0 0 0.023 0.02200010 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 00.0220.02100010 0
cvc5 - fixedn 0 00.0230.02200010 0

SAT Performance

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

UNSAT Performance

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

24 seconds Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 00.0220.02100010 0
cvc5 - fixedn 0 00.0230.02200010 0

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