Benchmark
non-incremental/UFNIA/2019-Preiner/qf/t3_rw536.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 | 3263 |
| Compressed Size | 1085 |
| 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 | 3255 |
| Compressed Size | 1096 |
| 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 2023
|
0.50 (2/4) |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
0.02447
|
0.02502
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.03642
|
0.03697
|
| |
iProver |
iProver-3.8-fix_iprover_SMT |
unknown ❌
|
1200.05000
|
4748.35000
|
| |
UltimateEliminator |
UltimateEliminator+MathSAT-5.6.9_default |
sat ✅
|
3.00558
|
4.97934
|
| |
Vampire |
vampire_4.8_smt_pre_vampire_smtcomp |
unknown ❌
|
1200.12000
|
4769.67000
|