0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664684-1276453185.opb>
0.00/0.02 c original problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 880 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 0 upgd conss, 416 impls, 0 clqs
0.00/0.06 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 2 chg coeffs, 880 upgd conss, 416 impls, 0 clqs
0.00/0.08 c (0.0s) probing: 101/400 (25.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (3 rounds):
0.00/0.08 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 2 changed coefficients
0.00/0.08 c 416 implications, 0 cliques
0.00/0.08 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 880 constraints
0.00/0.08 c 880 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c conflict/interconss = 0
0.00/0.08 c
0.00/0.08 c # should binary conflicts be preferred?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c conflict/preferbinary = TRUE
0.00/0.08 c
0.00/0.08 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c constraints/agelimit = 1
0.00/0.08 c
0.00/0.08 c # should enforcement of pseudo solution be disabled?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/disableenfops = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1799.98
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c lp/solvefreq = -1
0.00/0.08 c
0.00/0.08 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.00/0.08 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.08 c lp/pricing = a
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # priority of node selection rule <dfs> in standard mode
0.00/0.08 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.08 c nodeselection/dfs/stdpriority = 1000000
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/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.00/0.08 c 0.0s| 1 | 2 | 0 | - |1701k| 0 | - | 400 | 880 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.92 o 200
1.89/1.92 c * 1.7s| 3375 | 5 | 0 | 0.0 |1893k| 30 | - | 400 | 907 | 0 | 0 | 0 |3082 | 0 | 2.000000e+00 | 2.000000e+02 |9900.00%
3.99/4.07 c
3.99/4.07 c SCIP Status : problem is solved [optimal solution found]
3.99/4.07 c Solving Time (sec) : 3.60
3.99/4.07 c Solving Nodes : 7318
3.99/4.07 c Primal Bound : +2.00000000000000e+02 (1 solutions)
3.99/4.07 c Dual Bound : +2.00000000000000e+02
3.99/4.07 c Gap : 0.00 %
3.99/4.07 s OPTIMUM FOUND
3.99/4.07 v x400 -x399 x398 -x397 -x396 x395 -x394 x393 x392 -x391 -x390 x389 -x388 x387 -x386 x385 -x384 x383 -x382 x381 -x380 x379 x378 -x377
3.99/4.07 v x376 -x375 -x374 x373 x372 -x371 x370 -x369 x368 -x367 -x366 x365 x364 -x363 -x362 x361 -x360 x359 -x358 x357 -x356 x355
3.99/4.07 v x354 -x353 x352 -x351 x350 -x349 -x348 x347 -x346 x345 -x344 x343 x342 -x341 x340 -x339 -x338 x337 x336 -x335 -x334 x333 x332
3.99/4.07 v -x331 x330 -x329 x328 -x327 x326 -x325 -x324 x323 -x322 x321 x320 -x319 -x318 x317 x316 -x315 -x314 x313 -x312 x311 x310 -x309
3.99/4.07 v -x308 x307 -x306 x305 x304 -x303 -x302 x301 -x300 x299 x298 -x297 x296 -x295 -x294 x293 x292 -x291 -x290 x289 x288 -x287
3.99/4.07 v -x286 x285 -x284 x283 -x282 x281 -x280 x279 -x278 x277 x276 -x275 x274 -x273 -x272 x271 x270 -x269 x268 -x267 -x266 x265 x264
3.99/4.07 v -x263 x262 -x261 -x260 x259 -x258 x257 x256 -x255 x254 -x253 x252 -x251 x250 -x249 -x248 x247 -x246 x245 -x244 x243 x242 -x241
3.99/4.07 v x240 -x239 -x238 x237 x236 -x235 x234 -x233 x232 -x231 x230 -x229 x228 -x227 -x226 x225 -x224 x223 x222 -x221 -x220 x219 x218
3.99/4.07 v -x217 -x216 x215 -x214 x213 -x212 x211 x210 -x209 -x208 x207 -x206 x205 -x204 x203 x202 -x201 -x200 x199 -x198 x197 x196
3.99/4.07 v -x195 x194 -x193 x192 -x191 -x190 x189 -x188 x187 -x186 x185 x184 -x183 x182 -x181 x180 -x179 -x178 x177 -x176 x175 x174 -x173
3.99/4.07 v -x172 x171 -x170 x169 -x168 x167 x166 -x165 -x164 x163 x162 -x161 -x160 x159 -x158 x157 -x156 x155 -x154 x153 -x152 x151 x150
3.99/4.07 v -x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 -x140 x139 -x138 x137 x136 -x135 -x134 x133 x132 -x131 x130 -x129 x128 -x127
3.99/4.07 v x126 -x125 x124 -x123 x122 -x121 x120 -x119 x118 -x117 x116 -x115 -x114 x113 -x112 x111 x110 -x109 -x108 x107 -x106 x105
3.99/4.07 v -x104 x103 -x102 x101 -x100 x99 -x98 x97 -x96 x95 x94 -x93 -x92 x91 -x90 x89 -x88 x87 x86 -x85 x84 -x83 -x82 x81 x80 -x79 -x78
3.99/4.07 v x77 -x76 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
3.99/4.07 v x49 -x48 x47 x46 -x45 x44 -x43 -x42 x41 -x40 x39 -x38 x37 x36 -x35 x34 -x33 -x32 x31 -x30 x29 -x28 x27 x26 -x25 x24 -x23
3.99/4.07 v x22 -x21 -x20 x19 -x18 x17 -x16 x15 -x14 x13 x12 -x11 x10 -x9 -x8 x7 -x6 x5 -x4 x3 -x2 x1
3.99/4.07 c SCIP Status : problem is solved [optimal solution found]
3.99/4.07 c Solving Time : 3.60
3.99/4.07 c Original Problem :
3.99/4.07 c Problem name : HOME/instance-2664684-1276453185.opb
3.99/4.07 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.07 c Constraints : 880 initial, 880 maximal
3.99/4.07 c Presolved Problem :
3.99/4.07 c Problem name : t_HOME/instance-2664684-1276453185.opb
3.99/4.07 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.07 c Constraints : 880 initial, 1008 maximal
3.99/4.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.07 c trivial : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c implics : 0.01 0 0 0 0 0 0 0 0
3.99/4.07 c probing : 0.00 0 0 0 0 0 0 0 0
3.99/4.07 c linear : 0.02 0 0 0 0 0 0 0 2
3.99/4.07 c logicor : 0.01 0 0 0 0 0 0 0 0
3.99/4.07 c root node : - 78 - - 78 - - - -
3.99/4.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.07 c integral : 0 0 0 0 0 0 0 0 0 0
3.99/4.07 c logicor : 880+ 0 75716 0 1 3658 169689 0 0 0
3.99/4.07 c countsols : 0 0 0 0 1 0 0 0 0 0
3.99/4.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.07 c integral : 0.00 0.00 0.00 0.00 0.00
3.99/4.07 c logicor : 0.67 0.00 0.67 0.00 0.00
3.99/4.07 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.07 c Propagators : Time Calls Cutoffs DomReds
3.99/4.07 c vbounds : 0.05 2 0 0
3.99/4.07 c rootredcost : 0.04 0 0 0
3.99/4.07 c pseudoobj : 1.49 81981 0 0
3.99/4.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.08 c propagation : 0.19 3658 3628 3628 4.6 2761 4.1 -
3.99/4.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.08 c applied globally : - - - 6389 4.4 - - -
3.99/4.08 c applied locally : - - - 0 0.0 - - -
3.99/4.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.99/4.08 c redcost : 0.00 0 0 0 0 0
3.99/4.08 c impliedbounds : 0.00 0 0 0 0 0
3.99/4.08 c intobj : 0.00 0 0 0 0 0
3.99/4.08 c cgmip : 0.00 0 0 0 0 0
3.99/4.08 c gomory : 0.00 0 0 0 0 0
3.99/4.08 c strongcg : 0.00 0 0 0 0 0
3.99/4.08 c cmir : 0.00 0 0 0 0 0
3.99/4.08 c flowcover : 0.00 0 0 0 0 0
3.99/4.08 c clique : 0.00 0 0 0 0 0
3.99/4.08 c zerohalf : 0.00 0 0 0 0 0
3.99/4.08 c mcf : 0.00 0 0 0 0 0
3.99/4.08 c rapidlearning : 0.00 0 0 0 0 0
3.99/4.08 c Pricers : Time Calls Vars
3.99/4.08 c problem variables: 0.00 0 0
3.99/4.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.08 c relpscost : 0.00 0 0 0 0 0 0
3.99/4.08 c pscost : 0.00 0 0 0 0 0 0
3.99/4.08 c inference : 0.32 5114 0 0 0 0 10228
3.99/4.08 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.08 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.08 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.08 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.08 c random : 0.00 0 0 0 0 0 0
3.99/4.08 c Primal Heuristics : Time Calls Found
3.99/4.08 c LP solutions : 0.00 - 0
3.99/4.08 c pseudo solutions : 0.00 - 1
3.99/4.08 c oneopt : 0.00 0 0
3.99/4.08 c trivial : 0.00 2 0
3.99/4.08 c simplerounding : 0.00 0 0
3.99/4.08 c zirounding : 0.00 0 0
3.99/4.08 c rounding : 0.00 0 0
3.99/4.08 c shifting : 0.00 0 0
3.99/4.08 c intshifting : 0.00 0 0
3.99/4.08 c twoopt : 0.00 0 0
3.99/4.08 c fixandinfer : 0.00 0 0
3.99/4.08 c feaspump : 0.00 0 0
3.99/4.08 c coefdiving : 0.00 0 0
3.99/4.08 c pscostdiving : 0.00 0 0
3.99/4.08 c fracdiving : 0.00 0 0
3.99/4.08 c veclendiving : 0.00 0 0
3.99/4.08 c intdiving : 0.00 0 0
3.99/4.08 c actconsdiving : 0.00 0 0
3.99/4.08 c objpscostdiving : 0.00 0 0
3.99/4.08 c rootsoldiving : 0.00 0 0
3.99/4.08 c linesearchdiving : 0.00 0 0
3.99/4.08 c guideddiving : 0.00 0 0
3.99/4.08 c octane : 0.00 0 0
3.99/4.08 c rens : 0.00 0 0
3.99/4.08 c rins : 0.00 0 0
3.99/4.08 c localbranching : 0.00 0 0
3.99/4.08 c mutation : 0.00 0 0
3.99/4.08 c crossover : 0.00 0 0
3.99/4.08 c dins : 0.00 0 0
3.99/4.08 c undercover : 0.00 0 0
3.99/4.08 c nlp : 0.00 0 0
3.99/4.08 c trysol : 0.01 0 0
3.99/4.08 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.08 c primal LP : 0.00 0 0 0.00 -
3.99/4.08 c dual LP : 0.00 0 0 0.00 -
3.99/4.08 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.08 c barrier LP : 0.00 0 0 0.00 -
3.99/4.08 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.08 c strong branching : 0.00 0 0 0.00 -
3.99/4.08 c (at root node) : - 0 0 0.00 -
3.99/4.08 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.08 c B&B Tree :
3.99/4.08 c number of runs : 1
3.99/4.08 c nodes : 7318
3.99/4.08 c nodes (total) : 7318
3.99/4.08 c nodes left : 0
3.99/4.08 c max depth : 30
3.99/4.08 c max depth (total): 30
3.99/4.08 c backtracks : 1676 (22.9%)
3.99/4.08 c delayed cutoffs : 2911
3.99/4.08 c repropagations : 8842 (77242 domain reductions, 1455 cutoffs)
3.99/4.08 c avg switch length: 3.51
3.99/4.08 c switching time : 0.35
3.99/4.08 c Solution :
3.99/4.08 c Solutions found : 1 (1 improvements)
3.99/4.08 c First Solution : +2.00000000000000e+02 (in run 1, after 3375 nodes, 1.67 seconds, depth 11, found by <relaxation>)
3.99/4.08 c Primal Bound : +2.00000000000000e+02 (in run 1, after 3375 nodes, 1.67 seconds, depth 11, found by <relaxation>)
3.99/4.08 c Dual Bound : +2.00000000000000e+02
3.99/4.08 c Gap : 0.00 %
3.99/4.08 c Root Dual Bound : +0.00000000000000e+00
3.99/4.08 c Root Iterations : 0
3.99/4.08 c Time complete: 4.08.