Benchmark

non-incremental/QF_LIA/20180326-Bromberger/more_slacked/CAV_2009_benchmarks/smt/40-vars/v40_problem_2__002.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
Size14034
Compressed Size2331
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categorycrafted
First Occurrence2018-07-14
Generated ByMartin Bromberger
Generated On2018-01-06 00:00:00
Generator
Dolmen OK1
strict Dolmen OK1
check-sat calls1
Query 1
Status sat
Inferred Status sat
Size 14026
Compressed Size2343
Max. Term Depth4
Asserts 100
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

+20 -282 *314 <=13
>=87

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2018 Ctrl-Ergo Ctrl-Ergo-SMTComp-2018_default sat ✅ 0.04396 0.04595
CVC4 master-2018-06-10-b19c840-competition-default_default sat ✅ 0.04258 0.04273
MathSAT mathsat-5.5.2-linux-x86_64-Main_default sat ✅ 0.02770 0.02867
SMTInterpol SMTInterpol-2.5-19-g0d39cdee_default sat ✅ 0.45254 0.89304
SMT-RAT SMTRAT-Rat-final_default sat ✅ 0.05083 0.05078
veriT veriT_default sat ✅ 0.01026 0.01043
Yices2 Yices 2.6.0_default sat ✅ 0.18459 0.18454
Z3 z3-4.7.1_default sat ✅ 0.04845 0.04846