Benchmark

non-incremental/QF_LIA/20180326-Bromberger/more_slacked/CAV_2009_benchmarks/smt/15-vars/v15_problem__001.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
Size5409
Compressed Size1243
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 5401
Compressed Size1227
Max. Term Depth4
Asserts 45
Declared Functions0
Declared Constants30
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

+15 -88 *99 <=7
>=38

Evaluations

Evaluation Rating Solver Variant Result Wallclock CPU Time
SMT-COMP 2018 Ctrl-Ergo Ctrl-Ergo-SMTComp-2018_default sat ✅ 0.03043 0.02972
CVC4 master-2018-06-10-b19c840-competition-default_default sat ✅ 0.01908 0.01923
MathSAT mathsat-5.5.2-linux-x86_64-Main_default sat ✅ 0.01841 0.01932
SMTInterpol SMTInterpol-2.5-19-g0d39cdee_default sat ✅ 0.31065 0.45376
SMT-RAT SMTRAT-Rat-final_default sat ✅ 0.01947 0.01939
veriT veriT_default sat ✅ 0.00829 0.00840
Yices2 Yices 2.6.0_default sat ✅ 0.00895 0.00543
Z3 z3-4.7.1_default sat ✅ 0.03839 0.03836