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-2705263-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.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 | 13 | - |1176k| 0 | 0 | 295 | 159 | 295 | 33 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.03 c 0.0s| 1 | 0 | 37 | - |1188k| 0 | 15 | 295 | 159 | 295 | 45 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.04 c 0.0s| 1 | 0 | 53 | - |1227k| 0 | 19 | 295 | 159 | 295 | 52 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.04 c 0.0s| 1 | 0 | 65 | - |1327k| 0 | 33 | 295 | 159 | 295 | 58 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 83 | - |1537k| 0 | 38 | 295 | 159 | 295 | 63 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.06 c 0.1s| 1 | 0 | 97 | - |1746k| 0 | 38 | 295 | 159 | 295 | 66 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.07 c 0.1s| 1 | 0 | 120 | - |1961k| 0 | 41 | 295 | 159 | 295 | 68 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 2 | 120 | - |1963k| 0 | 41 | 295 | 159 | 295 | 68 | 35 | 0 | 16 | 0.000000e+00 | -- | Inf
0.29/0.38 o 2855
0.29/0.38 c y 0.4s| 30 | 23 | 682 | 19.4 |2008k| 13 | - | 295 | 161 | 0 | 0 | 38 | 2 | 219 | 0.000000e+00 | 2.855000e+03 | Inf
0.49/0.56 o 394
0.49/0.56 c * 0.6s| 146 | 123 | 1380 | 8.7 |2155k| 35 | - | 295 | 169 | 295 | 68 | 55 | 10 | 403 | 0.000000e+00 | 3.940000e+02 | Inf
0.69/0.71 o 377
0.69/0.71 c * 0.7s| 437 | 370 | 2213 | 4.8 |2436k| 48 | - | 295 | 211 | 295 | 70 | 71 | 52 | 525 | 0.000000e+00 | 3.770000e+02 | Inf
0.79/0.84 o 361
0.79/0.84 c * 0.8s| 721 | 614 | 2938 | 3.9 |2674k| 48 | - | 295 | 242 | 295 | 72 | 94 | 83 | 619 | 0.000000e+00 | 3.610000e+02 | Inf
0.79/0.87 o 247
0.79/0.87 c * 0.9s| 792 | 620 | 3090 | 3.8 |2698k| 48 | - | 295 | 258 | 295 | 71 | 99 | 99 | 636 | 0.000000e+00 | 2.470000e+02 | Inf
0.79/0.87 o 162
0.79/0.87 c * 0.9s| 802 | 465 | 3122 | 3.7 |2618k| 48 | - | 295 | 261 | 295 | 71 | 99 | 102 | 638 | 0.000000e+00 | 1.620000e+02 | Inf
1.00/1.04 o 161
1.00/1.04 c * 1.0s| 1194 | 649 | 4490 | 3.7 |2957k| 48 | - | 295 | 455 | 295 | 67 | 156 | 296 | 721 | 0.000000e+00 | 1.610000e+02 | Inf
1.10/1.15 o 138
1.10/1.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.15 c * 1.2s| 1429 | 724 | 5375 | 3.7 |3120k| 48 | - | 295 | 567 | 295 | 69 | 187 | 408 | 776 | 0.000000e+00 | 1.380000e+02 | Inf
1.10/1.17 o 103
1.10/1.17 c * 1.2s| 1487 | 669 | 5483 | 3.6 |3088k| 51 | - | 295 | 576 | 295 | 71 | 189 | 417 | 780 | 0.000000e+00 | 1.030000e+02 | Inf
1.19/1.24 o 90
1.19/1.24 c * 1.2s| 1651 | 548 | 5966 | 3.5 |3107k| 51 | - | 295 | 687 | 295 | 72 | 200 | 531 | 807 | 0.000000e+00 | 9.000000e+01 | Inf
1.29/1.31 o 66
1.29/1.31 c * 1.3s| 1797 | 431 | 6521 | 3.6 |3148k| 51 | - | 295 | 782 | 295 | 69 | 210 | 635 | 822 | 0.000000e+00 | 6.600000e+01 | Inf
1.29/1.31 o 61
1.29/1.31 c * 1.3s| 1807 | 413 | 6604 | 3.6 |3119k| 51 | - | 295 | 748 | 295 | 69 | 210 | 639 | 825 | 0.000000e+00 | 6.100000e+01 | Inf
1.29/1.37 o 55
1.29/1.37 c * 1.4s| 1911 | 403 | 7265 | 3.7 |3178k| 51 | - | 295 | 829 | 295 | 71 | 226 | 725 | 839 | 0.000000e+00 | 5.500000e+01 | Inf
1.29/1.39 o 54
1.29/1.39 c * 1.4s| 1945 | 375 | 7667 | 3.9 |3206k| 51 | - | 295 | 864 | 295 | 69 | 230 | 774 | 843 | 0.000000e+00 | 5.400000e+01 | Inf
1.49/1.53 o 46
1.49/1.53 c * 1.5s| 2113 | 389 | 9188 | 4.3 |3318k| 51 | - | 295 |1005 | 295 | 67 | 275 | 922 | 948 | 0.000000e+00 | 4.600000e+01 | Inf
1.49/1.53 o 35
1.49/1.53 c * 1.5s| 2115 | 370 | 9203 | 4.3 |3299k| 51 | - | 295 | 999 | 295 | 67 | 275 | 922 | 948 | 0.000000e+00 | 3.500000e+01 | Inf
1.59/1.62 o 33
1.59/1.62 c * 1.6s| 2217 | 349 | 10115 | 4.5 |3351k| 51 | - | 295 |1046 | 295 | 74 | 314 | 990 |1001 | 0.000000e+00 | 3.300000e+01 | Inf
1.59/1.62 o 30
1.59/1.62 c * 1.6s| 2233 | 338 | 10137 | 4.5 |3340k| 51 | - | 295 |1048 | 295 | 75 | 315 | 992 |1001 | 0.000000e+00 | 3.000000e+01 | Inf
1.59/1.63 o 5
1.59/1.63 c * 1.6s| 2264 | 118 | 10209 | 4.5 |3125k| 51 | - | 295 |1055 | 295 | 74 | 318 |1004 |1003 | 0.000000e+00 | 5.000000e+00 | Inf
1.69/1.70 o 2
1.69/1.70 c * 1.7s| 2308 | 90 | 10924 | 4.7 |3147k| 51 | - | 295 |1078 | 295 | 67 | 325 |1076 |1067 | 0.000000e+00 | 2.000000e+00 | Inf
2.10/2.12 c
2.10/2.12 c SCIP Status : problem is solved [optimal solution found]
2.10/2.12 c Solving Time (sec) : 2.12
2.10/2.12 c Solving Nodes : 2740
2.10/2.12 c Primal Bound : +2.00000000000000e+00 (95 solutions)
2.10/2.12 c Dual Bound : +2.00000000000000e+00
2.10/2.12 c Gap : 0.00 %
2.10/2.12 s OPTIMUM FOUND
2.10/2.12 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
2.10/2.12 v -x147 -x146 x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 -x133 -x132 -x131 x130 -x129 -x128 -x127
2.10/2.12 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
2.10/2.12 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.10/2.12 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 -x56
2.10/2.12 v -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.10/2.12 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.10/2.12 v -x4 -x3 -x2 -x1
2.10/2.12 c SCIP Status : problem is solved [optimal solution found]
2.10/2.12 c Solving Time : 2.12
2.10/2.12 c Original Problem :
2.10/2.12 c Problem name : HOME/instance-2705263-1278572929.wbo
2.10/2.12 c Variables : 297 (233 binary, 0 integer, 64 implicit integer, 0 continuous)
2.10/2.12 c Constraints : 166 initial, 166 maximal
2.10/2.12 c Presolved Problem :
2.10/2.12 c Problem name : t_HOME/instance-2705263-1278572929.wbo
2.10/2.12 c Variables : 295 (232 binary, 0 integer, 63 implicit integer, 0 continuous)
2.10/2.12 c Constraints : 159 initial, 1586 maximal
2.10/2.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.10/2.12 c trivial : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c dualfix : 0.00 2 0 0 0 0 0 0 0
2.10/2.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c implics : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c probing : 0.01 0 0 0 0 0 0 0 0
2.10/2.12 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c setppc : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c linear : 0.00 0 0 0 63 0 6 1 0
2.10/2.12 c indicator : 0.00 0 0 0 0 0 1 0 0
2.10/2.12 c logicor : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
2.10/2.12 c root node : - 118 - - 118 - - - -
2.10/2.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.10/2.12 c integral : 0 0 0 2408 0 11 189 0 0 1332
2.10/2.12 c knapsack : 1 6 7992 1571 0 24 10027 0 0 0
2.10/2.12 c setppc : 24 6 7770 1472 0 76 5904 0 0 0
2.10/2.12 c linear : 63 6 7827 1532 0 100 11704 402 0 0
2.10/2.12 c indicator : 63 0 7826 1594 0 19 6192 0 0 0
2.10/2.12 c logicor : 8+ 6 3111 1202 0 63 992 0 0 0
2.10/2.12 c bounddisjunction : 0+ 0 2129 0 0 3 64 0 0 0
2.10/2.12 c countsols : 0 0 0 1373 0 0 0 0 0 0
2.10/2.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.10/2.12 c integral : 0.81 0.00 0.00 0.81 0.00
2.10/2.12 c knapsack : 0.11 0.00 0.11 0.00 0.00
2.10/2.12 c setppc : 0.01 0.00 0.01 0.00 0.00
2.10/2.12 c linear : 0.06 0.00 0.05 0.01 0.00
2.10/2.12 c indicator : 0.02 0.00 0.01 0.01 0.00
2.10/2.12 c logicor : 0.03 0.00 0.03 0.00 0.00
2.10/2.12 c bounddisjunction : 0.01 0.00 0.01 0.00 0.00
2.10/2.12 c countsols : 0.00 0.00 0.00 0.00 0.00
2.10/2.12 c Propagators : Time Calls Cutoffs DomReds
2.10/2.12 c vbounds : 0.01 1595 0 382
2.10/2.12 c rootredcost : 0.00 20 0 59
2.10/2.12 c pseudoobj : 0.02 7916 82 5465
2.10/2.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.10/2.12 c propagation : 0.01 348 336 2114 24.0 5 21.0 -
2.10/2.12 c infeasible LP : 0.02 434 420 2201 19.1 2 17.5 0
2.10/2.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.12 c applied globally : - - - 1585 15.9 - - -
2.10/2.12 c applied locally : - - - 4 36.0 - - -
2.10/2.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.10/2.12 c cut pool : 0.00 4 - - 21 - (maximal pool size: 163)
2.10/2.12 c redcost : 0.01 2456 0 105 0 0
2.10/2.12 c impliedbounds : 0.00 5 0 0 0 0
2.10/2.12 c intobj : 0.00 0 0 0 0 0
2.10/2.12 c cgmip : 0.00 0 0 0 0 0
2.10/2.12 c gomory : 0.01 5 0 0 60 0
2.10/2.12 c strongcg : 0.01 5 0 0 185 0
2.10/2.12 c cmir : 0.00 5 0 0 0 0
2.10/2.13 c flowcover : 0.01 5 0 0 0 0
2.10/2.13 c clique : 0.00 5 0 0 2 0
2.10/2.13 c zerohalf : 0.00 0 0 0 0 0
2.10/2.13 c mcf : 0.00 1 0 0 0 0
2.10/2.13 c rapidlearning : 0.01 1 0 0 0 0
2.10/2.13 c Pricers : Time Calls Vars
2.10/2.13 c problem variables: 0.00 0 0
2.10/2.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.10/2.13 c relpscost : 0.81 812 11 189 0 0 1332
2.10/2.13 c pscost : 0.00 0 0 0 0 0 0
2.10/2.13 c inference : 0.02 1354 0 0 0 0 2711
2.10/2.13 c mostinf : 0.00 0 0 0 0 0 0
2.10/2.13 c leastinf : 0.00 0 0 0 0 0 0
2.10/2.13 c fullstrong : 0.00 0 0 0 0 0 0
2.10/2.13 c allfullstrong : 0.00 0 0 0 0 0 0
2.10/2.13 c random : 0.00 0 0 0 0 0 0
2.10/2.13 c Primal Heuristics : Time Calls Found
2.10/2.13 c LP solutions : 0.00 - 19
2.10/2.13 c pseudo solutions : 0.00 - 0
2.10/2.13 c oneopt : 0.01 20 0
2.10/2.13 c guideddiving : 0.00 37 0
2.10/2.13 c coefdiving : 0.00 38 0
2.10/2.13 c pscostdiving : 0.00 38 0
2.10/2.13 c fracdiving : 0.00 38 0
2.10/2.13 c veclendiving : 0.00 38 0
2.10/2.13 c linesearchdiving : 0.00 38 0
2.10/2.13 c rootsoldiving : 0.00 28 0
2.10/2.13 c objpscostdiving : 0.00 29 0
2.10/2.13 c trivial : 0.00 2 0
2.10/2.13 c simplerounding : 0.00 819 0
2.10/2.13 c zirounding : 0.01 676 0
2.10/2.13 c rounding : 0.01 359 0
2.10/2.13 c shifting : 0.02 97 0
2.10/2.13 c intshifting : 0.00 0 0
2.10/2.13 c twoopt : 0.00 0 0
2.10/2.13 c fixandinfer : 0.00 0 0
2.10/2.13 c feaspump : 0.00 1 0
2.10/2.13 c intdiving : 0.00 0 0
2.10/2.13 c actconsdiving : 0.00 0 0
2.10/2.13 c octane : 0.00 0 0
2.10/2.13 c rens : 0.01 1 0
2.10/2.13 c rins : 0.00 0 0
2.10/2.13 c localbranching : 0.00 0 0
2.10/2.13 c mutation : 0.00 0 0
2.10/2.13 c crossover : 0.03 3 0
2.10/2.13 c dins : 0.00 0 0
2.10/2.13 c undercover : 0.00 0 0
2.10/2.13 c nlp : 0.00 0 0
2.10/2.13 c trysol : 0.01 114 76
2.10/2.13 c LP : Time Calls Iterations Iter/call Iter/sec
2.10/2.13 c primal LP : 0.00 0 0 0.00 -
2.10/2.13 c dual LP : 0.60 1654 18983 11.48 31551.62
2.10/2.13 c lex dual LP : 0.00 0 0 0.00 -
2.10/2.13 c barrier LP : 0.00 0 0 0.00 -
2.10/2.13 c diving/probing LP: 0.01 31 309 9.97 25962.02
2.10/2.13 c strong branching : 0.80 1299 36747 28.29 45684.43
2.10/2.13 c (at root node) : - 16 1315 82.19 -
2.10/2.13 c conflict analysis: 0.00 0 0 0.00 -
2.10/2.13 c B&B Tree :
2.10/2.13 c number of runs : 1
2.10/2.13 c nodes : 2740
2.10/2.13 c nodes (total) : 2740
2.10/2.13 c nodes left : 0
2.10/2.13 c max depth : 51
2.10/2.13 c max depth (total): 51
2.10/2.13 c backtracks : 424 (15.5%)
2.10/2.13 c delayed cutoffs : 254
2.10/2.13 c repropagations : 2242 (9059 domain reductions, 98 cutoffs)
2.10/2.13 c avg switch length: 3.80
2.10/2.13 c switching time : 0.07
2.10/2.13 c Solution :
2.10/2.13 c Solutions found : 95 (20 improvements)
2.10/2.13 c First Solution : +2.85500000000000e+03 (in run 1, after 29 nodes, 0.38 seconds, depth 14, found by <trysol>)
2.10/2.13 c Primal Bound : +2.00000000000000e+00 (in run 1, after 2308 nodes, 1.70 seconds, depth 12, found by <relaxation>)
2.10/2.13 c Dual Bound : +2.00000000000000e+00
2.10/2.13 c Gap : 0.00 %
2.10/2.13 c Root Dual Bound : +0.00000000000000e+00
2.10/2.13 c Root Iterations : 120
2.10/2.13 c Time complete: 2.12.