Benchmark
non-incremental/UFNIA/2019-Preiner/qf/t3_rw335.smt2
Publications: "Towards Bit-Width-Independent Proofs in SMT Solvers " by A. Niemetz, M. Preiner, A. Reynolds, Y. Zohar, C. Barrett, and C. Tinelli, CADE-27 (2019).
| Benchmark |
|---|
| Size | 3262 |
| Compressed Size | 1086 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2019-07-07 |
| Generated By | Mathias Preiner |
| Generated On | 2019-03-22 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | sat |
| Size | 3254 |
| Compressed Size | 1095 |
| Max. Term Depth | 7 |
| Asserts | 2 |
| Declared Functions | 4 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 28 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 2 |
| Declared Datatypes | 0 |
Symbols
true | 3 |
Bool | 12 |
ite | 3 |
not | 1 |
and | 4 |
=> | 1 |
= | 8 |
forall | 1 |
Int | 21 |
div | 2 |
mod | 3 |
+ | 2 |
- | 8 |
* | 4 |
< | 1 |
<= | 2 |
> | 2 |
>= | 2 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2022
|
0.20 (4/5) |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.04393
|
0.04429
|
| |
cvc5 |
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.09208
|
0.09262
|
| |
UltimateEliminator |
UltimateEliminator+MathSAT-5.6.7-wrapped_default |
sat ✅
|
3.47975
|
5.46104
|
| |
Vampire |
vampire_4.7_smt_fix-wrapped_vampire_smtcomp |
unknown ❌
|
1200.04000
|
4759.61000
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
0.02087
|
0.02265
|