Benchmark

incremental/UFDTNIA/20201212-Barrett/FixedPoint32.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	99681
Compressed Size	12472
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	64958
Compressed Size	8764
Max. Term Depth	117
Asserts	65
Declared Functions	50
Declared Constants	70
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	38	false	14	Bool	1	ite	26
not	47	or	20	and	224	=>	264
=	332	forall	61	let	135	Int	55
div	15	+	10	-	21	*	3
<	20	<=	32	>	11	>=	27

Query 2

Status	unsat
Inferred Status	None
Size	31423
Compressed Size	5686
Max. Term Depth	22
Asserts	65
Declared Functions	50
Declared Constants	72
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	11	false	16	Bool	1	ite	26
not	8	or	12	and	73	=>	55
=	117	forall	61	let	40	Int	55
div	1	+	9	-	9	*	1
<	20	<=	27	>	2	>=	16

Query 3

Status	unsat
Inferred Status	None
Size	58353
Compressed Size	8446
Max. Term Depth	101
Asserts	65
Declared Functions	51
Declared Constants	116
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	33	false	11	Bool	1	ite	26
not	30	or	18	and	193	=>	203
=	281	forall	64	let	113	Int	58
div	9	+	9	-	18	*	2
<	22	<=	35	>	10	>=	25