Benchmark
incremental/UFDTNIA/20201212-Barrett/SlidingNonce.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 | 48189 |
| Compressed Size | 7394 |
| Max. Term Depth | 65 |
| Asserts | 74 |
| Declared Functions | 54 |
| Declared Constants | 46 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 21 |
false | 12 |
Bool | 3 |
ite | 26 |
not | 23 |
or | 15 |
and | 141 |
=> | 137 |
= | 205 |
distinct | 1 |
forall | 68 |
let | 73 |
Int | 63 |
div | 1 |
+ | 9 |
- | 15 |
* | 1 |
< | 21 |
<= | 33 |
> | 2 |
>= | 21 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 42992 |
| Compressed Size | 6721 |
| Max. Term Depth | 47 |
| Asserts | 74 |
| Declared Functions | 54 |
| Declared Constants | 60 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 15 |
false | 9 |
Bool | 3 |
ite | 26 |
not | 31 |
or | 18 |
and | 116 |
=> | 93 |
= | 159 |
distinct | 1 |
forall | 68 |
let | 55 |
Int | 63 |
div | 1 |
+ | 9 |
- | 10 |
* | 1 |
< | 21 |
<= | 33 |
> | 1 |
>= | 20 |
| | | | | |