Benchmark
incremental/UFDTNIA/20201212-Barrett/marketcap_as_schema_apply.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 | 154408 |
| Compressed Size | 16687 |
| 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 | 5 |
| Status | unsat |
| Inferred Status | None |
| Size | 49992 |
| Compressed Size | 7746 |
| Max. Term Depth | 57 |
| Asserts | 72 |
| Declared Functions | 57 |
| Declared Constants | 51 |
| Declared Sorts | 7 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 19 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 17 |
or | 15 |
and | 143 |
=> | 109 |
= | 204 |
distinct | 1 |
forall | 72 |
let | 71 |
Int | 62 |
div | 1 |
+ | 20 |
- | 13 |
* | 1 |
< | 23 |
<= | 37 |
> | 6 |
>= | 21 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 55491 |
| Compressed Size | 8270 |
| Max. Term Depth | 66 |
| Asserts | 72 |
| Declared Functions | 57 |
| Declared Constants | 89 |
| Declared Sorts | 7 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 22 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 18 |
or | 15 |
and | 153 |
=> | 121 |
= | 223 |
distinct | 1 |
forall | 72 |
let | 80 |
Int | 62 |
div | 7 |
+ | 20 |
- | 13 |
* | 1 |
< | 23 |
<= | 37 |
> | 6 |
>= | 21 |
| | | | | |
| Status | unknown |
| Inferred Status | None |
| Size | 58969 |
| Compressed Size | 8527 |
| Max. Term Depth | 66 |
| Asserts | 72 |
| Declared Functions | 57 |
| Declared Constants | 128 |
| Declared Sorts | 7 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 22 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 20 |
or | 15 |
and | 156 |
=> | 126 |
= | 226 |
distinct | 1 |
forall | 72 |
let | 80 |
Int | 62 |
div | 7 |
+ | 20 |
- | 14 |
* | 1 |
< | 23 |
<= | 37 |
> | 6 |
>= | 21 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 57633 |
| Compressed Size | 8363 |
| Max. Term Depth | 62 |
| Asserts | 72 |
| Declared Functions | 57 |
| Declared Constants | 162 |
| Declared Sorts | 7 |
| 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 | 18 |
or | 15 |
and | 149 |
=> | 118 |
= | 216 |
distinct | 1 |
forall | 72 |
let | 76 |
Int | 62 |
div | 7 |
+ | 19 |
- | 12 |
* | 1 |
< | 23 |
<= | 37 |
> | 6 |
>= | 21 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 61583 |
| Compressed Size | 8730 |
| Max. Term Depth | 66 |
| Asserts | 72 |
| Declared Functions | 57 |
| Declared Constants | 200 |
| Declared Sorts | 7 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 22 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 18 |
or | 15 |
and | 153 |
=> | 121 |
= | 223 |
distinct | 1 |
forall | 72 |
let | 80 |
Int | 62 |
div | 7 |
+ | 20 |
- | 13 |
* | 1 |
< | 23 |
<= | 37 |
> | 6 |
>= | 21 |
| | | | | |