Benchmark

non-incremental/QF_LIA/20180326-Bromberger/more_slacked/cut_lemmas/20-vars/cut_lemma_03_009.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
Size8557
Compressed Size1714
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 8549
Compressed Size1711
Max. Term Depth4
Asserts 61
Declared Functions0
Declared Constants40
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

+21 -173 *195 <=10
>=51

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2018 0.75 (2/8) Ctrl-Ergo Ctrl-Ergo-SMTComp-2018_default unsat ✅ 0.43410 0.43447
CVC4 master-2018-06-10-b19c840-competition-default_default unknown ❌ 1200.09000 1200.00000
MathSAT mathsat-5.5.2-linux-x86_64-Main_default unknown ❌ 1200.01000 1199.81000
SMTInterpol SMTInterpol-2.5-19-g0d39cdee_default unsat ✅ 0.54269 1.24200
SMT-RAT SMTRAT-Rat-final_default unknown ❌ 1200.03000 1199.79000
veriT veriT_default unknown ❌ 0.29913 0.29923
Yices2 Yices 2.6.0_default unknown ❌ 1200.03000 1199.95000
Z3 z3-4.7.1_default unknown ❌ 1200.07000 1199.87000