Benchmark

non-incremental/QF_LIA/20180326-Bromberger/more_slacked/CAV_2009_benchmarks/smt/45-vars/v45_problem__016.smt2.slack.smt2

Publications: M. Bromberger. A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems. (Work in progress.)

The benchmarks in this class are based on the problems from SMT-LIB/QF_LIA/CAV_2009 and SMT-LIB/QF_LIA/cut_lemmas.
I just replaced all variables x with x_+ - x_-, where x_+ and x_- are two new variables such that x_+, x_- >= 0.
This transformation is equisatisfiable.
The new variables and an unsatisfiable status guarantee that there are bounded and unbounded directions.
Target solver: CVC4 Mathsat SPASS-IQ YICES Z3

Benchmark
Size	23002
Compressed Size	3591
License	Creative Commons Attribution 4.0 International (CC-BY-4.0)
Category	crafted
First Occurrence	2018-07-14
Generated By	Martin Bromberger
Generated On	2018-01-06 00:00:00
Generator	—
Dolmen OK	1
strict Dolmen OK	1
check-sat calls	1

Query 1

Status	sat
Inferred Status	sat
Size	22994
Compressed Size	3607
Max. Term Depth	4
Asserts	125
Declared Functions	0
Declared Constants	90
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

+	35	-	563	*	614	<=	19
>=	106

Evaluations

Evaluation	Rating	Solver	Variant	Result	Wallclock	CPU Time
SMT-COMP 2018	0.38 (5/8)	Ctrl-Ergo	Ctrl-Ergo-SMTComp-2018_default	sat ✅	0.08223	0.08285
		CVC4	master-2018-06-10-b19c840-competition-default_default	sat ✅	0.91873	0.91884
		MathSAT	mathsat-5.5.2-linux-x86_64-Main_default	sat ✅	0.10595	0.10702
		SMTInterpol	SMTInterpol-2.5-19-g0d39cdee_default	sat ✅	62.18370	70.26120
		SMT-RAT	SMTRAT-Rat-final_default	sat ✅	0.14036	0.14033
		veriT	veriT_default	unknown ❌	3.20883	3.20827
		Yices2	Yices 2.6.0_default	unknown ❌	1200.02000	1199.97000
		Z3	z3-4.7.1_default	unknown ❌	1200.04000	1200.02000