Benchmark
incremental/UFDTNIA/20201212-Barrett/defines.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 | 31131 |
| Compressed Size | 5598 |
| Max. Term Depth | 30 |
| Asserts | 65 |
| Declared Functions | 50 |
| Declared Constants | 22 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 15 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 14 |
or | 12 |
and | 89 |
=> | 68 |
= | 136 |
forall | 61 |
let | 47 |
Int | 55 |
div | 1 |
+ | 21 |
- | 10 |
* | 1 |
< | 20 |
<= | 31 |
> | 2 |
>= | 20 |
| Status | unsat |
| Inferred Status | None |
| Size | 39122 |
| Compressed Size | 6355 |
| Max. Term Depth | 57 |
| Asserts | 65 |
| Declared Functions | 51 |
| Declared Constants | 41 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 21 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 20 |
or | 13 |
and | 111 |
=> | 101 |
= | 173 |
forall | 63 |
let | 67 |
Int | 57 |
div | 1 |
+ | 9 |
- | 11 |
* | 1 |
< | 21 |
<= | 28 |
> | 1 |
>= | 15 |