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-2705348-1278572939.wbo>
0.00/0.00 c original problem has 297 variables (233 bin, 0 int, 64 impl, 0 cont) and 166 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, 2 impls, 23 clqs
0.00/0.01 c (round 2) 0 del vars, 6 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 23 clqs
0.00/0.01 c (round 3) 1 del vars, 7 del conss, 63 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 23 clqs
0.00/0.01 c (round 4) 2 del vars, 7 del conss, 63 chg bounds, 1 chg sides, 0 chg coeffs, 33 upgd conss, 2 impls, 23 clqs
0.00/0.02 c (0.0s) probing: 101/232 (43.5%) - 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, 7 deleted constraints, 63 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.02 c 83 implications, 23 cliques
0.00/0.02 c presolved problem has 295 variables (232 bin, 0 int, 63 impl, 0 cont) and 159 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 24 constraints of type <setppc>
0.00/0.02 c 63 constraints of type <linear>
0.00/0.02 c 63 constraints of type <indicator>
0.00/0.02 c 8 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 | 10 | - |1176k| 0 | 0 | 295 | 159 | 295 | 33 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 27 | - |1335k| 0 | 13 | 295 | 258 | 295 | 42 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 38 | - |1372k| 0 | 16 | 295 | 258 | 295 | 50 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 45 | - |1400k| 0 | 14 | 295 | 258 | 295 | 57 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.09 c 0.1s| 1 | 0 | 56 | - |1434k| 0 | 17 | 295 | 258 | 295 | 61 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.10 c 0.1s| 1 | 0 | 68 | - |1606k| 0 | 30 | 295 | 258 | 295 | 64 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.10 c 0.1s| 1 | 0 | 82 | - |1795k| 0 | 37 | 295 | 258 | 295 | 68 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.13 c 0.1s| 1 | 2 | 82 | - |1798k| 0 | 37 | 295 | 258 | 295 | 68 | 35 | 0 | 10 | 0.000000e+00 | -- | Inf
0.19/0.26 o 2855
0.19/0.26 c y 0.3s| 11 | 10 | 406 | 32.4 |1822k| 10 | 1 | 295 | 258 | 295 | 69 | 37 | 0 | 92 | 0.000000e+00 | 2.855000e+03 | Inf
0.49/0.51 o 310
0.49/0.51 c * 0.5s| 296 | 246 | 1233 | 3.9 |2066k| 81 | - | 295 | 270 | 295 | 68 | 49 | 12 | 341 | 0.000000e+00 | 3.100000e+02 | Inf
0.49/0.59 o 283
0.49/0.59 c * 0.6s| 452 | 290 | 1647 | 3.5 |2174k| 81 | - | 295 | 344 | 295 | 69 | 57 | 86 | 394 | 0.000000e+00 | 2.830000e+02 | Inf
0.59/0.63 o 279
0.59/0.63 c * 0.6s| 579 | 354 | 1819 | 3.0 |2276k| 81 | - | 295 | 391 | 295 | 67 | 58 | 133 | 409 | 0.000000e+00 | 2.790000e+02 | Inf
0.59/0.65 o 215
0.59/0.65 c * 0.6s| 614 | 345 | 1903 | 3.0 |2286k| 81 | - | 295 | 402 | 295 | 68 | 63 | 144 | 411 | 0.000000e+00 | 2.150000e+02 | Inf
0.59/0.66 o 210
0.59/0.66 c * 0.7s| 642 | 340 | 1980 | 3.0 |2308k| 81 | - | 295 | 419 | 295 | 67 | 63 | 161 | 413 | 0.000000e+00 | 2.100000e+02 | Inf
0.59/0.66 o 209
0.59/0.66 c * 0.7s| 643 | 337 | 1980 | 3.0 |2312k| 81 | - | 295 | 419 | 295 | 67 | 63 | 161 | 413 | 0.000000e+00 | 2.090000e+02 | Inf
0.59/0.69 o 200
0.59/0.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.69 c * 0.7s| 758 | 383 | 2111 | 2.7 |2409k| 81 | - | 295 | 465 | 295 | 70 | 73 | 207 | 417 | 0.000000e+00 | 2.000000e+02 | Inf
0.79/0.88 o 199
0.79/0.88 c * 0.9s| 1217 | 653 | 3309 | 2.7 |2760k| 81 | - | 295 | 587 | 295 | 72 | 106 | 329 | 535 | 0.000000e+00 | 1.990000e+02 | Inf
0.99/1.01 o 190
0.99/1.01 c * 1.0s| 1624 | 862 | 3924 | 2.4 |3020k| 81 | - | 295 | 714 | 295 | 72 | 123 | 457 | 580 | 0.000000e+00 | 1.900000e+02 | Inf
0.99/1.01 o 189
0.99/1.01 c * 1.0s| 1632 | 868 | 3926 | 2.4 |3030k| 81 | - | 295 | 714 | 295 | 72 | 123 | 457 | 580 | 0.000000e+00 | 1.890000e+02 | Inf
0.99/1.02 o 182
0.99/1.02 c * 1.0s| 1669 | 870 | 3995 | 2.3 |3044k| 81 | - | 295 | 725 | 295 | 70 | 124 | 468 | 586 | 0.000000e+00 | 1.820000e+02 | Inf
1.20/1.25 o 157
1.20/1.25 c * 1.2s| 2293 | 1048 | 4978 | 2.1 |3407k| 81 | - | 295 |1038 | 295 | 68 | 149 | 783 | 673 | 0.000000e+00 | 1.570000e+02 | Inf
1.29/1.33 o 95
1.29/1.33 c * 1.3s| 2546 | 924 | 5427 | 2.1 |3366k| 81 | - | 295 |1148 | 295 | 68 | 161 | 893 | 695 | 0.000000e+00 | 9.500000e+01 | Inf
2.39/2.47 o 49
2.39/2.47 c * 2.5s| 5313 | 1172 | 11645 | 2.2 |4793k| 81 | - | 295 |2551 | 295 | 72 | 298 |2659 | 986 | 0.000000e+00 | 4.900000e+01 | Inf
2.59/2.66 o 22
2.59/2.66 c * 2.7s| 5573 | 1091 | 14320 | 2.6 |4791k| 81 | - | 295 |2447 | 295 | 69 | 326 |2876 |1088 | 0.000000e+00 | 2.200000e+01 | Inf
2.69/2.70 o 17
2.69/2.70 c * 2.7s| 5603 | 1027 | 14951 | 2.7 |4756k| 81 | - | 295 |2383 | 295 | 70 | 336 |2916 |1096 | 0.000000e+00 | 1.700000e+01 | Inf
2.69/2.76 o 4
2.69/2.76 c * 2.8s| 5688 | 780 | 15691 | 2.7 |4442k| 81 | - | 295 |2295 | 295 | 67 | 341 |3003 |1108 | 0.000000e+00 | 4.000000e+00 | Inf
2.79/2.82 o 2
2.79/2.82 c * 2.8s| 5728 | 706 | 16541 | 2.9 |4390k| 81 | - | 295 |2226 | 295 | 70 | 349 |3064 |1141 | 0.000000e+00 | 2.000000e+00 | Inf
2.89/2.98 c
2.89/2.98 c SCIP Status : problem is solved [optimal solution found]
2.89/2.98 c Solving Time (sec) : 2.97
2.89/2.98 c Solving Nodes : 5879
2.89/2.98 c Primal Bound : +2.00000000000000e+00 (113 solutions)
2.89/2.98 c Dual Bound : +2.00000000000000e+00
2.89/2.98 c Gap : 0.00 %
2.89/2.98 s OPTIMUM FOUND
2.89/2.98 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148
2.89/2.98 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127
2.89/2.98 v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 x108 -x107 -x106
2.89/2.98 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
2.89/2.98 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
2.89/2.98 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
2.89/2.98 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
2.89/2.98 v -x4 -x3 -x2 -x1
2.89/2.98 c SCIP Status : problem is solved [optimal solution found]
2.89/2.98 c Solving Time : 2.97
2.89/2.98 c Original Problem :
2.89/2.98 c Problem name : HOME/instance-2705348-1278572939.wbo
2.89/2.98 c Variables : 297 (233 binary, 0 integer, 64 implicit integer, 0 continuous)
2.89/2.98 c Constraints : 166 initial, 166 maximal
2.89/2.98 c Presolved Problem :
2.89/2.98 c Problem name : t_HOME/instance-2705348-1278572939.wbo
2.89/2.98 c Variables : 295 (232 binary, 0 integer, 63 implicit integer, 0 continuous)
2.89/2.98 c Constraints : 159 initial, 2553 maximal
2.89/2.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.89/2.98 c trivial : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c dualfix : 0.00 2 0 0 0 0 0 0 0
2.89/2.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c implics : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c probing : 0.01 0 0 0 0 0 0 0 0
2.89/2.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c setppc : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c linear : 0.00 0 0 0 63 0 6 1 0
2.89/2.98 c indicator : 0.00 0 0 0 0 0 1 0 0
2.89/2.98 c logicor : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
2.89/2.98 c root node : - 118 - - 118 - - - -
2.89/2.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.89/2.98 c integral : 0 0 0 4557 0 4 286 0 0 2462
2.89/2.98 c knapsack : 1 6 19292 3123 0 93 52308 0 0 0
2.89/2.98 c setppc : 24 6 19119 3101 0 179 9373 0 0 0
2.89/2.98 c linear : 63+ 7 19001 3110 0 411 19289 361 0 0
2.89/2.98 c indicator : 63 0 18624 3131 0 121 22359 0 0 0
2.89/2.98 c logicor : 8+ 6 7404 2750 0 401 2991 0 0 0
2.89/2.98 c bounddisjunction : 0+ 0 3305 0 0 14 44 0 0 0
2.89/2.98 c countsols : 0 0 0 2893 0 0 0 0 0 0
2.89/2.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.89/2.98 c integral : 0.60 0.00 0.00 0.60 0.00
2.89/2.98 c knapsack : 0.32 0.00 0.32 0.00 0.00
2.89/2.98 c setppc : 0.03 0.00 0.03 0.00 0.00
2.89/2.98 c linear : 0.15 0.00 0.14 0.01 0.00
2.89/2.98 c indicator : 0.05 0.00 0.04 0.01 0.00
2.89/2.98 c logicor : 0.12 0.00 0.12 0.00 0.00
2.89/2.98 c bounddisjunction : 0.01 0.00 0.01 0.00 0.00
2.89/2.98 c countsols : 0.00 0.00 0.00 0.00 0.00
2.89/2.98 c Propagators : Time Calls Cutoffs DomReds
2.89/2.98 c vbounds : 0.02 3304 0 887
2.89/2.98 c rootredcost : 0.00 19 0 59
2.89/2.98 c pseudoobj : 0.06 19410 294 20457
2.89/2.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.98 c propagation : 0.05 1392 1387 8329 22.2 13 25.5 -
2.89/2.98 c infeasible LP : 0.02 490 487 2220 17.0 4 28.2 0
2.89/2.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.98 c pseudo solution : 0.00 1 1 4 10.5 0 0.0 -
2.89/2.98 c applied globally : - - - 3279 15.9 - - -
2.89/2.98 c applied locally : - - - 3 32.3 - - -
2.89/2.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.89/2.98 c cut pool : 0.00 4 - - 12 - (maximal pool size: 124)
2.89/2.98 c redcost : 0.03 4672 0 742 0 0
2.89/2.98 c impliedbounds : 0.00 5 0 0 0 0
2.89/2.98 c intobj : 0.00 0 0 0 0 0
2.89/2.98 c cgmip : 0.00 0 0 0 0 0
2.89/2.98 c gomory : 0.01 5 0 0 150 0
2.89/2.98 c strongcg : 0.01 5 0 0 139 0
2.89/2.98 c cmir : 0.00 5 0 0 0 0
2.89/2.98 c flowcover : 0.01 5 0 0 0 0
2.89/2.98 c clique : 0.00 5 0 0 1 0
2.89/2.98 c zerohalf : 0.00 0 0 0 0 0
2.89/2.98 c mcf : 0.00 1 0 0 0 0
2.89/2.98 c rapidlearning : 0.06 1 0 0 0 99
2.89/2.98 c Pricers : Time Calls Vars
2.89/2.98 c problem variables: 0.00 0 0
2.89/2.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.89/2.98 c relpscost : 0.60 1423 4 286 0 0 2462
2.89/2.98 c pscost : 0.00 0 0 0 0 0 0
2.89/2.98 c inference : 0.04 2875 0 0 0 0 5752
2.89/2.98 c mostinf : 0.00 0 0 0 0 0 0
2.89/2.98 c leastinf : 0.00 0 0 0 0 0 0
2.89/2.98 c fullstrong : 0.00 0 0 0 0 0 0
2.89/2.98 c allfullstrong : 0.00 0 0 0 0 0 0
2.89/2.98 c random : 0.00 0 0 0 0 0 0
2.89/2.98 c Primal Heuristics : Time Calls Found
2.89/2.98 c LP solutions : 0.00 - 18
2.89/2.98 c pseudo solutions : 0.00 - 0
2.89/2.98 c oneopt : 0.01 18 0
2.89/2.98 c coefdiving : 0.00 16 0
2.89/2.98 c pscostdiving : 0.00 16 0
2.89/2.98 c fracdiving : 0.00 16 0
2.89/2.98 c veclendiving : 0.00 17 0
2.89/2.98 c linesearchdiving : 0.00 17 0
2.89/2.98 c guideddiving : 0.01 17 0
2.89/2.98 c rootsoldiving : 0.00 13 0
2.89/2.98 c objpscostdiving : 0.00 13 0
2.89/2.98 c trivial : 0.00 2 0
2.89/2.98 c simplerounding : 0.00 1434 0
2.89/2.98 c zirounding : 0.01 1000 0
2.89/2.98 c rounding : 0.01 487 0
2.89/2.98 c shifting : 0.01 118 0
2.89/2.98 c intshifting : 0.00 0 0
2.89/2.98 c twoopt : 0.00 0 0
2.89/2.98 c fixandinfer : 0.00 0 0
2.89/2.98 c feaspump : 0.00 1 0
2.89/2.98 c intdiving : 0.00 0 0
2.89/2.98 c actconsdiving : 0.00 0 0
2.89/2.98 c octane : 0.00 0 0
2.89/2.98 c rens : 0.01 1 0
2.89/2.98 c rins : 0.00 0 0
2.89/2.98 c localbranching : 0.00 0 0
2.89/2.98 c mutation : 0.00 0 0
2.89/2.98 c crossover : 0.03 5 0
2.89/2.98 c dins : 0.00 0 0
2.89/2.98 c undercover : 0.00 0 0
2.89/2.98 c nlp : 0.00 0 0
2.89/2.98 c trysol : 0.01 233 95
2.89/2.98 c LP : Time Calls Iterations Iter/call Iter/sec
2.89/2.98 c primal LP : 0.00 0 0 0.00 -
2.89/2.98 c dual LP : 0.75 2586 19708 7.62 26191.15
2.89/2.98 c lex dual LP : 0.00 0 0 0.00 -
2.89/2.98 c barrier LP : 0.00 0 0 0.00 -
2.89/2.98 c diving/probing LP: 0.01 40 239 5.97 23007.32
2.89/2.98 c strong branching : 0.59 1195 26307 22.01 44797.47
2.89/2.98 c (at root node) : - 10 545 54.50 -
2.89/2.98 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.98 c B&B Tree :
2.89/2.98 c number of runs : 1
2.89/2.98 c nodes : 5879
2.89/2.98 c nodes (total) : 5879
2.89/2.98 c nodes left : 0
2.89/2.98 c max depth : 81
2.89/2.98 c max depth (total): 81
2.89/2.98 c backtracks : 827 (14.1%)
2.89/2.98 c delayed cutoffs : 1113
2.89/2.98 c repropagations : 8027 (23220 domain reductions, 243 cutoffs)
2.89/2.98 c avg switch length: 5.37
2.89/2.98 c switching time : 0.27
2.89/2.98 c Solution :
2.89/2.98 c Solutions found : 113 (19 improvements)
2.89/2.98 c First Solution : +2.85500000000000e+03 (in run 1, after 11 nodes, 0.25 seconds, depth 10, found by <trysol>)
2.89/2.98 c Primal Bound : +2.00000000000000e+00 (in run 1, after 5728 nodes, 2.82 seconds, depth 14, found by <relaxation>)
2.89/2.98 c Dual Bound : +2.00000000000000e+00
2.89/2.98 c Gap : 0.00 %
2.89/2.98 c Root Dual Bound : +0.00000000000000e+00
2.89/2.98 c Root Iterations : 82
2.89/2.98 c Time complete: 2.98.