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-2664705-1276467902.opb>
0.00/0.02 c original problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 600 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.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 408 impls, 0 clqs
0.00/0.05 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 600 upgd conss, 408 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 101/400 (25.2%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.06 c 408 implications, 0 cliques
0.00/0.06 c presolved problem has 400 variables (400 bin, 0 int, 0 impl, 0 cont) and 600 constraints
0.00/0.06 c 600 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c conflict/interconss = 0
0.00/0.06 c
0.00/0.06 c # should binary conflicts be preferred?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c conflict/preferbinary = TRUE
0.00/0.06 c
0.00/0.06 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c constraints/agelimit = 1
0.00/0.06 c
0.00/0.06 c # should enforcement of pseudo solution be disabled?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/disableenfops = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1799.99
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = -1
0.00/0.06 c
0.00/0.06 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.06 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.06 c lp/pricing = a
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # priority of node selection rule <dfs> in standard mode
0.00/0.06 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.06 c nodeselection/dfs/stdpriority = 1000000
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.0s| 1 | 2 | 0 | - |1505k| 0 | - | 400 | 600 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 o 200
0.69/0.76 c * 0.7s| 1816 | 16 | 0 | 0.0 |1727k| 68 | - | 400 | 666 | 0 | 0 | 0 |1420 | 0 | 1.100000e+01 | 2.000000e+02 |1718.18%
1.20/1.23 c
1.20/1.23 c SCIP Status : problem is solved [optimal solution found]
1.20/1.23 c Solving Time (sec) : 1.06
1.20/1.23 c Solving Nodes : 2914
1.20/1.23 c Primal Bound : +2.00000000000000e+02 (1 solutions)
1.20/1.23 c Dual Bound : +2.00000000000000e+02
1.20/1.23 c Gap : 0.00 %
1.20/1.23 s OPTIMUM FOUND
1.20/1.23 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
1.20/1.23 v -x376 x375 -x374 x373 x372 -x371 -x370 x369 x368 -x367 -x366 x365 x364 -x363 -x362 x361 -x360 x359 -x358 x357 -x356 x355
1.20/1.23 v -x354 x353 x352 -x351 -x350 x349 -x348 x347 -x346 x345 -x344 x343 -x342 x341 x340 -x339 -x338 x337 -x336 x335 x334 -x333 -x332
1.20/1.23 v x331 x330 -x329 -x328 x327 -x326 x325 x324 -x323 -x322 x321 -x320 x319 x318 -x317 x316 -x315 -x314 x313 -x312 x311 x310 -x309
1.20/1.23 v x308 -x307 x306 -x305 x304 -x303 x302 -x301 -x300 x299 -x298 x297 -x296 x295 x294 -x293 -x292 x291 -x290 x289 x288 -x287
1.20/1.23 v x286 -x285 -x284 x283 x282 -x281 -x280 x279 x278 -x277 x276 -x275 x274 -x273 -x272 x271 x270 -x269 x268 -x267 x266 -x265 -x264
1.20/1.23 v x263 -x262 x261 x260 -x259 x258 -x257 -x256 x255 -x254 x253 -x252 x251 x250 -x249 x248 -x247 x246 -x245 -x244 x243 x242 -x241
1.20/1.23 v -x240 x239 x238 -x237 -x236 x235 -x234 x233 -x232 x231 x230 -x229 -x228 x227 -x226 x225 -x224 x223 x222 -x221 x220 -x219 -x218
1.20/1.23 v x217 -x216 x215 -x214 x213 x212 -x211 x210 -x209 x208 -x207 -x206 x205 -x204 x203 x202 -x201 x200 -x199 -x198 x197 -x196
1.20/1.23 v x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 -x186 x185 x184 -x183 -x182 x181 -x180 x179 x178 -x177 -x176 x175 x174 -x173
1.20/1.23 v -x172 x171 x170 -x169 x168 -x167 x166 -x165 x164 -x163 -x162 x161 x160 -x159 -x158 x157 x156 -x155 -x154 x153 x152 -x151 x150
1.20/1.23 v -x149 -x148 x147 -x146 x145 -x144 x143 x142 -x141 x140 -x139 -x138 x137 -x136 x135 x134 -x133 x132 -x131 x130 -x129 -x128
1.20/1.23 v x127 -x126 x125 x124 -x123 -x122 x121 x120 -x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 x110 -x109 -x108 x107 -x106 x105
1.20/1.23 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
1.20/1.23 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
1.20/1.23 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
1.20/1.23 v x22 -x21 -x20 x19 x18 -x17 -x16 x15 -x14 x13 -x12 x11 x10 -x9 -x8 x7 x6 -x5 -x4 x3 x2 -x1
1.20/1.23 c SCIP Status : problem is solved [optimal solution found]
1.20/1.23 c Solving Time : 1.06
1.20/1.23 c Original Problem :
1.20/1.23 c Problem name : HOME/instance-2664705-1276467902.opb
1.20/1.23 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.23 c Constraints : 600 initial, 600 maximal
1.20/1.23 c Presolved Problem :
1.20/1.23 c Problem name : t_HOME/instance-2664705-1276467902.opb
1.20/1.23 c Variables : 400 (400 binary, 0 integer, 0 implicit integer, 0 continuous)
1.20/1.23 c Constraints : 600 initial, 698 maximal
1.20/1.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.20/1.23 c trivial : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c implics : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c probing : 0.00 0 0 0 0 0 0 0 0
1.20/1.23 c linear : 0.02 0 0 0 0 0 0 0 1
1.20/1.23 c logicor : 0.01 0 0 0 0 0 0 0 0
1.20/1.23 c root node : - 288 - - 288 - - - -
1.20/1.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.20/1.23 c integral : 0 0 0 0 0 0 0 0 0 0
1.20/1.23 c logicor : 600+ 0 21945 0 1 1085 30971 0 0 0
1.20/1.23 c countsols : 0 0 0 0 1 0 0 0 0 0
1.20/1.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.20/1.23 c integral : 0.00 0.00 0.00 0.00 0.00
1.20/1.23 c logicor : 0.09 0.00 0.09 0.00 0.00
1.20/1.23 c countsols : 0.00 0.00 0.00 0.00 0.00
1.20/1.23 c Propagators : Time Calls Cutoffs DomReds
1.20/1.23 c vbounds : 0.01 2 0 0
1.20/1.23 c rootredcost : 0.01 0 0 0
1.20/1.23 c pseudoobj : 0.44 25373 0 2
1.20/1.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.20/1.23 c propagation : 0.03 1085 1083 1083 4.1 1177 3.7 -
1.20/1.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.20/1.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.20/1.23 c applied globally : - - - 2260 3.8 - - -
1.20/1.23 c applied locally : - - - 0 0.0 - - -
1.20/1.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.20/1.23 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.20/1.23 c redcost : 0.00 0 0 0 0 0
1.20/1.23 c impliedbounds : 0.00 0 0 0 0 0
1.20/1.23 c intobj : 0.00 0 0 0 0 0
1.20/1.23 c cgmip : 0.00 0 0 0 0 0
1.20/1.23 c gomory : 0.00 0 0 0 0 0
1.20/1.23 c strongcg : 0.00 0 0 0 0 0
1.20/1.23 c cmir : 0.00 0 0 0 0 0
1.20/1.23 c flowcover : 0.00 0 0 0 0 0
1.20/1.23 c clique : 0.00 0 0 0 0 0
1.20/1.23 c zerohalf : 0.00 0 0 0 0 0
1.20/1.23 c mcf : 0.00 0 0 0 0 0
1.20/1.23 c rapidlearning : 0.00 0 0 0 0 0
1.20/1.23 c Pricers : Time Calls Vars
1.20/1.23 c problem variables: 0.00 0 0
1.20/1.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.20/1.23 c relpscost : 0.00 0 0 0 0 0 0
1.20/1.23 c pscost : 0.00 0 0 0 0 0 0
1.20/1.23 c inference : 0.13 2230 0 0 0 0 4460
1.20/1.23 c mostinf : 0.00 0 0 0 0 0 0
1.20/1.23 c leastinf : 0.00 0 0 0 0 0 0
1.20/1.23 c fullstrong : 0.00 0 0 0 0 0 0
1.20/1.23 c allfullstrong : 0.00 0 0 0 0 0 0
1.20/1.23 c random : 0.00 0 0 0 0 0 0
1.20/1.23 c Primal Heuristics : Time Calls Found
1.20/1.23 c LP solutions : 0.00 - 0
1.20/1.23 c pseudo solutions : 0.00 - 1
1.20/1.23 c oneopt : 0.00 0 0
1.20/1.23 c trivial : 0.00 2 0
1.20/1.23 c simplerounding : 0.00 0 0
1.20/1.23 c zirounding : 0.00 0 0
1.20/1.23 c rounding : 0.00 0 0
1.20/1.23 c shifting : 0.00 0 0
1.20/1.23 c intshifting : 0.00 0 0
1.20/1.23 c twoopt : 0.00 0 0
1.20/1.23 c fixandinfer : 0.00 0 0
1.20/1.23 c feaspump : 0.00 0 0
1.20/1.23 c coefdiving : 0.00 0 0
1.20/1.23 c pscostdiving : 0.00 0 0
1.20/1.23 c fracdiving : 0.00 0 0
1.20/1.23 c veclendiving : 0.00 0 0
1.20/1.23 c intdiving : 0.00 0 0
1.20/1.23 c actconsdiving : 0.00 0 0
1.20/1.23 c objpscostdiving : 0.00 0 0
1.20/1.23 c rootsoldiving : 0.00 0 0
1.20/1.23 c linesearchdiving : 0.00 0 0
1.20/1.23 c guideddiving : 0.00 0 0
1.20/1.23 c octane : 0.00 0 0
1.20/1.23 c rens : 0.00 0 0
1.20/1.23 c rins : 0.00 0 0
1.20/1.23 c localbranching : 0.00 0 0
1.20/1.23 c mutation : 0.00 0 0
1.20/1.23 c crossover : 0.00 0 0
1.20/1.23 c dins : 0.00 0 0
1.20/1.23 c undercover : 0.00 0 0
1.20/1.23 c nlp : 0.01 0 0
1.20/1.23 c trysol : 0.00 0 0
1.20/1.23 c LP : Time Calls Iterations Iter/call Iter/sec
1.20/1.23 c primal LP : 0.00 0 0 0.00 -
1.20/1.23 c dual LP : 0.00 0 0 0.00 -
1.20/1.23 c lex dual LP : 0.00 0 0 0.00 -
1.20/1.23 c barrier LP : 0.00 0 0 0.00 -
1.20/1.23 c diving/probing LP: 0.00 0 0 0.00 -
1.20/1.23 c strong branching : 0.00 0 0 0.00 -
1.20/1.23 c (at root node) : - 0 0 0.00 -
1.20/1.23 c conflict analysis: 0.00 0 0 0.00 -
1.20/1.23 c B&B Tree :
1.20/1.23 c number of runs : 1
1.20/1.23 c nodes : 2914
1.20/1.23 c nodes (total) : 2914
1.20/1.23 c nodes left : 0
1.20/1.23 c max depth : 68
1.20/1.23 c max depth (total): 68
1.20/1.23 c backtracks : 463 (15.9%)
1.20/1.23 c delayed cutoffs : 1547
1.20/1.23 c repropagations : 4956 (15442 domain reductions, 402 cutoffs)
1.20/1.23 c avg switch length: 4.69
1.20/1.23 c switching time : 0.10
1.20/1.23 c Solution :
1.20/1.23 c Solutions found : 1 (1 improvements)
1.20/1.23 c First Solution : +2.00000000000000e+02 (in run 1, after 1816 nodes, 0.65 seconds, depth 25, found by <relaxation>)
1.20/1.23 c Primal Bound : +2.00000000000000e+02 (in run 1, after 1816 nodes, 0.65 seconds, depth 25, found by <relaxation>)
1.20/1.23 c Dual Bound : +2.00000000000000e+02
1.20/1.23 c Gap : 0.00 %
1.20/1.23 c Root Dual Bound : +0.00000000000000e+00
1.20/1.23 c Root Iterations : 0
1.20/1.24 c Time complete: 1.23.