Benchmark
non-incremental/UFDTNIA/20241211-verus/splinterdb/marshalling__math_vlib_marshalling.math_v.distribute_left._01.smt2
Benchmarks generated by the Rust verifier Verus (https://verus-lang.github.io/verus/guide/) on the project SplinterDB and processed using Mariposa (https://github.com/secure-foundations/mariposa). z3 solves this without nonlinear, but it cannot be expressed in SMTLib without a nonlinear theory.
This benchmarks was originally run with z3 with the following options:
(set-option :auto_config false)
(set-option :smt.mbqi false)
(set-option :smt.case_split 3)
(set-option :smt.qi.eager_threshold 100.0)
(set-option :smt.delay_units true)
(set-option :smt.arith.solver 2)
(set-option :smt.arith.nl false)
(set-option :pi.enabled false)
(set-option :rewriter.sort_disjunctions false)
(set-option :smt.arith.solver 6)
| Benchmark |
|---|
| Size | 24750 |
| Compressed Size | 4467 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2025-08-11 |
| Generated By | Amar Shah |
| Generated On | 2024-12-11 00:00:00 |
| Generator | Verus |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | unsat |
| Size | 24742 |
| Compressed Size | 4481 |
| Max. Term Depth | 13 |
| Asserts | 100 |
| Declared Functions | 76 |
| Declared Constants | 46 |
| Declared Sorts | 7 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 2 |
Symbols
true | 3 |
false | 2 |
Bool | 5 |
not | 3 |
or | 6 |
and | 67 |
=> | 71 |
= | 73 |
distinct | 1 |
forall | 78 |
Int | 65 |
div | 1 |
mod | 1 |
+ | 2 |
- | 6 |
* | 1 |
< | 20 |
<= | 56 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2025
|
0.33 (2/3) |
cvc5 |
cvc5 |
unsat ✅
|
0.36649
|
0.24283
|
| |
iProver |
iProver v3.9.3 |
unsat ✅
|
0.87748
|
1.04987
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
1201.48730
|
1284.80102
|