Benchmark

incremental/UFDTNIA/20201212-Barrett/RecoveryAddress.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
Size345235
Compressed Size31805
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryindustrial
First Occurrence
Generated By
Generated On
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls3
Query 1
Status unsat
Inferred Status None
Size 131981
Compressed Size15718
Max. Term Depth132
Asserts 258
Declared Functions72
Declared Constants294
Declared Sorts 6
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes8

Symbols

true39 false17 Bool3 ite26
not67 or44 and309 =>329
=535 distinct1 forall120 exists4
let156 Int85 div1 +10
-21 *1 <41 <=64
>5 >=42
Query 2
Status unsat
Inferred Status None
Size 202637
Compressed Size21238
Max. Term Depth237
Asserts 258
Declared Functions72
Declared Constants420
Declared Sorts 6
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes8

Symbols

true66 false19 Bool3 ite26
not120 or65 and572 =>520
=767 distinct1 forall132 exists6
let292 Int108 div1 +13
-24 *1 <70 <=126
>2 >=79
Query 3
Status unsat
Inferred Status None
Size 149109
Compressed Size16349
Max. Term Depth105
Asserts 258
Declared Functions72
Declared Constants465
Declared Sorts 6
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes8

Symbols

true31 false13 Bool3 ite40
not49 or45 and281 =>249
=474 distinct1 forall119 exists4
let125 Int84 div1 +11
-19 *1 <40 <=61
>4 >=39