Benchmark

incremental/UFDTNIA/20201212-Barrett/txn.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	122555
Compressed Size	14037
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	66284
Compressed Size	10169
Max. Term Depth	23
Asserts	254
Declared Functions	69
Declared Constants	248
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	12	false	9	Bool	1	ite	26
not	14	or	14	and	90	=>	64
=	311	distinct	1	forall	84	let	47
Int	62	div	1	+	9	-	8
*	1	<	24	<=	32	>	1
>=	20

Query 2

Status	unsat
Inferred Status	None
Size	69780
Compressed Size	10592
Max. Term Depth	41
Asserts	254
Declared Functions	70
Declared Constants	256
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	15	false	9	Bool	1	ite	26
not	15	or	15	and	103	=>	75
=	322	distinct	1	forall	86	let	55
Int	64	div	1	+	9	-	9
*	1	<	25	<=	35	>	1
>=	22

Query 3

Status	unsat
Inferred Status	None
Size	109839
Compressed Size	12651
Max. Term Depth	70
Asserts	254
Declared Functions	70
Declared Constants	284
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	18	false	9	Bool	1	ite	26
not	34	or	30	and	215	=>	148
=	360	distinct	1	forall	104	let	86
Int	78	div	1	+	9	-	10
*	1	<	38	<=	63	>	1
>=	41