Benchmark

incremental/UFDTNIA/20201212-Barrett/Compare.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	78590
Compressed Size	10316
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	65355
Compressed Size	9061
Max. Term Depth	147
Asserts	63
Declared Functions	50
Declared Constants	73
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	51	false	12	Bool	1	ite	26
not	48	or	18	and	248	=>	277
=	338	forall	65	let	161	Int	59
div	1	+	9	-	14	*	1
<	32	<=	47	>	3	>=	37

Query 2

Status	unsat
Inferred Status	None
Size	34446
Compressed Size	5830
Max. Term Depth	34
Asserts	63
Declared Functions	50
Declared Constants	80
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	12	or	12	and	84	=>	73
=	137	forall	61	let	51	Int	55
div	1	+	9	-	7	*	1
<	21	<=	27	>	1	>=	15

Query 3

Status	unsat
Inferred Status	None
Size	34803
Compressed Size	5859
Max. Term Depth	34
Asserts	63
Declared Functions	50
Declared Constants	87
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	12	or	12	and	84	=>	73
=	137	forall	61	let	51	Int	55
div	1	+	9	-	7	*	1
<	21	<=	27	>	1	>=	15