(set-info :smt-lib-version 2.6) (set-logic QF_LIA) (set-info :source | Generated by: Martin Bromberger Generated on: 2018-01-06 Application: This is a problem with unbounded directions and, therefore, a good test for the termination/completeness of branch-and-bound solvers. 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 |) (set-info :license "https://creativecommons.org/licenses/by/4.0/") (set-info :category "crafted") (set-info :status unsat) (declare-fun x8_plus () Int) (declare-fun x8_minus () Int) (declare-fun x7_plus () Int) (declare-fun x7_minus () Int) (declare-fun x4_plus () Int) (declare-fun x4_minus () Int) (declare-fun x3_plus () Int) (declare-fun x3_minus () Int) (assert (>= x8_plus 0)) (assert (>= x8_minus 0)) (assert (>= x7_plus 0)) (assert (>= x7_minus 0)) (assert (>= x4_plus 0)) (assert (>= x4_minus 0)) (assert (>= x3_plus 0)) (assert (>= x3_minus 0)) (assert (<= (- x4_plus x4_minus) 0 ) ) (assert (<= (+ x8_plus (* (- 1) x8_minus) x7_plus (* (- 1) x7_minus) (* (- 2) x4_plus) (* 2 x4_minus) (* (- 1) x3_plus) x3_minus ) (- 1) ) ) (assert (>= (+ x8_plus (* (- 1) x8_minus) x7_plus (* (- 1) x7_minus) (* (- 1) x4_plus) x4_minus ) 0 ) ) (assert (<= (+ x8_plus (* (- 1) x8_minus) x7_plus (* (- 1) x7_minus) x3_plus (* (- 1) x3_minus) ) 0 ) ) (check-sat) (exit)