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 <4x5.lp> ============ original problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 21 constraints SCIP> presolving: (0.0s) running MILP presolver (0.0s) MILP presolver (8 rounds): 0 aggregations, 51 fixings, 0 bound changes (round 1, medium) 51 del vars, 21 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs (round 2, exhaustive) 51 del vars, 28 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 13 clqs (0.0s) running MILP presolver (0.0s) MILP presolver (2 rounds): 0 aggregations, 1 fixings, 0 bound changes (round 3, medium) 52 del vars, 28 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 12 clqs (round 4, exhaustive) 52 del vars, 29 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 12 clqs (round 5, exhaustive) 52 del vars, 29 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 0 impls, 12 clqs (0.0s) sparsify finished: 12/64 (18.8%) nonzeros canceled - in total 12 canceled nonzeros, 12 changed coefficients, 0 added nonzeros (round 6, exhaustive) 52 del vars, 29 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 12 upgd conss, 0 impls, 12 clqs (round 7, exhaustive) 52 del vars, 29 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 13 upgd conss, 0 impls, 13 clqs (0.0s) probing cycle finished: starting next cycle (round 8, exhaustive) 62 del vars, 29 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 13 upgd conss, 0 impls, 11 clqs (round 9, fast) 62 del vars, 40 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 13 upgd conss, 0 impls, 11 clqs (round 10, fast) 64 del vars, 40 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 13 upgd conss, 0 impls, 7 clqs (0.0s) running MILP presolver (0.0s) MILP presolver (2 rounds): 0 aggregations, 1 fixings, 0 bound changes (round 11, medium) 67 del vars, 42 del conss, 21 add conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 13 upgd conss, 0 impls, 0 clqs presolving (12 rounds: 12 fast, 10 medium, 7 exhaustive): 68 deleted vars, 42 deleted constraints, 21 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 12 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.00 Solving Nodes : 0 Primal Bound : +0.00000000000000e+00 (1 solutions) Dual Bound : +0.00000000000000e+00 Gap : 0.00 % SCIP> objective value: 0 x1 1 (obj:0) x7 1 (obj:0) x12 1 (obj:0) x18 1 (obj:0) SCIP> written solution information to file <4x5.sol> SCIP>