Benchmark
incremental/UFDTNIA/20201212-Barrett/XDX.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 | 364794 |
| Compressed Size | 30176 |
| 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 | 362711 |
| Compressed Size | 29881 |
| Max. Term Depth | 431 |
| Asserts | 155 |
| Declared Functions | 65 |
| Declared Constants | 355 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 136 |
false | 27 |
Bool | 3 |
ite | 27 |
not | 324 |
or | 169 |
and | 1306 |
=> | 1104 |
= | 1292 |
distinct | 1 |
forall | 168 |
exists | 7 |
let | 545 |
Int | 149 |
div | 7 |
+ | 14 |
- | 52 |
* | 1 |
< | 120 |
<= | 201 |
> | 38 |
>= | 156 |
| | | |
| Status | unsat |
| Inferred Status | None |
| Size | 56240 |
| Compressed Size | 8949 |
| Max. Term Depth | 16 |
| Asserts | 155 |
| Declared Functions | 65 |
| Declared Constants | 356 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 12 |
false | 9 |
Bool | 3 |
ite | 26 |
not | 12 |
or | 14 |
and | 63 |
=> | 38 |
= | 200 |
distinct | 1 |
forall | 77 |
let | 36 |
Int | 64 |
div | 1 |
+ | 9 |
- | 6 |
* | 1 |
< | 20 |
<= | 25 |
> | 1 |
>= | 13 |
| | | | | |