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-3732897-1338692922.opb>
0.00/0.01 c original problem has 435 variables (435 bin, 0 int, 0 impl, 0 cont) and 501 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 604
0.00/0.01 c feasible solution found by trivial heuristic, objective value 6.040000e+02
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1898 impls, 4 clqs
0.00/0.02 c (round 2) 1 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 477 upgd conss, 1898 impls, 4 clqs
0.00/0.02 c (round 3) 1 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 500 upgd conss, 1898 impls, 4 clqs
0.00/0.02 c (0.0s) probing: 138/434 (31.8%) - 0 fixings, 0 aggregations, 88 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 (4 rounds):
0.00/0.02 c 1 deleted vars, 1 deleted constraints, 1 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 2122 implications, 4 cliques
0.00/0.02 c presolved problem has 434 variables (434 bin, 0 int, 0 impl, 0 cont) and 500 constraints
0.00/0.02 c 93 constraints of type <knapsack>
0.00/0.02 c 406 constraints of type <setppc>
0.00/0.02 c 1 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.02
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
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 = 1790
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 = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = 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.05 o 0
0.00/0.05 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.05 c * 0.0s| 1 | 0 | 720 | - |2155k| 0 | - | 434 | 500 | 434 | 500 | 0 | 0 | 0 |-2.820000e+02 | 0.000000e+00 | 100.00%
0.00/0.05 c 0.0s| 1 | 0 | 720 | - |2155k| 0 | - | 434 | 500 | 434 | 500 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time (sec) : 0.05
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +0.00000000000000e+00 (3 solutions)
0.00/0.05 c Dual Bound : +0.00000000000000e+00
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v x1 -x214 -x307 x392 -x56 x136 x205 x209 -x55 -x96 x202 -x232 -x118 -x203 -x219 x310 x106 -x218 -x286 -x59 -x110 x140 -x217 -x60
0.00/0.05 v x103 x99 x104 x100 x268 -x290 -x306 x391 x135 -x173 -x213 -x115 -x230 x311 -x57 x95 -x117 -x208 -x231 x309 -x58 x141 -x227 -x396
0.00/0.05 v -x61 x97 -x114 x139 -x204 -x223 x264 -x285 -x41 x102 -x176 x101 -x109 -x177 -x215 -x287 -x216 -x291 -x76 x105 -x199 x267
0.00/0.05 v -x289 -x333 -x229 -x308 x393 -x116 x137 -x172 -x212 -x228 x312 -x427 x34 x138 -x295 -x397 x35 x142 x174 -x206 -x329 -x395 -x54
0.00/0.05 v x122 x179 -x226 -x42 x98 -x113 -x178 -x195 -x222 x263 -x328 -x46 x82 -x40 x81 -x107 x265 -x288 -x38 x79 x270 -x271 -x334 -x75
0.00/0.05 v x198 x269 -x272 -x332 x37 -x305 x394 x36 -x210 x296 -x398 -x426 -x51 -x134 -x300 -x380 -x53 x123 x175 -x207 -x294 -x93 -x127
0.00/0.05 v x159 -x224 -x292 -x430 -x50 -x72 -x94 -x111 x121 x158 -x194 -x220 -x330 -x431 x90 x119 -x157 -x283 -x331 -x45 -x71 x86 -x108
0.00/0.05 v -x196 x266 -x284 -x335 x201 x249 -x280 -x313 -x39 x77 x80 x200 -x250 -x276 x25 -x133 x390 x24 -x52 -x132 -x211 -x304 x381
0.00/0.05 v -x428 x23 -x92 x170 -x385 x433 -x91 -x131 x171 -x299 -x379 x432 -x167 -x225 -x282 -x377 -x49 -x112 -x126 -x163 -x221 -x281 -x293
0.00/0.05 v x89 x261 -x327 -x43 -x73 x85 x120 -x155 -x197 x262 -x315 -x74 -x156 x180 x258 -x279 -x319 x78 -x181 x254 -x275 -x314 -x374
0.00/0.05 v x33 x148 x169 -x29 x168 -x303 -x348 x389 x429 x415 x21 -x130 -x297 -x370 -x384 -x414 -x22 -x166 x260 -x324 -x413 -x47 -x124
0.00/0.05 v -x162 x259 -x326 -x369 -x378 x87 -x192 x351 -x44 x83 -x193 -x323 x352 -x70 x189 -x257 -x277 -x375 -x18 x66 -x185 -x246 x253
0.00/0.05 v -x273 -x318 -x373 -x32 x147 -x425 -x28 -x301 x347 -x388 x404 -x424 -x423 -x14 -x128 -x298 -x325 x349 -x382 x419 -x152 -x164
0.00/0.05 v -x191 x354 -x13 -x48 -x125 -x160 -x190 x242 x353 -x371 -x411 -x67 -x88 x372 x408 -x412 -x69 x84 -x322 -x376 -x19 x188 -x255 -x278
0.00/0.05 v x355 -x17 -x65 -x184 x245 x251 -x274 -x316 -x30 x149 -x26 -x302 -x386 x403 x153 -x422 -x129 x151 x350 -x383 -x418 -x165
0.00/0.05 v x409 -x15 -x68 -x161 x241 -x339 x407 x16 -x338 -x368 -x20 x243 -x320 x357 x2 -x186 x248 -x256 x360 -x64 -x182 x247 -x252 -x317
0.00/0.05 v x356 -x31 x150 -x27 x154 -x387 x405 x146 x406 -x420 x410 -x416 x346 -x365 x402 x343 -x367 -x12 x4 x244 -x321 -x336 -x364 x5
0.00/0.05 v -x187 x233 -x337 x3 -x62 -x183 x234 x358 x435 x345 -x421 -x10 x145 -x366 -x417 -x9 x143 -x238 x344 -x362 x434 -x11 x144 -x237
0.00/0.05 v x342 x401 -x8 x239 -x361 x399 -x7 x240 x340 -x363 x400 -x236 x341 x6 -x63 x235 x359
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time : 0.05
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-3732897-1338692922.opb
0.00/0.05 c Variables : 435 (435 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 501 initial, 501 maximal
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-3732897-1338692922.opb
0.00/0.05 c Variables : 434 (434 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 500 initial, 500 maximal
0.00/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.01 0 0 0 0 0 0 0 0
0.00/0.06 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c linear : 0.01 1 0 0 1 0 1 0 0
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 0 - - 0 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c knapsack : 93 0 306 0 0 0 0 0 0 0
0.00/0.06 c setppc : 406 0 306 0 0 0 0 0 0 0
0.00/0.06 c logicor : 1 0 4 0 0 0 0 0 0 0
0.00/0.06 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c setppc : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 2 0 0
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.00 1 0 0
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 0 0.0 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 0 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 0 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 0 0 0 0 0 0
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c oneopt : 0.00 0 0
0.00/0.06 c trivial : 0.00 2 2
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 0 0
0.00/0.06 c shifting : 0.00 0 0
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.03 1 720 720.00 25404.89
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 1
0.00/0.06 c nodes (total) : 1
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 0
0.00/0.06 c max depth (total): 0
0.00/0.06 c backtracks : 0 (0.0%)
0.00/0.06 c delayed cutoffs : 0
0.00/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 2.00
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 3 (2 improvements)
0.00/0.06 c First Solution : +6.04000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.06 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <relaxation>)
0.00/0.06 c Dual Bound : +0.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +0.00000000000000e+00
0.00/0.06 c Root Iterations : 720
0.00/0.06 c Time complete: 0.05.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3732897-1338692922/watcher-3732897-1338692922 -o /tmp/evaluation-result-3732897-1338692922/solver-3732897-1338692922 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3732897-1338692922.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.09 2.03 2.01 3/176 15598
/proc/meminfo: memFree=27133684/32873660 swapFree=7120/7120
[pid=15598] ppid=15596 vsize=8944 CPUtime=0 cores=1,3,5,7
/proc/15598/stat : 15598 (pbscip.linux.x8) R 15596 15598 13836 0 -1 4202496 1386 0 0 0 0 0 0 0 20 0 1 0 335418000 9158656 1332 33554432000 4194304 8395647 140735163782000 140736395660632 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/15598/statm: 2236 1344 374 1026 0 1206 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0640649
CPU time (s): 0.06199
CPU user time (s): 0.055991
CPU system time (s): 0.005999
CPU usage (%): 96.7613
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.055991
system time used= 0.005999
maximum resident set size= 13336
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3755
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.003999 second system time
The end