Benchmark

incremental/UFDTNIA/20201212-Barrett/aborts_if_true.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	32108
Compressed Size	5622
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	25635
Compressed Size	5007
Max. Term Depth	14
Asserts	63
Declared Functions	50
Declared Constants	12
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	15	false	7	Bool	1	ite	26
not	5	or	12	and	61	=>	35
=	102	forall	61	let	32	Int	55
div	1	+	9	-	8	*	1
<	20	<=	25	>	1	>=	13

Query 2

Status	unsat
Inferred Status	None
Size	29906
Compressed Size	5358
Max. Term Depth	24
Asserts	63
Declared Functions	50
Declared Constants	19
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	16	false	8	Bool	1	ite	26
not	8	or	12	and	71	=>	54
=	123	forall	61	let	43	Int	55
div	1	+	9	-	9	*	1
<	20	<=	25	>	2	>=	13

Query 3

Status	unknown
Inferred Status	None
Size	25421
Compressed Size	4998
Max. Term Depth	14
Asserts	63
Declared Functions	50
Declared Constants	19
Declared Sorts	6
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	8

Symbols

true	11	false	10	Bool	1	ite	26
not	4	or	12	and	59	=>	30
=	97	forall	61	let	30	Int	55
div	1	+	9	-	8	*	1
<	20	<=	25	>	1	>=	13