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-2705257-1278572929.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.01 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.01/0.02 c (0.0s) probing: 101/232 (43.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.01/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.02 c presolving (5 rounds):
0.01/0.02 c 2 deleted vars, 7 deleted constraints, 63 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.01/0.02 c 83 implications, 23 cliques
0.01/0.02 c presolved problem has 295 variables (232 bin, 0 int, 63 impl, 0 cont) and 159 constraints
0.01/0.02 c 1 constraints of type <knapsack>
0.01/0.02 c 24 constraints of type <setppc>
0.01/0.02 c 63 constraints of type <linear>
0.01/0.02 c 63 constraints of type <indicator>
0.01/0.02 c 8 constraints of type <logicor>
0.01/0.02 c transformed objective value is always integral (scale: 1)
0.01/0.02 c Presolving Time: 0.01
0.01/0.02 c - non default parameters ----------------------------------------------------------------------
0.01/0.02 c # SCIP version 1.2.1.3
0.01/0.02 c
0.01/0.02 c # frequency for displaying node information lines
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.02 c display/freq = 10000
0.01/0.02 c
0.01/0.02 c # maximal time in seconds to run
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.02 c limits/time = 1790
0.01/0.02 c
0.01/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.02 c limits/memory = 3420
0.01/0.02 c
0.01/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.02 c # [type: int, range: [1,2], default: 1]
0.01/0.02 c timing/clocktype = 2
0.01/0.02 c
0.01/0.02 c # should presolving try to simplify inequalities
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/linear/simplifyinequalities = TRUE
0.01/0.02 c
0.01/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/indicator/addCouplingCons = TRUE
0.01/0.02 c
0.01/0.02 c # should presolving try to simplify knapsacks
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.02 c
0.01/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.02 c separating/rapidlearning/freq = 0
0.01/0.02 c
0.01/0.02 c -----------------------------------------------------------------------------------------------
0.01/0.02 c start solving
0.01/0.02 c
0.01/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.01/0.02 c 0.0s| 1 | 0 | 13 | - |1176k| 0 | 3 | 295 | 159 | 295 | 33 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.03 c 0.0s| 1 | 0 | 32 | - |1193k| 0 | 4 | 295 | 159 | 295 | 48 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.04 c 0.0s| 1 | 0 | 47 | - |1205k| 0 | 18 | 295 | 159 | 295 | 57 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.04 c 0.0s| 1 | 0 | 58 | - |1282k| 0 | 27 | 295 | 159 | 295 | 64 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 71 | - |1528k| 0 | 35 | 295 | 159 | 295 | 67 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.05 o 2855
0.01/0.05 c y 0.0s| 1 | 0 | 71 | - |1532k| 0 | 35 | 295 | 159 | 295 | 67 | 34 | 0 | 0 | 0.000000e+00 | 2.855000e+03 | Inf
0.01/0.06 c 0.1s| 1 | 0 | 109 | - |1780k| 0 | 40 | 295 | 159 | 295 | 68 | 35 | 0 | 0 | 0.000000e+00 | 2.855000e+03 | Inf
0.01/0.07 c 0.1s| 1 | 0 | 256 | - |1827k| 0 | 42 | 295 | 159 | 295 | 72 | 39 | 0 | 0 | 0.000000e+00 | 2.855000e+03 | Inf
0.09/0.15 c 0.1s| 1 | 2 | 256 | - |1828k| 0 | 42 | 295 | 159 | 295 | 72 | 39 | 0 | 17 | 0.000000e+00 | 2.855000e+03 | Inf
0.29/0.34 o 324
0.29/0.34 c * 0.3s| 79 | 58 | 970 | 9.2 |1922k| 56 | - | 295 | 169 | 295 | 72 | 44 | 10 | 111 | 0.000000e+00 | 3.240000e+02 | Inf
0.49/0.58 o 52
0.49/0.58 c * 0.6s| 414 | 97 | 2400 | 5.2 |2085k| 56 | - | 295 | 244 | 295 | 69 | 67 | 85 | 304 | 0.000000e+00 | 5.200000e+01 | Inf
0.79/0.83 o 50
0.79/0.83 c * 0.8s| 659 | 124 | 5445 | 7.9 |2281k| 56 | - | 295 | 438 | 295 | 72 | 109 | 311 | 531 | 0.000000e+00 | 5.000000e+01 | Inf
0.89/0.98 o 17
0.89/0.98 c * 1.0s| 820 | 133 | 7480 | 8.8 |2404k| 56 | - | 295 | 580 | 295 | 72 | 155 | 454 | 655 | 0.000000e+00 | 1.700000e+01 | Inf
1.00/1.00 o 5
1.00/1.00 c * 1.0s| 841 | 75 | 7835 | 9.0 |2365k| 56 | - | 295 | 582 | 295 | 75 | 158 | 483 | 667 | 0.000000e+00 | 5.000000e+00 | Inf
1.00/1.06 o 4
1.00/1.06 c * 1.1s| 865 | 60 | 8527 | 9.6 |2357k| 56 | - | 295 | 591 | 295 | 74 | 165 | 510 | 732 | 0.000000e+00 | 4.000000e+00 | Inf
1.00/1.07 o 2
1.00/1.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.07 c * 1.1s| 866 | 59 | 8539 | 9.6 |2359k| 56 | - | 295 | 591 | 295 | 74 | 165 | 510 | 732 | 0.000000e+00 | 2.000000e+00 | Inf
1.29/1.34 c
1.29/1.34 c SCIP Status : problem is solved [optimal solution found]
1.29/1.34 c Solving Time (sec) : 1.34
1.29/1.34 c Solving Nodes : 1002
1.29/1.34 c Primal Bound : +2.00000000000000e+00 (31 solutions)
1.29/1.34 c Dual Bound : +2.00000000000000e+00
1.29/1.34 c Gap : 0.00 %
1.29/1.34 s OPTIMUM FOUND
1.29/1.34 v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
1.29/1.34 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 x129 -x128 -x127
1.29/1.34 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.29/1.34 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
1.29/1.34 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
1.29/1.34 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
1.29/1.34 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
1.29/1.34 v -x4 -x3 -x2 -x1
1.29/1.34 c SCIP Status : problem is solved [optimal solution found]
1.29/1.34 c Solving Time : 1.34
1.29/1.34 c Original Problem :
1.29/1.34 c Problem name : HOME/instance-2705257-1278572929.wbo
1.29/1.34 c Variables : 297 (233 binary, 0 integer, 64 implicit integer, 0 continuous)
1.29/1.34 c Constraints : 166 initial, 166 maximal
1.29/1.34 c Presolved Problem :
1.29/1.34 c Problem name : t_HOME/instance-2705257-1278572929.wbo
1.29/1.34 c Variables : 295 (232 binary, 0 integer, 63 implicit integer, 0 continuous)
1.29/1.34 c Constraints : 159 initial, 762 maximal
1.29/1.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.34 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.29/1.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c probing : 0.01 0 0 0 0 0 0 0 0
1.29/1.34 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c setppc : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c linear : 0.00 0 0 0 63 0 6 1 0
1.29/1.34 c indicator : 0.00 0 0 0 0 0 1 0 0
1.29/1.34 c logicor : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
1.29/1.34 c root node : - 119 - - 119 - - - -
1.29/1.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.34 c integral : 0 0 0 908 0 9 204 0 0 510
1.29/1.34 c knapsack : 1 6 3363 530 0 22 4108 0 0 0
1.29/1.34 c setppc : 24 6 3308 518 0 35 3051 0 0 0
1.29/1.34 c linear : 63 6 3297 526 0 34 5422 198 0 0
1.29/1.34 c indicator : 63 0 3244 530 0 7 2115 0 0 0
1.29/1.34 c logicor : 8+ 6 1383 421 0 28 424 0 0 0
1.29/1.34 c bounddisjunction : 0+ 0 715 0 0 0 14 0 0 0
1.29/1.34 c countsols : 0 0 0 438 0 0 0 0 0 0
1.29/1.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.34 c integral : 0.72 0.00 0.00 0.72 0.00
1.29/1.34 c knapsack : 0.05 0.00 0.05 0.00 0.00
1.29/1.34 c setppc : 0.01 0.00 0.01 0.00 0.00
1.29/1.34 c linear : 0.03 0.00 0.02 0.00 0.00
1.29/1.34 c indicator : 0.01 0.00 0.00 0.00 0.00
1.29/1.34 c logicor : 0.01 0.00 0.01 0.00 0.00
1.29/1.34 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
1.29/1.34 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.34 c Propagators : Time Calls Cutoffs DomReds
1.29/1.34 c vbounds : 0.00 574 0 118
1.29/1.34 c rootredcost : 0.00 8 0 59
1.29/1.34 c pseudoobj : 0.01 3193 29 1723
1.29/1.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.34 c propagation : 0.01 148 144 821 20.1 1 38.0 -
1.29/1.34 c infeasible LP : 0.01 204 200 1010 15.6 0 0.0 0
1.29/1.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.34 c applied globally : - - - 690 13.4 - - -
1.29/1.34 c applied locally : - - - 0 0.0 - - -
1.29/1.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.34 c cut pool : 0.00 5 - - 24 - (maximal pool size: 145)
1.29/1.34 c redcost : 0.01 926 0 48 0 0
1.29/1.34 c impliedbounds : 0.00 6 0 0 0 0
1.29/1.34 c intobj : 0.00 0 0 0 0 0
1.29/1.34 c cgmip : 0.00 0 0 0 0 0
1.29/1.34 c gomory : 0.01 6 0 0 128 0
1.29/1.34 c strongcg : 0.01 6 0 0 148 0
1.29/1.34 c cmir : 0.00 6 0 0 0 0
1.29/1.34 c flowcover : 0.01 6 0 0 0 0
1.29/1.34 c clique : 0.00 6 0 0 0 0
1.29/1.34 c zerohalf : 0.00 0 0 0 0 0
1.29/1.34 c mcf : 0.00 1 0 0 0 0
1.29/1.34 c rapidlearning : 0.01 1 0 0 0 0
1.29/1.34 c Pricers : Time Calls Vars
1.29/1.34 c problem variables: 0.00 0 0
1.29/1.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.34 c relpscost : 0.72 377 9 204 0 0 510
1.29/1.34 c pscost : 0.00 0 0 0 0 0 0
1.29/1.34 c inference : 0.01 431 0 0 0 0 862
1.29/1.34 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.34 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.34 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.34 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.34 c random : 0.00 0 0 0 0 0 0
1.29/1.34 c Primal Heuristics : Time Calls Found
1.29/1.34 c LP solutions : 0.00 - 7
1.29/1.34 c pseudo solutions : 0.00 - 0
1.29/1.34 c oneopt : 0.00 7 0
1.29/1.34 c feaspump : 0.00 1 0
1.29/1.34 c veclendiving : 0.00 9 0
1.29/1.34 c linesearchdiving : 0.00 9 0
1.29/1.34 c coefdiving : 0.00 10 0
1.29/1.34 c pscostdiving : 0.00 10 0
1.29/1.34 c fracdiving : 0.00 10 0
1.29/1.34 c guideddiving : 0.00 10 0
1.29/1.34 c rootsoldiving : 0.00 8 0
1.29/1.34 c objpscostdiving : 0.00 8 0
1.29/1.34 c trivial : 0.00 2 0
1.29/1.34 c simplerounding : 0.00 387 0
1.29/1.34 c zirounding : 0.00 264 0
1.29/1.34 c rounding : 0.00 229 0
1.29/1.34 c shifting : 0.01 46 0
1.29/1.34 c intshifting : 0.00 0 0
1.29/1.34 c twoopt : 0.00 0 0
1.29/1.34 c fixandinfer : 0.00 0 0
1.29/1.34 c intdiving : 0.00 0 0
1.29/1.34 c actconsdiving : 0.00 0 0
1.29/1.34 c octane : 0.00 0 0
1.29/1.34 c rens : 0.01 1 0
1.29/1.34 c rins : 0.00 0 0
1.29/1.34 c localbranching : 0.00 0 0
1.29/1.34 c mutation : 0.00 0 0
1.29/1.34 c crossover : 0.02 2 0
1.29/1.34 c dins : 0.00 0 0
1.29/1.34 c undercover : 0.00 0 0
1.29/1.34 c nlp : 0.00 0 0
1.29/1.34 c trysol : 0.00 40 24
1.29/1.34 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.34 c primal LP : 0.00 0 0 0.00 -
1.29/1.34 c dual LP : 0.30 733 12101 16.51 40674.95
1.29/1.34 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.34 c barrier LP : 0.00 0 0 0.00 -
1.29/1.34 c diving/probing LP: 0.01 26 279 10.73 -
1.29/1.34 c strong branching : 0.72 966 36155 37.43 50374.94
1.29/1.34 c (at root node) : - 17 3028 178.12 -
1.29/1.34 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.34 c B&B Tree :
1.29/1.34 c number of runs : 1
1.29/1.34 c nodes : 1002
1.29/1.34 c nodes (total) : 1002
1.29/1.34 c nodes left : 0
1.29/1.34 c max depth : 56
1.29/1.34 c max depth (total): 56
1.29/1.34 c backtracks : 186 (18.6%)
1.29/1.34 c delayed cutoffs : 96
1.29/1.34 c repropagations : 903 (3695 domain reductions, 35 cutoffs)
1.29/1.34 c avg switch length: 4.11
1.29/1.34 c switching time : 0.03
1.29/1.34 c Solution :
1.29/1.34 c Solutions found : 31 (8 improvements)
1.29/1.34 c First Solution : +2.85500000000000e+03 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <trysol>)
1.29/1.34 c Primal Bound : +2.00000000000000e+00 (in run 1, after 866 nodes, 1.06 seconds, depth 14, found by <relaxation>)
1.29/1.34 c Dual Bound : +2.00000000000000e+00
1.29/1.34 c Gap : 0.00 %
1.29/1.34 c Root Dual Bound : +0.00000000000000e+00
1.29/1.34 c Root Iterations : 256
1.29/1.35 c Time complete: 1.34.