Benchmark
incremental/UFDTNIA/20201212-Barrett/performance_200511.smt2
From the test suite for the Move Prover, a verifier for smart contracts in the
Move programming language. A paper about the tool is here:
https://doi.org/10.1007/978-3-030-53288-8_7
The Move Prover code and tests are available at:
https://github.com/diem/diem/tree/main/language/move-prover
The benchmarks were generated using the master branch and standard test suite
as of Dec 17, 2020. Submitted by Clark Barrett <barrett@cs.stanford.edu>.
| Benchmark |
|---|
| Size | 101063 |
| Compressed Size | 12442 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 2 |
| Status | unsat |
| Inferred Status | None |
| Size | 54933 |
| Compressed Size | 8300 |
| Max. Term Depth | 72 |
| Asserts | 78 |
| Declared Functions | 54 |
| Declared Constants | 70 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 20 |
false | 10 |
Bool | 1 |
ite | 28 |
not | 19 |
or | 16 |
and | 162 |
=> | 135 |
= | 239 |
distinct | 1 |
forall | 71 |
let | 92 |
Int | 65 |
div | 1 |
+ | 22 |
- | 16 |
* | 1 |
< | 28 |
<= | 41 |
> | 6 |
>= | 22 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 75015 |
| Compressed Size | 9888 |
| Max. Term Depth | 97 |
| Asserts | 78 |
| Declared Functions | 54 |
| Declared Constants | 125 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 27 |
false | 11 |
Bool | 1 |
ite | 30 |
not | 29 |
or | 18 |
and | 213 |
=> | 195 |
= | 300 |
distinct | 1 |
forall | 74 |
let | 121 |
Int | 68 |
div | 1 |
+ | 23 |
- | 24 |
* | 1 |
< | 33 |
<= | 48 |
> | 7 |
>= | 29 |
| | | | | |