Benchmark
non-incremental/UFDTNIA/20201212-Barrett/update_minting_ability.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 | 105825 |
| Compressed Size | 11080 |
| 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 | 1 |
| Status | unsat |
| Inferred Status | None |
| Size | 105801 |
| Compressed Size | 11093 |
| Max. Term Depth | 90 |
| Asserts | 134 |
| Declared Functions | 62 |
| Declared Constants | 126 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 35 |
false | 8 |
Bool | 1 |
ite | 26 |
not | 38 |
or | 31 |
and | 277 |
=> | 170 |
= | 299 |
distinct | 1 |
forall | 103 |
let | 110 |
Int | 83 |
div | 1 |
+ | 10 |
- | 8 |
* | 1 |
< | 44 |
<= | 76 |
> | 1 |
>= | 50 |
| | | | | |