0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2705459-1278572943.wbo>
0.00/0.00 c original problem has 227 variables (198 bin, 0 int, 29 impl, 0 cont) and 131 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 48 clqs
0.00/0.01 c (round 2) 0 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 48 clqs
0.00/0.01 c (round 3) 1 del vars, 19 del conss, 28 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 48 clqs
0.00/0.01 c (round 4) 2 del vars, 19 del conss, 28 chg bounds, 1 chg sides, 0 chg coeffs, 56 upgd conss, 8 impls, 48 clqs
0.00/0.02 c (0.0s) probing: 101/197 (51.3%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 2 deleted vars, 19 deleted constraints, 28 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.02 c 44 implications, 48 cliques
0.00/0.02 c presolved problem has 225 variables (197 bin, 0 int, 28 impl, 0 cont) and 112 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 52 constraints of type <setppc>
0.00/0.02 c 28 constraints of type <linear>
0.00/0.02 c 28 constraints of type <indicator>
0.00/0.02 c 3 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1790
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 3420
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 30 | - | 978k| 0 | 26 | 225 | 112 | 225 | 56 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 73 | - |1236k| 0 | 41 | 225 | 112 | 225 | 77 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 111 | - |1287k| 0 | 40 | 225 | 112 | 225 | 80 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 127 | - |1590k| 0 | 40 | 225 | 112 | 225 | 83 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 143 | - |1607k| 0 | 40 | 225 | 112 | 225 | 85 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.08 c 0.1s| 1 | 0 | 163 | - |1611k| 0 | 42 | 225 | 112 | 225 | 87 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 199 | - |1619k| 0 | 42 | 225 | 112 | 225 | 88 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 201 | - |1619k| 0 | 41 | 225 | 112 | 225 | 88 | 32 | 0 | 15 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 264 | - |1633k| 0 | 42 | 225 | 112 | 225 | 92 | 36 | 0 | 15 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 2 | 264 | - |1634k| 0 | 42 | 225 | 112 | 225 | 92 | 36 | 0 | 29 | 0.000000e+00 | -- | Inf
0.29/0.35 o 1473
0.29/0.35 c y 0.3s| 40 | 17 | 581 | 8.1 |1673k| 14 | - | 225 | 129 | 0 | 0 | 39 | 17 | 86 | 0.000000e+00 | 1.473000e+03 | Inf
0.59/0.62 o 256
0.59/0.62 c * 0.6s| 294 | 97 | 1899 | 5.6 |1878k| 25 | - | 225 | 287 | 225 | 83 | 58 | 175 | 360 | 0.000000e+00 | 2.560000e+02 | Inf
0.59/0.69 o 239
0.59/0.69 c * 0.7s| 493 | 155 | 2558 | 4.7 |2073k| 28 | - | 225 | 475 | 225 | 80 | 64 | 363 | 387 | 7.000000e+00 | 2.390000e+02 |3314.29%
0.69/0.70 o 210
0.69/0.70 c * 0.7s| 514 | 121 | 2652 | 4.7 |2101k| 28 | - | 225 | 512 | 225 | 79 | 67 | 400 | 392 | 6.600000e+01 | 2.100000e+02 | 218.18%
0.69/0.75 o 207
0.69/0.75 c * 0.7s| 579 | 89 | 3003 | 4.7 |2165k| 28 | - | 225 | 607 | 225 | 79 | 70 | 495 | 425 | 1.310000e+02 | 2.070000e+02 | 58.02%
0.69/0.76 c
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time (sec) : 0.76
0.69/0.76 c Solving Nodes : 588
0.69/0.76 c Primal Bound : +2.07000000000000e+02 (24 solutions)
0.69/0.76 c Dual Bound : +2.07000000000000e+02
0.69/0.76 c Gap : 0.00 %
0.69/0.76 s OPTIMUM FOUND
0.69/0.76 v -x169 -x168 -x167 x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x150 -x149 -x148
0.69/0.76 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128 -x127
0.69/0.76 v -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
0.69/0.76 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 -x83 -x82
0.69/0.76 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
0.69/0.76 v -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
0.69/0.76 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 -x5
0.69/0.76 v -x4 -x3 -x2 -x1
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time : 0.76
0.69/0.76 c Original Problem :
0.69/0.76 c Problem name : HOME/instance-2705459-1278572943.wbo
0.69/0.76 c Variables : 227 (198 binary, 0 integer, 29 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 131 initial, 131 maximal
0.69/0.76 c Presolved Problem :
0.69/0.76 c Problem name : t_HOME/instance-2705459-1278572943.wbo
0.69/0.76 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 112 initial, 643 maximal
0.69/0.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.76 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.69/0.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c probing : 0.01 0 0 0 0 0 0 0 0
0.69/0.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c setppc : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c linear : 0.00 0 0 0 28 0 18 1 0
0.69/0.76 c indicator : 0.00 0 0 0 0 0 1 0 0
0.69/0.76 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c root node : - 1 - - 1 - - - -
0.69/0.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.76 c integral : 0 0 0 472 0 4 108 0 0 60
0.69/0.76 c knapsack : 1 7 2296 394 0 2 520 0 0 0
0.69/0.76 c setppc : 52 7 2290 393 0 13 4165 0 0 0
0.69/0.76 c linear : 28 7 2279 393 0 11 565 44 0 0
0.69/0.76 c indicator : 28 0 2271 395 0 3 979 0 0 0
0.69/0.76 c logicor : 3+ 7 823 347 0 12 399 0 0 0
0.69/0.76 c bounddisjunction : 0+ 0 437 0 0 3 74 0 0 0
0.69/0.76 c countsols : 0 0 0 374 0 0 0 0 0 0
0.69/0.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.76 c integral : 0.41 0.00 0.00 0.41 0.00
0.69/0.76 c knapsack : 0.03 0.00 0.02 0.00 0.00
0.69/0.76 c setppc : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c linear : 0.01 0.00 0.01 0.00 0.00
0.69/0.76 c indicator : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c Propagators : Time Calls Cutoffs DomReds
0.69/0.76 c vbounds : 0.00 391 0 152
0.69/0.76 c rootredcost : 0.00 5 0 0
0.69/0.76 c pseudoobj : 0.00 2107 9 728
0.69/0.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.76 c propagation : 0.00 50 46 233 24.4 0 0.0 -
0.69/0.76 c infeasible LP : 0.01 152 150 569 14.2 3 19.0 0
0.69/0.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c pseudo solution : 0.00 2 2 9 16.7 0 0.0 -
0.69/0.76 c applied globally : - - - 531 13.2 - - -
0.69/0.76 c applied locally : - - - 0 0.0 - - -
0.69/0.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.76 c cut pool : 0.00 6 - - 21 - (maximal pool size: 159)
0.69/0.76 c redcost : 0.00 485 0 44 0 0
0.69/0.76 c impliedbounds : 0.00 7 0 0 0 0
0.69/0.76 c intobj : 0.00 0 0 0 0 0
0.69/0.76 c cgmip : 0.00 0 0 0 0 0
0.69/0.76 c gomory : 0.02 7 0 0 77 0
0.69/0.76 c strongcg : 0.02 7 0 0 96 0
0.69/0.76 c cmir : 0.00 7 0 0 0 0
0.69/0.76 c flowcover : 0.02 7 0 0 0 0
0.69/0.76 c clique : 0.00 7 0 0 11 0
0.69/0.76 c zerohalf : 0.00 0 0 0 0 0
0.69/0.76 c mcf : 0.00 1 0 0 0 0
0.69/0.76 c rapidlearning : 0.01 1 0 0 0 0
0.69/0.76 c Pricers : Time Calls Vars
0.69/0.76 c problem variables: 0.00 0 0
0.69/0.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.76 c relpscost : 0.41 77 4 108 0 0 60
0.69/0.76 c pscost : 0.00 0 0 0 0 0 0
0.69/0.76 c inference : 0.00 370 0 0 0 0 741
0.69/0.76 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.76 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.76 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c random : 0.00 0 0 0 0 0 0
0.69/0.76 c Primal Heuristics : Time Calls Found
0.69/0.76 c LP solutions : 0.00 - 4
0.69/0.76 c pseudo solutions : 0.00 - 0
0.69/0.76 c oneopt : 0.00 4 0
0.69/0.76 c feaspump : 0.00 1 0
0.69/0.76 c guideddiving : 0.00 14 0
0.69/0.76 c pscostdiving : 0.00 15 0
0.69/0.76 c fracdiving : 0.00 15 0
0.69/0.76 c veclendiving : 0.00 15 0
0.69/0.76 c linesearchdiving : 0.00 15 0
0.69/0.76 c coefdiving : 0.00 15 0
0.69/0.76 c rootsoldiving : 0.00 10 0
0.69/0.76 c objpscostdiving : 0.00 13 0
0.69/0.76 c trivial : 0.00 2 0
0.69/0.76 c simplerounding : 0.00 73 0
0.69/0.76 c zirounding : 0.00 34 0
0.69/0.76 c rounding : 0.00 84 0
0.69/0.76 c shifting : 0.00 14 0
0.69/0.76 c intshifting : 0.00 0 0
0.69/0.76 c twoopt : 0.00 0 0
0.69/0.76 c fixandinfer : 0.00 0 0
0.69/0.76 c intdiving : 0.00 0 0
0.69/0.76 c actconsdiving : 0.00 0 0
0.69/0.76 c octane : 0.00 0 0
0.69/0.76 c rens : 0.02 1 0
0.69/0.76 c rins : 0.00 0 0
0.69/0.76 c localbranching : 0.00 0 0
0.69/0.76 c mutation : 0.00 0 0
0.69/0.76 c crossover : 0.01 1 0
0.69/0.76 c dins : 0.00 0 0
0.69/0.76 c undercover : 0.00 0 0
0.69/0.76 c nlp : 0.00 0 0
0.69/0.76 c trysol : 0.00 23 20
0.69/0.76 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.76 c primal LP : 0.00 0 0 0.00 -
0.69/0.76 c dual LP : 0.11 289 3096 10.71 27825.71
0.69/0.76 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.76 c barrier LP : 0.00 0 0 0.00 -
0.69/0.76 c diving/probing LP: 0.00 4 27 6.75 -
0.69/0.76 c strong branching : 0.41 425 18528 43.60 45447.19
0.69/0.76 c (at root node) : - 29 6003 207.00 -
0.69/0.76 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.76 c B&B Tree :
0.69/0.76 c number of runs : 1
0.69/0.76 c nodes : 588
0.69/0.76 c nodes (total) : 588
0.69/0.76 c nodes left : 0
0.69/0.76 c max depth : 28
0.69/0.76 c max depth (total): 28
0.69/0.76 c backtracks : 143 (24.3%)
0.69/0.76 c delayed cutoffs : 118
0.69/0.76 c repropagations : 650 (2786 domain reductions, 27 cutoffs)
0.69/0.76 c avg switch length: 4.86
0.69/0.76 c switching time : 0.01
0.69/0.76 c Solution :
0.69/0.76 c Solutions found : 24 (5 improvements)
0.69/0.76 c First Solution : +1.47300000000000e+03 (in run 1, after 39 nodes, 0.35 seconds, depth 15, found by <trysol>)
0.69/0.76 c Primal Bound : +2.07000000000000e+02 (in run 1, after 579 nodes, 0.74 seconds, depth 27, found by <relaxation>)
0.69/0.76 c Dual Bound : +2.07000000000000e+02
0.69/0.76 c Gap : 0.00 %
0.69/0.76 c Root Dual Bound : +0.00000000000000e+00
0.69/0.76 c Root Iterations : 264
0.69/0.76 c Time complete: 0.76.