0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2692733-1277899904.wbo>
0.00/0.00 c original problem has 221 variables (195 bin, 0 int, 0 impl, 26 cont) and 128 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, 34 impls, 49 clqs
0.00/0.00 c (round 2) 0 del vars, 17 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 49 clqs
0.00/0.01 c (round 3) 2 del vars, 19 del conss, 24 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 49 clqs
0.00/0.01 c (round 4) 4 del vars, 19 del conss, 24 chg bounds, 2 chg sides, 0 chg coeffs, 61 upgd conss, 34 impls, 49 clqs
0.00/0.02 c (0.0s) probing: 101/193 (52.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 4 deleted vars, 19 deleted constraints, 24 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.00/0.02 c 34 implications, 49 cliques
0.00/0.02 c presolved problem has 217 variables (193 bin, 0 int, 0 impl, 24 cont) and 109 constraints
0.00/0.02 c 24 constraints of type <indicator>
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 49 constraints of type <setppc>
0.00/0.02 c 24 constraints of type <linear>
0.00/0.02 c 11 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.2
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 = 1800
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 # 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 # 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 | 91 | - | 961k| 0 | 32 | 217 | 109 | 217 | 61 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 o 1143
0.00/0.02 c y 0.0s| 1 | 0 | 198 | - | 969k| 0 | 32 | 217 | 109 | 217 | 61 | 0 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 227 | - |1147k| 0 | 47 | 217 | 109 | 217 | 77 | 16 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.04 c 0.0s| 1 | 0 | 289 | - |1392k| 0 | 46 | 217 | 109 | 217 | 83 | 22 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.05 c 0.1s| 1 | 0 | 299 | - |1532k| 0 | 48 | 217 | 109 | 217 | 88 | 27 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.07 c 0.1s| 1 | 0 | 331 | - |1665k| 0 | 49 | 217 | 109 | 217 | 92 | 31 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.08 c 0.1s| 1 | 0 | 347 | - |1670k| 0 | 52 | 217 | 109 | 217 | 94 | 33 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.00/0.09 c 0.1s| 1 | 0 | 359 | - |1673k| 0 | 51 | 217 | 109 | 217 | 95 | 34 | 0 | 0 | 0.000000e+00 | 1.143000e+03 | Inf
0.29/0.30 c 0.3s| 1 | 0 | 377 | - |1677k| 0 | 51 | 217 | 109 | 217 | 95 | 34 | 0 | 34 | 0.000000e+00 | 1.143000e+03 | Inf
0.29/0.31 c 0.3s| 1 | 0 | 383 | - |1678k| 0 | 53 | 217 | 109 | 217 | 97 | 36 | 0 | 34 | 0.000000e+00 | 1.143000e+03 | Inf
0.39/0.42 c 0.4s| 1 | 0 | 389 | - |1678k| 0 | 51 | 217 | 109 | 217 | 97 | 36 | 0 | 53 | 0.000000e+00 | 1.143000e+03 | Inf
0.39/0.43 c 0.4s| 1 | 0 | 391 | - |1680k| 0 | 53 | 217 | 109 | 217 | 99 | 38 | 0 | 53 | 0.000000e+00 | 1.143000e+03 | Inf
0.39/0.47 c 0.5s| 1 | 0 | 394 | - |1680k| 0 | 52 | 217 | 109 | 217 | 99 | 38 | 0 | 60 | 0.000000e+00 | 1.143000e+03 | Inf
0.49/0.50 c 0.5s| 1 | 0 | 397 | - |1680k| 0 | 52 | 217 | 109 | 217 | 89 | 38 | 0 | 62 | 0.000000e+00 | 1.143000e+03 | Inf
0.49/0.52 c 0.5s| 1 | 0 | 399 | - |1680k| 0 | 52 | 217 | 109 | 217 | 89 | 38 | 0 | 64 | 0.000000e+00 | 1.143000e+03 | Inf
0.49/0.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.5s| 1 | 2 | 399 | - |1680k| 0 | 52 | 217 | 109 | 217 | 89 | 38 | 0 | 66 | 0.000000e+00 | 1.143000e+03 | Inf
0.49/0.53 c (run 1, node 1) restarting after 13 global fixings of integer variables
0.49/0.53 c
0.49/0.53 c (restart) converted 17 cuts from the global cut pool into linear constraints
0.49/0.53 c
0.49/0.54 c presolving:
0.49/0.54 c (round 1) 13 del vars, 2 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 56 clqs
0.49/0.54 c (round 2) 13 del vars, 2 del conss, 8 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 34 impls, 56 clqs
0.49/0.54 c (round 3) 13 del vars, 2 del conss, 8 chg bounds, 1 chg sides, 0 chg coeffs, 16 upgd conss, 34 impls, 56 clqs
0.49/0.54 c presolving (4 rounds):
0.49/0.54 c 13 deleted vars, 2 deleted constraints, 8 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.49/0.54 c 34 implications, 56 cliques
0.49/0.54 c presolved problem has 204 variables (180 bin, 0 int, 0 impl, 24 cont) and 124 constraints
0.49/0.54 c 24 constraints of type <indicator>
0.49/0.54 c 11 constraints of type <knapsack>
0.49/0.54 c 55 constraints of type <setppc>
0.49/0.54 c 24 constraints of type <linear>
0.49/0.54 c 10 constraints of type <logicor>
0.49/0.54 c transformed objective value is always integral (scale: 1)
0.49/0.54 c Presolving Time: 0.02
0.49/0.54 c
0.49/0.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.55 c 0.5s| 1 | 0 | 491 | - |1153k| 0 | 32 | 204 | 124 | 204 | 76 | 0 | 0 | 66 | 0.000000e+00 | 1.143000e+03 | Inf
0.49/0.56 c 0.5s| 1 | 0 | 541 | - |1421k| 0 | 46 | 204 | 124 | 204 | 93 | 17 | 0 | 66 | 0.000000e+00 | 1.143000e+03 | Inf
0.59/0.69 c 0.7s| 1 | 0 | 549 | - |1421k| 0 | 46 | 204 | 124 | 204 | 93 | 17 | 0 | 100 | 0.000000e+00 | 1.143000e+03 | Inf
0.69/0.76 c 0.7s| 1 | 0 | 556 | - |1421k| 0 | 47 | 204 | 124 | 204 | 93 | 17 | 0 | 114 | 0.000000e+00 | 1.143000e+03 | Inf
0.69/0.79 c 0.8s| 1 | 0 | 561 | - |1421k| 0 | 48 | 204 | 124 | 204 | 93 | 17 | 0 | 121 | 0.000000e+00 | 1.143000e+03 | Inf
0.78/0.82 c 0.8s| 1 | 0 | 566 | - |1421k| 0 | 45 | 204 | 124 | 204 | 93 | 17 | 0 | 126 | 0.000000e+00 | 1.143000e+03 | Inf
0.78/0.82 c 0.8s| 1 | 0 | 567 | - |1421k| 0 | 45 | 204 | 124 | 204 | 93 | 17 | 0 | 128 | 0.000000e+00 | 1.143000e+03 | Inf
0.78/0.83 c 0.8s| 1 | 2 | 567 | - |1421k| 0 | 45 | 204 | 124 | 204 | 93 | 17 | 0 | 129 | 0.000000e+00 | 1.143000e+03 | Inf
1.29/1.32 o 176
1.29/1.32 c * 1.2s| 44 | 23 | 1227 | 15.3 |1481k| 15 | - | 204 | 124 | 204 | 76 | 22 | 0 | 497 | 0.000000e+00 | 1.760000e+02 | Inf
1.39/1.48 o 69
1.39/1.48 c * 1.4s| 95 | 43 | 1843 | 13.6 |1521k| 33 | - | 204 | 147 | 204 | 73 | 23 | 23 | 651 | 0.000000e+00 | 6.900000e+01 | Inf
2.39/2.48 c
2.39/2.48 c SCIP Status : problem is solved [optimal solution found]
2.39/2.48 c Solving Time (sec) : 2.31
2.39/2.48 c Solving Nodes : 424 (total of 425 nodes in 2 runs)
2.39/2.48 c Primal Bound : +6.90000000000000e+01 (13 solutions)
2.39/2.48 c Dual Bound : +6.90000000000000e+01
2.39/2.48 c Gap : 0.00 %
2.39/2.48 s OPTIMUM FOUND
2.39/2.48 v x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148
2.39/2.48 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.39/2.48 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
2.39/2.48 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.39/2.48 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.39/2.48 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.39/2.48 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.39/2.48 v -x4 -x3 -x2 -x1
2.39/2.48 c SCIP Status : problem is solved [optimal solution found]
2.39/2.48 c Solving Time : 2.31
2.39/2.48 c Original Problem :
2.39/2.48 c Problem name : HOME/instance-2692733-1277899904.wbo
2.39/2.48 c Variables : 221 (195 binary, 0 integer, 0 implicit integer, 26 continuous)
2.39/2.48 c Constraints : 128 initial, 128 maximal
2.39/2.48 c Presolved Problem :
2.39/2.48 c Problem name : t_HOME/instance-2692733-1277899904.wbo
2.39/2.48 c Variables : 204 (180 binary, 0 integer, 0 implicit integer, 24 continuous)
2.39/2.48 c Constraints : 124 initial, 549 maximal
2.39/2.48 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.48 c trivial : 0.00 13 0 0 0 0 0 0 0
2.39/2.48 c dualfix : 0.00 4 0 0 0 0 0 0 0
2.39/2.48 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.48 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.48 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.48 c probing : 0.01 0 0 0 0 0 0 0 0
2.39/2.48 c indicator : 0.00 0 0 0 0 0 2 0 0
2.39/2.48 c knapsack : 0.01 0 0 0 0 0 0 0 0
2.39/2.48 c setppc : 0.00 0 0 0 0 0 0 0 0
2.39/2.48 c linear : 0.00 0 0 0 32 0 18 3 0
2.39/2.48 c logicor : 0.00 0 0 0 0 0 1 0 0
2.39/2.48 c root node : - 57 - - 64 - - - -
2.39/2.48 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.48 c integral : 0 0 0 525 0 11 477 0 0 322
2.39/2.48 c indicator : 24 0 1838 110 0 7 853 0 0 0
2.39/2.48 c knapsack : 11 12 1836 103 0 6 200 0 0 0
2.39/2.48 c setppc : 55 12 1809 91 0 14 3332 0 0 0
2.39/2.48 c linear : 24 12 1806 103 0 9 805 56 0 0
2.39/2.48 c logicor : 10+ 12 851 92 0 11 265 0 0 0
2.39/2.48 c countsols : 0 0 0 92 0 0 0 0 0 0
2.39/2.48 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.48 c integral : 1.72 0.00 0.00 1.72 0.00
2.39/2.48 c indicator : 0.00 0.00 0.00 0.00 0.00
2.39/2.48 c knapsack : 0.17 0.01 0.16 0.00 0.00
2.39/2.48 c setppc : 0.00 0.00 0.00 0.00 0.00
2.39/2.48 c linear : 0.00 0.00 0.00 0.00 0.00
2.39/2.48 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.48 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.48 c Propagators : Time Calls Cutoffs DomReds
2.39/2.48 c vbounds : 0.00 3 0 0
2.39/2.48 c rootredcost : 0.00 2 0 7
2.39/2.48 c pseudoobj : 0.00 1649 4 584
2.39/2.48 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.48 c propagation : 0.00 44 43 205 26.8 3 9.0 -
2.39/2.48 c infeasible LP : 0.00 138 138 592 14.9 5 4.2 0
2.39/2.48 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.48 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.48 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.48 c applied globally : - - - 436 14.3 - - -
2.39/2.48 c applied locally : - - - 0 0.0 - - -
2.39/2.48 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.48 c cut pool : 0.00 0 - - 0 - (maximal pool size: 67)
2.39/2.48 c redcost : 0.00 490 0 125 0 0
2.39/2.48 c impliedbounds : 0.00 12 0 0 0 0
2.39/2.48 c intobj : 0.00 0 0 0 0 0
2.39/2.48 c cgmip : 0.00 0 0 0 0 0
2.39/2.48 c gomory : 0.00 12 0 0 27 0
2.39/2.48 c strongcg : 0.02 12 0 0 208 0
2.39/2.48 c cmir : 0.00 11 0 0 0 0
2.39/2.48 c flowcover : 0.04 11 0 0 0 0
2.39/2.48 c clique : 0.02 12 0 0 23 0
2.39/2.48 c zerohalf : 0.00 0 0 0 0 0
2.39/2.48 c mcf : 0.00 2 0 0 0 0
2.39/2.48 c rapidlearning : 0.00 0 0 0 0 0
2.39/2.48 c Pricers : Time Calls Vars
2.39/2.48 c problem variables: 0.00 0 0
2.39/2.48 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.48 c relpscost : 1.72 414 11 477 0 0 322
2.39/2.48 c pscost : 0.00 0 0 0 0 0 0
2.39/2.48 c inference : 0.00 90 0 0 0 0 180
2.39/2.48 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.48 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.48 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.48 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.48 c random : 0.00 0 0 0 0 0 0
2.39/2.48 c Primal Heuristics : Time Calls Found
2.39/2.48 c LP solutions : 0.00 - 2
2.39/2.48 c pseudo solutions : 0.00 - 0
2.39/2.48 c oneopt : 0.01 3 0
2.39/2.48 c coefdiving : 0.00 2 0
2.39/2.48 c feaspump : 0.00 1 0
2.39/2.48 c guideddiving : 0.02 2 0
2.39/2.48 c pscostdiving : 0.00 3 0
2.39/2.48 c fracdiving : 0.00 3 0
2.39/2.48 c veclendiving : 0.00 3 0
2.39/2.48 c linesearchdiving : 0.00 3 0
2.39/2.48 c objpscostdiving : 0.00 2 0
2.39/2.48 c rootsoldiving : 0.00 2 0
2.39/2.48 c trivial : 0.00 2 0
2.39/2.48 c simplerounding : 0.00 232 0
2.39/2.48 c zirounding : 0.00 172 0
2.39/2.48 c rounding : 0.00 241 0
2.39/2.48 c shifting : 0.03 80 0
2.39/2.48 c intshifting : 0.00 2 0
2.39/2.48 c twoopt : 0.00 0 0
2.39/2.48 c fixandinfer : 0.00 0 0
2.39/2.48 c intdiving : 0.00 0 0
2.39/2.48 c actconsdiving : 0.00 0 0
2.39/2.48 c octane : 0.00 0 0
2.39/2.48 c rens : 0.01 1 0
2.39/2.48 c rins : 0.00 0 0
2.39/2.48 c localbranching : 0.00 0 0
2.39/2.48 c mutation : 0.00 0 0
2.39/2.48 c crossover : 0.01 1 0
2.39/2.48 c dins : 0.00 0 0
2.39/2.48 c undercover : 0.00 0 0
2.39/2.48 c nlp : 0.00 0 0
2.39/2.48 c trysol : 0.00 16 11
2.39/2.48 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.48 c primal LP : 0.00 0 0 0.00 -
2.39/2.48 c dual LP : 0.19 602 8186 13.60 43084.21
2.39/2.48 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.48 c barrier LP : 0.00 0 0 0.00 -
2.39/2.48 c diving/probing LP: 0.03 99 621 6.27 20700.00
2.39/2.48 c strong branching : 1.72 1477 57598 39.00 33487.21
2.39/2.48 c (at root node) : - 129 16286 126.25 -
2.39/2.48 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.48 c B&B Tree :
2.39/2.48 c number of runs : 2
2.39/2.48 c nodes : 424
2.39/2.48 c nodes (total) : 425
2.39/2.48 c nodes left : 0
2.39/2.48 c max depth : 33
2.39/2.48 c max depth (total): 33
2.39/2.48 c backtracks : 108 (25.5%)
2.39/2.48 c delayed cutoffs : 44
2.39/2.48 c repropagations : 311 (1560 domain reductions, 15 cutoffs)
2.39/2.48 c avg switch length: 3.72
2.39/2.48 c switching time : 0.03
2.39/2.48 c Solution :
2.39/2.48 c Solutions found : 13 (3 improvements)
2.39/2.48 c First Solution : +1.14300000000000e+03 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <trysol>)
2.39/2.48 c Primal Bound : +6.90000000000000e+01 (in run 2, after 95 nodes, 1.40 seconds, depth 33, found by <relaxation>)
2.39/2.48 c Dual Bound : +6.90000000000000e+01
2.39/2.48 c Gap : 0.00 %
2.39/2.48 c Root Dual Bound : +0.00000000000000e+00
2.39/2.48 c Root Iterations : 567
2.39/2.48 c Time complete: 2.48.