Benchmark
incremental/UFDTNIA/20201212-Barrett/memory.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>.
| Status | unsat |
| Inferred Status | None |
| Size | 35429 |
| Compressed Size | 6226 |
| Max. Term Depth | 39 |
| Asserts | 68 |
| Declared Functions | 50 |
| Declared Constants | 37 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 12 |
false | 7 |
Bool | 1 |
ite | 26 |
not | 8 |
or | 14 |
and | 106 |
=> | 59 |
= | 154 |
distinct | 1 |
forall | 63 |
let | 51 |
Int | 57 |
div | 1 |
+ | 11 |
- | 6 |
* | 1 |
< | 22 |
<= | 34 |
> | 1 |
>= | 16 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 40712 |
| Compressed Size | 6760 |
| Max. Term Depth | 50 |
| Asserts | 68 |
| Declared Functions | 51 |
| Declared Constants | 64 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 17 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 10 |
or | 14 |
and | 115 |
=> | 73 |
= | 168 |
distinct | 1 |
forall | 64 |
let | 60 |
Int | 58 |
div | 1 |
+ | 11 |
- | 7 |
* | 1 |
< | 22 |
<= | 34 |
> | 1 |
>= | 16 |
| | | | | |