Benchmark

incremental/UFDTNIA/20201212-Barrett/specs_in_fun_ref.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	108818
Compressed Size	13569
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	7

Query 1

Status	unsat
Inferred Status	None
Size	29424
Compressed Size	5444
Max. Term Depth	28
Asserts	63
Declared Functions	50
Declared Constants	16
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	15	false	8	Bool	1	ite	26
not	8	or	12	and	80	=>	58
=	125	forall	61	let	45	Int	55
div	1	+	12	-	10	*	4
<	20	<=	27	>	2	>=	16

Query 2

Status	unsat
Inferred Status	None
Size	31833
Compressed Size	5784
Max. Term Depth	31
Asserts	63
Declared Functions	50
Declared Constants	27
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	13	false	7	Bool	1	ite	26
not	9	or	12	and	87	=>	60
=	136	forall	61	let	48	Int	55
div	1	+	9	-	7	*	1
<	20	<=	29	>	1	>=	15

Query 3

Status	unsat
Inferred Status	None
Size	39387
Compressed Size	6643
Max. Term Depth	47
Asserts	63
Declared Functions	50
Declared Constants	49
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	17	false	8	Bool	1	ite	26
not	12	or	12	and	113	=>	88
=	173	forall	61	let	64	Int	55
div	1	+	14	-	9	*	1
<	20	<=	31	>	2	>=	16

Query 4

Status	unsat
Inferred Status	None
Size	48390
Compressed Size	7526
Max. Term Depth	71
Asserts	63
Declared Functions	50
Declared Constants	81
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	25	false	8	Bool	1	ite	26
not	19	or	12	and	139	=>	136
=	221	forall	61	let	88	Int	55
div	1	+	21	-	13	*	3
<	20	<=	31	>	3	>=	17

Query 5

Status	unsat
Inferred Status	None
Size	40510
Compressed Size	6594
Max. Term Depth	43
Asserts	63
Declared Functions	50
Declared Constants	103
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	18	false	7	Bool	1	ite	26
not	14	or	12	and	109	=>	85
=	157	forall	61	let	61	Int	55
div	1	+	12	-	13	*	1
<	21	<=	35	>	2	>=	20

Query 6

Status	unsat
Inferred Status	None
Size	41479
Compressed Size	6655
Max. Term Depth	41
Asserts	63
Declared Functions	50
Declared Constants	123
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	17	false	7	Bool	1	ite	26
not	13	or	12	and	106	=>	82
=	153	forall	61	let	59	Int	55
div	1	+	12	-	12	*	1
<	21	<=	35	>	2	>=	20

Query 7

Status	unknown
Inferred Status	None
Size	40952
Compressed Size	6520
Max. Term Depth	38
Asserts	63
Declared Functions	50
Declared Constants	138
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	18	false	7	Bool	1	ite	26
not	11	or	12	and	99	=>	71
=	139	forall	61	let	56	Int	55
div	1	+	12	-	10	*	1
<	21	<=	31	>	2	>=	20