0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703124-1278564493.opb>
0.00/0.01 c original problem has 792 variables (792 bin, 0 int, 0 impl, 0 cont) and 595 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.07 c (round 1) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 0 upgd conss, 3600 impls, 0 clqs
0.00/0.08 c (round 2) 25 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 10 upgd conss, 5392 impls, 0 clqs
0.00/0.08 c (round 3) 41 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 88 chg coeffs, 10 upgd conss, 6960 impls, 0 clqs
0.00/0.08 c (round 4) 57 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 10 upgd conss, 8304 impls, 0 clqs
0.00/0.09 c (round 5) 73 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 116 chg coeffs, 10 upgd conss, 9424 impls, 0 clqs
0.00/0.09 c (round 6) 89 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 130 chg coeffs, 10 upgd conss, 10320 impls, 0 clqs
0.00/0.10 c (round 7) 105 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 144 chg coeffs, 10 upgd conss, 10992 impls, 0 clqs
0.00/0.10 c (round 8) 121 del vars, 98 del conss, 0 chg bounds, 0 chg sides, 158 chg coeffs, 10 upgd conss, 11440 impls, 0 clqs
0.00/0.10 c (round 9) 137 del vars, 112 del conss, 0 chg bounds, 0 chg sides, 172 chg coeffs, 10 upgd conss, 11664 impls, 0 clqs
0.10/0.10 c (round 10) 153 del vars, 126 del conss, 0 chg bounds, 0 chg sides, 186 chg coeffs, 10 upgd conss, 11664 impls, 0 clqs
0.10/0.13 c (0.1s) probing: 221/639 (34.6%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.10/0.13 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.10/0.13 c presolving (11 rounds):
0.10/0.13 c 153 deleted vars, 126 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 186 changed coefficients
0.10/0.13 c 11700 implications, 0 cliques
0.10/0.13 c presolved problem has 639 variables (639 bin, 0 int, 0 impl, 0 cont) and 460 constraints
0.10/0.13 c 441 constraints of type <and>
0.10/0.13 c 9 constraints of type <linear>
0.10/0.13 c 10 constraints of type <logicor>
0.10/0.13 c transformed objective value is always integral (scale: 2)
0.10/0.13 c Presolving Time: 0.11
0.10/0.13 c - non default parameters ----------------------------------------------------------------------
0.10/0.13 c # SCIP version 1.2.1.3
0.10/0.13 c
0.10/0.13 c # frequency for displaying node information lines
0.10/0.13 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.13 c display/freq = 10000
0.10/0.13 c
0.10/0.13 c # maximal time in seconds to run
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/time = 1789.99
0.10/0.13 c
0.10/0.13 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.13 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.13 c limits/memory = 1620
0.10/0.13 c
0.10/0.13 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.10/0.13 c # [type: int, range: [1,2], default: 1]
0.10/0.13 c timing/clocktype = 2
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify inequalities
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/linear/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/indicator/addCouplingCons = TRUE
0.10/0.13 c
0.10/0.13 c # should presolving try to simplify knapsacks
0.10/0.13 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.13 c constraints/knapsack/simplifyinequalities = TRUE
0.10/0.13 c
0.10/0.13 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c heuristics/undercover/freq = 0
0.10/0.13 c
0.10/0.13 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.10/0.13 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.13 c separating/rapidlearning/freq = 0
0.10/0.13 c
0.10/0.13 c -----------------------------------------------------------------------------------------------
0.10/0.13 c start solving
0.10/0.13 c
0.10/0.14 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.14 c 0.1s| 1 | 0 | 22 | - |2997k| 0 | 12 | 639 | 460 | 639 | 901 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.04 c 1.0s| 1 | 0 | 623 | - |3043k| 0 | 17 | 639 | 460 | 639 | 903 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.99/1.07 c 1.1s| 1 | 0 | 629 | - |3059k| 0 | 22 | 639 | 460 | 639 | 906 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 636 | - |3084k| 0 | 27 | 639 | 460 | 639 | 911 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.17 c 1.2s| 1 | 0 | 644 | - |3110k| 0 | 32 | 639 | 460 | 639 | 917 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
1.20/1.23 c 1.2s| 1 | 0 | 658 | - |3139k| 0 | 33 | 639 | 460 | 639 | 921 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
1.29/1.31 c 1.3s| 1 | 0 | 667 | - |3171k| 0 | 39 | 639 | 460 | 639 | 929 | 28 | 0 | 0 | 3.000000e+00 | -- | Inf
1.39/1.44 c 1.4s| 1 | 2 | 667 | - |3172k| 0 | 39 | 639 | 460 | 639 | 929 | 28 | 0 | 18 | 3.000000e+00 | -- | Inf
9.79/9.82 o 5
9.79/9.82 c * 9.8s| 2902 | 1298 | 14822 | 4.9 |5755k| 116 | - | 639 |2124 | 639 | 222 |5203 |1674 |3578 | 3.000000e+00 | 5.000000e+00 | 66.67%
10.59/10.63 o 3
10.59/10.63 c *10.6s| 3244 | 0 | 16047 | 4.7 |4510k| 116 | - | 639 |2361 | 639 | 186 |5649 |2087 |3920 | 3.000000e+00 | 3.000000e+00 | 0.00%
10.59/10.63 c
10.59/10.63 c SCIP Status : problem is solved [optimal solution found]
10.59/10.63 c Solving Time (sec) : 10.62
10.59/10.63 c Solving Nodes : 3244
10.59/10.63 c Primal Bound : +3.00000000000000e+00 (2 solutions)
10.59/10.63 c Dual Bound : +3.00000000000000e+00
10.59/10.63 c Gap : 0.00 %
10.59/10.63 s OPTIMUM FOUND
10.59/10.63 v x216 -x215 x214 x213 x212 x211 x210 x209 -x208 x207 x206 x205 -x204 x203 x202 -x201 x144 x143 x142 -x141 x140 x139 x138 x137 -x200
10.59/10.63 v x199 -x198 x197 x196 x195 -x194 x193 x136 -x135 -x134 x133 x132 -x131 -x130 x129 -x192 x191 -x190 -x189 x188 x187 x186 -x185
10.59/10.63 v x128 -x127 -x126 x125 -x124 -x123 x122 x121 -x184 -x183 x182 x181 -x180 -x179 x178 -x177 x120 -x119 -x118 -x117 -x116 x115
10.59/10.63 v x114 x113 -x176 -x175 -x174 -x173 -x172 -x171 x170 x169 -x112 x111 -x110 -x109 -x108 -x107 -x106 x105 -x168 -x167 -x166 -x165
10.59/10.63 v -x164 x163 x162 x161 -x104 x103 x102 x101 -x100 x99 x98 x97 -x160 -x159 -x158 x157 x156 x155 x154 -x153 -x96 -x95 x94 x93
10.59/10.63 v -x92 -x91 -x90 x89 -x152 -x151 -x150 -x149 -x148 -x147 -x146 x145 x88 -x87 -x86 -x85 -x84 -x83 x82 x81 x80 x79 -x78 -x77 x76
10.59/10.63 v x75 -x74 x73 x72 x71 -x70 -x69 -x68 x67 x66 x65 x64 -x63 x62 -x61 -x60 -x59 x58 x57 x56 -x55 -x54 x53 -x52 x51 -x50 x49 x48 x47
10.59/10.63 v -x46 -x45 -x44 x43 x42 x41 -x40 -x39 -x38 -x37 -x36 x35 x34 x33 -x32 -x31 x30 -x29 -x28 x27 x26 x25 -x24 -x23 x22 x21 x20
10.59/10.63 v -x19 x18 x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
10.59/10.63 c SCIP Status : problem is solved [optimal solution found]
10.59/10.63 c Solving Time : 10.62
10.59/10.63 c Original Problem :
10.59/10.63 c Problem name : HOME/instance-2703124-1278564493.opb
10.59/10.63 c Variables : 792 (792 binary, 0 integer, 0 implicit integer, 0 continuous)
10.59/10.63 c Constraints : 595 initial, 595 maximal
10.59/10.63 c Presolved Problem :
10.59/10.63 c Problem name : t_HOME/instance-2703124-1278564493.opb
10.59/10.63 c Variables : 639 (639 binary, 0 integer, 0 implicit integer, 0 continuous)
10.59/10.63 c Constraints : 460 initial, 2361 maximal
10.59/10.63 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
10.59/10.63 c trivial : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c dualfix : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c boundshift : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c inttobinary : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c implics : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c probing : 0.03 0 0 0 0 0 0 0 0
10.59/10.63 c and : 0.06 18 126 0 0 0 126 0 126
10.59/10.63 c linear : 0.01 1 8 0 0 0 0 0 60
10.59/10.63 c logicor : 0.00 0 0 0 0 0 0 0 0
10.59/10.63 c root node : - 55 - - 55 - - - -
10.59/10.63 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
10.59/10.63 c integral : 0 0 0 2687 0 0 103 0 0 5192
10.59/10.63 c and : 441 5287 10677 6 0 163 16980 5624 0 0
10.59/10.63 c linear : 9 6 10512 0 0 796 6411 0 0 0
10.59/10.63 c logicor : 10+ 6 3922 2 0 24 1097 0 0 0
10.59/10.63 c countsols : 0 0 0 2 0 0 0 0 0 0
10.59/10.63 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
10.59/10.63 c integral : 3.21 0.00 0.00 3.21 0.00
10.59/10.63 c and : 0.70 0.52 0.18 0.00 0.00
10.59/10.63 c linear : 0.52 0.00 0.52 0.00 0.00
10.59/10.63 c logicor : 0.07 0.00 0.07 0.00 0.00
10.59/10.63 c countsols : 0.00 0.00 0.00 0.00 0.00
10.59/10.63 c Propagators : Time Calls Cutoffs DomReds
10.59/10.63 c vbounds : 0.00 2 0 0
10.59/10.63 c rootredcost : 0.00 1 0 6
10.59/10.63 c pseudoobj : 0.01 10222 0 1
10.59/10.63 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.59/10.63 c propagation : 0.33 983 973 13340 52.6 277 14.6 -
10.59/10.63 c infeasible LP : 0.02 76 76 277 43.9 10 25.6 0
10.59/10.63 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.59/10.63 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.59/10.63 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.59/10.63 c applied globally : - - - 2087 26.9 - - -
10.59/10.63 c applied locally : - - - 0 0.0 - - -
10.59/10.63 c Separators : Time Calls Cutoffs DomReds Cuts Conss
10.59/10.63 c cut pool : 0.00 5 - - 17 - (maximal pool size: 58)
10.59/10.63 c redcost : 0.07 5289 0 0 0 0
10.59/10.63 c impliedbounds : 0.00 6 0 0 5 0
10.59/10.63 c intobj : 0.00 0 0 0 0 0
10.59/10.63 c cgmip : 0.00 0 0 0 0 0
10.59/10.63 c gomory : 0.06 6 0 0 38 0
10.59/10.63 c strongcg : 0.04 6 0 0 24 0
10.59/10.63 c cmir : 0.04 6 0 0 27 0
10.59/10.63 c flowcover : 0.12 6 0 0 34 0
10.59/10.63 c clique : 0.00 1 0 0 0 0
10.59/10.63 c zerohalf : 0.00 0 0 0 0 0
10.59/10.63 c mcf : 0.00 1 0 0 0 0
10.59/10.63 c rapidlearning : 0.12 1 0 0 0 0
10.59/10.63 c Pricers : Time Calls Vars
10.59/10.63 c problem variables: 0.00 0 0
10.59/10.63 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
10.59/10.63 c relpscost : 3.21 2679 0 103 0 0 5192
10.59/10.63 c pscost : 0.00 0 0 0 0 0 0
10.59/10.63 c inference : 0.00 0 0 0 0 0 0
10.59/10.63 c mostinf : 0.00 0 0 0 0 0 0
10.59/10.63 c leastinf : 0.00 0 0 0 0 0 0
10.59/10.63 c fullstrong : 0.00 0 0 0 0 0 0
10.59/10.63 c allfullstrong : 0.00 0 0 0 0 0 0
10.59/10.63 c random : 0.00 0 0 0 0 0 0
10.59/10.63 c Primal Heuristics : Time Calls Found
10.59/10.63 c LP solutions : 0.00 - 2
10.59/10.63 c pseudo solutions : 0.00 - 0
10.59/10.63 c crossover : 0.00 0 0
10.59/10.63 c oneopt : 0.00 1 0
10.59/10.63 c pscostdiving : 0.05 4 0
10.59/10.63 c fracdiving : 0.03 4 0
10.59/10.63 c veclendiving : 0.02 4 0
10.59/10.63 c linesearchdiving : 0.01 4 0
10.59/10.63 c guideddiving : 0.02 4 0
10.59/10.63 c coefdiving : 0.02 5 0
10.59/10.63 c feaspump : 0.06 3 0
10.59/10.63 c objpscostdiving : 0.03 3 0
10.59/10.63 c rootsoldiving : 0.30 3 0
10.59/10.63 c trivial : 0.00 2 0
10.59/10.63 c simplerounding : 0.00 0 0
10.59/10.63 c zirounding : 0.02 1000 0
10.59/10.63 c rounding : 0.05 994 0
10.59/10.63 c shifting : 0.86 283 0
10.59/10.63 c intshifting : 0.00 0 0
10.59/10.63 c twoopt : 0.00 0 0
10.59/10.63 c fixandinfer : 0.00 0 0
10.59/10.63 c intdiving : 0.00 0 0
10.59/10.63 c actconsdiving : 0.00 0 0
10.59/10.63 c octane : 0.00 0 0
10.59/10.63 c rens : 0.03 1 0
10.59/10.63 c rins : 0.00 0 0
10.59/10.63 c localbranching : 0.00 0 0
10.59/10.63 c mutation : 0.00 0 0
10.59/10.63 c dins : 0.00 0 0
10.59/10.63 c undercover : 0.72 1 0
10.59/10.63 c nlp : 0.00 0 0
10.59/10.63 c trysol : 0.00 0 0
10.59/10.63 c LP : Time Calls Iterations Iter/call Iter/sec
10.59/10.63 c primal LP : 0.05 0 0 0.00 0.00
10.59/10.63 c dual LP : 2.01 5355 13776 2.57 6860.47
10.59/10.63 c lex dual LP : 0.00 0 0 0.00 -
10.59/10.63 c barrier LP : 0.00 0 0 0.00 -
10.59/10.63 c diving/probing LP: 0.29 573 2271 3.96 7968.37
10.59/10.63 c strong branching : 3.14 3920 22095 5.64 7041.00
10.59/10.63 c (at root node) : - 18 704 39.11 -
10.59/10.63 c conflict analysis: 0.00 0 0 0.00 -
10.59/10.63 c B&B Tree :
10.59/10.63 c number of runs : 1
10.59/10.63 c nodes : 3244
10.59/10.63 c nodes (total) : 3244
10.59/10.63 c nodes left : 0
10.59/10.63 c max depth : 116
10.59/10.63 c max depth (total): 116
10.59/10.63 c backtracks : 348 (10.7%)
10.59/10.63 c delayed cutoffs : 288
10.59/10.63 c repropagations : 1393 (4048 domain reductions, 276 cutoffs)
10.59/10.63 c avg switch length: 4.40
10.59/10.63 c switching time : 0.28
10.59/10.63 c Solution :
10.59/10.63 c Solutions found : 2 (2 improvements)
10.59/10.63 c First Solution : +5.00000000000000e+00 (in run 1, after 2902 nodes, 9.81 seconds, depth 110, found by <relaxation>)
10.59/10.63 c Primal Bound : +3.00000000000000e+00 (in run 1, after 3244 nodes, 10.61 seconds, depth 106, found by <relaxation>)
10.59/10.63 c Dual Bound : +3.00000000000000e+00
10.59/10.63 c Gap : 0.00 %
10.59/10.63 c Root Dual Bound : +3.00000000000000e+00
10.59/10.63 c Root Iterations : 667
10.59/10.64 c Time complete: 10.63.