Benchmark

incremental/UFDTNIA/20201212-Barrett/Escape.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	58656
Compressed Size	8994
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	3

Query 1

Status	unsat
Inferred Status	None
Size	47184
Compressed Size	7706
Max. Term Depth	81
Asserts	76
Declared Functions	56
Declared Constants	49
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	25	false	11	Bool	3	ite	26
not	26	or	15	and	131	=>	147
=	232	distinct	1	forall	72	let	92
Int	66	div	1	+	9	-	9
*	1	<	21	<=	27	>	5
>=	18

Query 2

Status	unknown
Inferred Status	None
Size	36746
Compressed Size	6556
Max. Term Depth	38
Asserts	76
Declared Functions	56
Declared Constants	59
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	17	false	8	Bool	3	ite	26
not	15	or	16	and	87	=>	69
=	151	distinct	1	forall	73	let	51
Int	67	div	1	+	9	-	8
*	1	<	22	<=	29	>	1
>=	15

Query 3

Status	unsat
Inferred Status	None
Size	33074
Compressed Size	6051
Max. Term Depth	29
Asserts	76
Declared Functions	56
Declared Constants	61
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	10	false	9	Bool	3	ite	26
not	12	or	14	and	66	=>	51
=	128	distinct	1	forall	70	let	38
Int	64	div	1	+	9	-	7
*	1	<	20	<=	25	>	2
>=	14