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

Bitwuzla

Competing yes
Single Query Track QF_ABV, QF_ABVFP, QF_ABVFPLRA, QF_AUFBV, QF_AUFBVFP, QF_BV, QF_BVFP, QF_BVFPLRA, QF_FP, QF_FPLRA, QF_UFBV, QF_UFFP
Incremental Track QF_ABV, QF_ABVFP, QF_AUFBV, QF_BV, QF_BVFP, QF_FP, QF_UFBV, QF_UFFP
Unsat Core Track QF_ABV, QF_ABVFP, QF_ABVFPLRA, QF_AUFBV, QF_AUFBVFP, QF_BV, QF_BVFP, QF_BVFPLRA, QF_FP, QF_FPLRA, QF_UFBV, QF_UFFP
Model Validation Track QF_BV, QF_UFBV
Cloud Track
Parallel Track
Preliminary ID 33006
Final ID 33292
Seed 42
System Description Bitwuzla at the SMT-COMP 2021
Variant of Submission ID
Derived from Solver
Wrapped Solvers
Website https://bitwuzla.github.io
Team Members Aina Niemetz, Mathias Preiner
Contact preiner@cs.stanford.edu