SCIP version 7.0.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 5.0.2] [GitHash: 74c11e60cd] Copyright (C) 2002-2021 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) External libraries: SoPlex 5.0.2 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: e24c304e] CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (www.coin-or.org/CppAD) ZLIB 1.2.11 General purpose compression library by J. Gailly and M. Adler (zlib.net) GMP 6.2.1 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) ZIMPL 3.4.0 Zuse Institute Mathematical Programming Language developed by T. Koch (zimpl.zib.de) PaPILO 1.0.2 parallel presolve for integer and linear optimization [GitHash: e567fef] bliss 0.73p Computing Graph Automorphism Groups by T. Junttila and P. Kaski (http://www.tcs.hut.fi/Software/bliss/) Ipopt 3.13.2 Interior Point Optimizer developed by A. Waechter et.al. (www.coin-or.org/Ipopt) user parameter file not found - using default parameters SCIP> read problem ============ original problem has 142 variables (142 bin, 0 int, 0 impl, 0 cont) and 148 constraints SCIP> presolving: (round 1, fast) 142 del vars, 111 del conss, 0 add conss, 139 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs presolving (2 rounds: 2 fast, 1 medium, 1 exhaustive): 143 deleted vars, 148 deleted constraints, 0 added constraints, 139 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients 0 implications, 0 cliques transformed 1/1 original solutions to the transformed problem space Presolving Time: 0.00 SCIP Status : problem is solved [optimal solution found] Solving Time (sec) : 0.01 Solving Nodes : 0 Primal Bound : +0.00000000000000e+00 (1 solutions) Dual Bound : +0.00000000000000e+00 Gap : 0.00 % SCIP> objective value: 0 x26 1 (obj:0) x47 1 (obj:0) x76 1 (obj:0) x142 1 (obj:0) SCIP> written solution information to file SCIP>