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-2667470-1276404434.opb>
0.00/0.02 c original problem has 239 variables (239 bin, 0 int, 0 impl, 0 cont) and 524 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 4 del vars, 8 del conss, 1 chg bounds, 0 chg sides, 6 chg coeffs, 0 upgd conss, 344 impls, 0 clqs
0.00/0.04 c (round 2) 4 del vars, 13 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 0 upgd conss, 344 impls, 0 clqs
0.00/0.04 c (round 3) 5 del vars, 14 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 0 upgd conss, 344 impls, 0 clqs
0.00/0.05 c (round 4) 6 del vars, 24 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 505 upgd conss, 344 impls, 0 clqs
0.00/0.06 c (round 5) 6 del vars, 24 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 510 upgd conss, 344 impls, 0 clqs
0.07/0.07 c (0.0s) probing: 214/233 (91.8%) - 4 fixings, 0 aggregations, 3 implications, 0 bound changes
0.07/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.07/0.07 c (round 6) 10 del vars, 24 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 510 upgd conss, 350 impls, 0 clqs
0.07/0.07 c (round 7) 10 del vars, 75 del conss, 1 chg bounds, 2 chg sides, 6 chg coeffs, 510 upgd conss, 350 impls, 0 clqs
0.07/0.07 c (0.0s) probing: 224/233 (96.1%) - 4 fixings, 0 aggregations, 3 implications, 0 bound changes
0.07/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.07/0.07 c presolving (8 rounds):
0.07/0.07 c 10 deleted vars, 75 deleted constraints, 1 tightened bounds, 0 added holes, 2 changed sides, 6 changed coefficients
0.07/0.07 c 350 implications, 0 cliques
0.07/0.07 c presolved problem has 229 variables (229 bin, 0 int, 0 impl, 0 cont) and 449 constraints
0.07/0.07 c 449 constraints of type <logicor>
0.07/0.07 c transformed objective value is always integral (scale: 1)
0.07/0.07 c Presolving Time: 0.04
0.07/0.07 c - non default parameters ----------------------------------------------------------------------
0.07/0.07 c # SCIP version 1.2.1.2
0.07/0.07 c
0.07/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.07/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.07 c conflict/interconss = 0
0.07/0.07 c
0.07/0.07 c # should binary conflicts be preferred?
0.07/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.07 c conflict/preferbinary = TRUE
0.07/0.07 c
0.07/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.07/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.07/0.07 c constraints/agelimit = 1
0.07/0.07 c
0.07/0.07 c # should enforcement of pseudo solution be disabled?
0.07/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.07 c constraints/disableenfops = TRUE
0.07/0.07 c
0.07/0.07 c # frequency for displaying node information lines
0.07/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.07/0.07 c display/freq = 10000
0.07/0.07 c
0.07/0.07 c # maximal time in seconds to run
0.07/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.07 c limits/time = 1799.99
0.07/0.07 c
0.07/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.07/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.07 c limits/memory = 1620
0.07/0.07 c
0.07/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.07/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.07/0.07 c lp/solvefreq = 0
0.07/0.07 c
0.07/0.07 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.07/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.07/0.07 c lp/pricing = a
0.07/0.07 c
0.07/0.07 c # should presolving try to simplify inequalities
0.07/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.07 c constraints/linear/simplifyinequalities = TRUE
0.07/0.07 c
0.07/0.07 c # should presolving try to simplify knapsacks
0.07/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.07/0.07 c
0.07/0.07 c # priority of node selection rule <dfs> in standard mode
0.07/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.07/0.07 c nodeselection/dfs/stdpriority = 1000000
0.07/0.07 c
0.07/0.07 c -----------------------------------------------------------------------------------------------
0.07/0.07 c start solving
0.07/0.07 c
0.07/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.08 c 0.1s| 1 | 0 | 129 | - |1404k| 0 | 13 | 229 | 449 | 229 | 449 | 0 | 0 | 0 | 1.179500e+03 | -- | Inf
0.07/0.08 o 1334
0.07/0.08 c R 0.1s| 1 | 0 | 129 | - |1409k| 0 | 13 | 229 | 449 | 229 | 449 | 0 | 0 | 0 | 1.179500e+03 | 1.334000e+03 | 13.10%
0.07/0.08 o 1309
0.07/0.08 c s 0.1s| 1 | 0 | 129 | - |1414k| 0 | 13 | 229 | 449 | 229 | 449 | 0 | 0 | 0 | 1.179500e+03 | 1.309000e+03 | 10.98%
0.09/0.10 c 0.1s| 1 | 0 | 137 | - |1415k| 0 | 14 | 229 | 449 | 229 | 450 | 1 | 0 | 0 | 1.186000e+03 | 1.309000e+03 | 10.37%
0.09/0.10 o 1266
0.09/0.10 c b 0.1s| 1 | 0 | 137 | - |1421k| 0 | 14 | 229 | 449 | 229 | 450 | 1 | 0 | 0 | 1.186000e+03 | 1.266000e+03 | 6.75%
0.09/0.11 c 0.1s| 1 | 0 | 141 | - |1423k| 0 | 14 | 229 | 449 | 229 | 451 | 2 | 0 | 0 | 1.188500e+03 | 1.266000e+03 | 6.52%
0.09/0.11 o 1261
0.09/0.11 c R 0.1s| 1 | 0 | 141 | - |1426k| 0 | 14 | 229 | 449 | 229 | 451 | 2 | 0 | 0 | 1.188500e+03 | 1.261000e+03 | 6.10%
0.09/0.13 c 0.1s| 1 | 0 | 152 | - |1427k| 0 | 16 | 229 | 449 | 229 | 452 | 3 | 0 | 0 | 1.191750e+03 | 1.261000e+03 | 5.81%
0.09/0.14 c 0.1s| 1 | 0 | 162 | - |1441k| 0 | 14 | 229 | 449 | 229 | 454 | 5 | 0 | 0 | 1.193000e+03 | 1.261000e+03 | 5.70%
0.09/0.16 c 0.1s| 1 | 0 | 167 | - |1448k| 0 | 14 | 229 | 449 | 229 | 455 | 6 | 0 | 0 | 1.193500e+03 | 1.261000e+03 | 5.66%
0.09/0.17 c 0.1s| 1 | 0 | 170 | - |1455k| 0 | 10 | 229 | 449 | 229 | 456 | 7 | 0 | 0 | 1.194000e+03 | 1.261000e+03 | 5.61%
0.09/0.19 c 0.1s| 1 | 0 | 180 | - |1462k| 0 | 0 | 229 | 449 | 229 | 457 | 8 | 0 | 0 | 1.194000e+03 | 1.261000e+03 | 5.61%
0.09/0.19 o 1194
0.09/0.19 c * 0.1s| 1 | 0 | 180 | - |1465k| 0 | - | 229 | 449 | 229 | 457 | 8 | 0 | 0 | 1.194000e+03 | 1.194000e+03 | 0.00%
0.09/0.19 c
0.09/0.19 c SCIP Status : problem is solved [optimal solution found]
0.09/0.19 c Solving Time (sec) : 0.14
0.09/0.19 c Solving Nodes : 1
0.09/0.19 c Primal Bound : +1.19400000000000e+03 (10 solutions)
0.09/0.19 c Dual Bound : +1.19400000000000e+03
0.09/0.19 c Gap : 0.00 %
0.09/0.19 s OPTIMUM FOUND
0.09/0.19 v -x239 -x238 x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218
0.09/0.19 v -x217 -x216 -x215 -x214 x213 -x212 -x211 -x210 -x209 x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 x197
0.09/0.19 v -x196 -x195 -x194 x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176
0.09/0.19 v -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 x160 x159 -x158 -x157 -x156 -x155
0.09/0.19 v -x154 -x153 -x152 x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 x142 x141 -x140 -x139 -x138 x137 -x136 -x135 -x134 x133
0.09/0.19 v -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 x114 -x113 -x112
0.09/0.19 v -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 x91 x90 -x89
0.09/0.19 v -x88 -x87 -x86 x85 -x84 -x83 -x82 x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63
0.09/0.19 v -x62 x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 x52 -x51 x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37
0.09/0.19 v x36 -x35 -x34 -x33 x32 x31 -x30 x29 -x28 x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 x12 -x11
0.09/0.19 v -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.09/0.19 c SCIP Status : problem is solved [optimal solution found]
0.09/0.19 c Solving Time : 0.14
0.09/0.19 c Original Problem :
0.09/0.19 c Problem name : HOME/instance-2667470-1276404434.opb
0.09/0.19 c Variables : 239 (239 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.19 c Constraints : 524 initial, 524 maximal
0.09/0.19 c Presolved Problem :
0.09/0.19 c Problem name : t_HOME/instance-2667470-1276404434.opb
0.09/0.19 c Variables : 229 (229 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.19 c Constraints : 449 initial, 449 maximal
0.09/0.19 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.19 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c dualfix : 0.00 1 0 0 0 0 0 0 0
0.09/0.19 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.19 c probing : 0.01 4 0 0 0 0 0 0 0
0.09/0.19 c linear : 0.01 1 4 0 1 0 14 2 6
0.09/0.19 c logicor : 0.01 0 0 0 0 0 61 0 0
0.09/0.19 c root node : - 0 - - 0 - - - -
0.09/0.19 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.19 c integral : 0 0 0 1 0 0 0 0 0 0
0.09/0.19 c logicor : 449 8 398 1 0 4 0 0 0 0
0.09/0.19 c countsols : 0 0 0 1 0 0 0 0 0 0
0.09/0.19 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.19 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.19 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.19 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.19 c Propagators : Time Calls Cutoffs DomReds
0.09/0.19 c vbounds : 0.00 2 0 0
0.09/0.19 c rootredcost : 0.00 0 0 0
0.09/0.19 c pseudoobj : 0.00 8 0 0
0.09/0.19 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.19 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.19 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.19 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.19 c applied globally : - - - 0 0.0 - - -
0.09/0.19 c applied locally : - - - 0 0.0 - - -
0.09/0.19 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.19 c cut pool : 0.00 7 - - 1 - (maximal pool size: 14)
0.09/0.19 c redcost : 0.00 8 0 0 0 0
0.09/0.19 c impliedbounds : 0.00 7 0 0 0 0
0.09/0.19 c intobj : 0.00 0 0 0 0 0
0.09/0.19 c cgmip : 0.00 0 0 0 0 0
0.09/0.19 c gomory : 0.01 7 0 0 438 0
0.09/0.19 c strongcg : 0.02 7 0 0 438 0
0.09/0.19 c cmir : 0.01 7 0 0 0 0
0.09/0.19 c flowcover : 0.03 7 0 0 0 0
0.09/0.19 c clique : 0.00 1 0 0 0 0
0.09/0.19 c zerohalf : 0.00 0 0 0 0 0
0.09/0.19 c mcf : 0.00 1 0 0 0 0
0.09/0.19 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.19 c Pricers : Time Calls Vars
0.09/0.19 c problem variables: 0.00 0 0
0.09/0.19 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.19 c pscost : 0.00 0 0 0 0 0 0
0.09/0.19 c inference : 0.00 0 0 0 0 0 0
0.09/0.19 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.19 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.19 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.19 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.19 c random : 0.00 0 0 0 0 0 0
0.09/0.19 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.19 c Primal Heuristics : Time Calls Found
0.09/0.19 c LP solutions : 0.00 - 1
0.09/0.19 c pseudo solutions : 0.00 - 0
0.09/0.19 c crossover : 0.00 0 0
0.09/0.19 c oneopt : 0.00 2 1
0.09/0.19 c trivial : 0.01 2 0
0.09/0.19 c simplerounding : 0.00 7 0
0.09/0.19 c zirounding : 0.00 0 0
0.09/0.19 c rounding : 0.00 7 2
0.09/0.19 c shifting : 0.00 7 6
0.09/0.19 c intshifting : 0.00 0 0
0.09/0.19 c twoopt : 0.00 0 0
0.09/0.19 c fixandinfer : 0.00 0 0
0.09/0.19 c feaspump : 0.00 0 0
0.09/0.19 c coefdiving : 0.00 0 0
0.09/0.19 c pscostdiving : 0.00 0 0
0.09/0.19 c fracdiving : 0.00 0 0
0.09/0.19 c veclendiving : 0.00 0 0
0.09/0.19 c intdiving : 0.00 0 0
0.09/0.19 c actconsdiving : 0.00 0 0
0.09/0.19 c objpscostdiving : 0.00 0 0
0.09/0.19 c rootsoldiving : 0.00 0 0
0.09/0.19 c linesearchdiving : 0.00 0 0
0.09/0.19 c guideddiving : 0.00 0 0
0.09/0.19 c octane : 0.00 0 0
0.09/0.19 c rens : 0.00 0 0
0.09/0.19 c rins : 0.00 0 0
0.09/0.19 c localbranching : 0.00 0 0
0.09/0.19 c mutation : 0.00 0 0
0.09/0.19 c dins : 0.00 0 0
0.09/0.19 c undercover : 0.00 0 0
0.09/0.19 c nlp : 0.00 0 0
0.09/0.19 c trysol : 0.00 0 0
0.09/0.19 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.19 c primal LP : 0.00 0 0 0.00 -
0.09/0.19 c dual LP : 0.03 8 180 22.50 6000.00
0.09/0.19 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.19 c barrier LP : 0.00 0 0 0.00 -
0.09/0.19 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.19 c strong branching : 0.00 0 0 0.00 -
0.09/0.19 c (at root node) : - 0 0 0.00 -
0.09/0.19 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.19 c B&B Tree :
0.09/0.19 c number of runs : 1
0.09/0.19 c nodes : 1
0.09/0.19 c nodes (total) : 1
0.09/0.19 c nodes left : 0
0.09/0.19 c max depth : 0
0.09/0.19 c max depth (total): 0
0.09/0.19 c backtracks : 0 (0.0%)
0.09/0.19 c delayed cutoffs : 0
0.09/0.19 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.19 c avg switch length: 2.00
0.09/0.19 c switching time : 0.00
0.09/0.19 c Solution :
0.09/0.19 c Solutions found : 10 (5 improvements)
0.09/0.19 c First Solution : +1.33400000000000e+03 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <rounding>)
0.09/0.19 c Primal Bound : +1.19400000000000e+03 (in run 1, after 1 nodes, 0.14 seconds, depth 0, found by <relaxation>)
0.09/0.19 c Dual Bound : +1.19400000000000e+03
0.09/0.19 c Gap : 0.00 %
0.09/0.19 c Root Dual Bound : +1.19400000000000e+03
0.09/0.19 c Root Iterations : 180
0.09/0.20 c Time complete: 0.19.