Benchmark

incremental/UFDTNIA/20201212-Barrett/address_quant.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	70926
Compressed Size	10207
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	44575
Compressed Size	7379
Max. Term Depth	62
Asserts	67
Declared Functions	52
Declared Constants	48
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	18	false	8	Bool	1	ite	26
not	20	or	14	and	131	=>	114
=	197	forall	71	exists	2	let	68
Int	60	div	1	+	16	-	11
*	1	<	21	<=	30	>	2
>=	16

Query 2

Status	unsat
Inferred Status	None
Size	42652
Compressed Size	7102
Max. Term Depth	54
Asserts	69
Declared Functions	53
Declared Constants	65
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	19	false	9	Bool	3	ite	26
not	25	or	15	and	113	=>	115
=	175	forall	74	exists	1	let	65
Int	63	div	1	+	9	-	10
*	1	<	21	<=	29	>	2
>=	17

Query 3

Status	unknown
Inferred Status	None
Size	39307
Compressed Size	6755
Max. Term Depth	46
Asserts	69
Declared Functions	53
Declared Constants	74
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	16	false	8	Bool	3	ite	26
not	16	or	15	and	98	=>	78
=	147	forall	73	exists	2	let	52
Int	63	div	1	+	9	-	9
*	1	<	21	<=	29	>	2
>=	17