Benchmark

non-incremental/QF_LIA/20180326-Bromberger/more_slacked/CAV_2009_benchmarks/smt/10-vars/v10_problem_2__012.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
Size3599
Compressed Size980
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 unsat
Inferred Status unsat
Size 3591
Compressed Size983
Max. Term Depth4
Asserts 35
Declared Functions0
Declared Constants20
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

+13 -50 *44 <=9
>=26

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2018 Ctrl-Ergo Ctrl-Ergo-SMTComp-2018_default unsat ✅ 0.03236 0.03281
CVC4 master-2018-06-10-b19c840-competition-default_default unsat ✅ 0.01577 0.01593
MathSAT mathsat-5.5.2-linux-x86_64-Main_default unsat ✅ 0.01695 0.01785
SMTInterpol SMTInterpol-2.5-19-g0d39cdee_default unsat ✅ 0.28541 0.40235
SMT-RAT SMTRAT-Rat-final_default unsat ✅ 0.01375 0.01367
veriT veriT_default unsat ✅ 0.00875 0.00783
Yices2 Yices 2.6.0_default unsat ✅ 0.00826 0.00547
Z3 z3-4.7.1_default unsat ✅ 0.03704 0.03703