0.00/0.01 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3452301-1307106352.opb>
0.00/0.01 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 309 del vars, 50 del conss, 0 add conss, 309 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1236 impls, 0 clqs
0.00/0.01 c (round 2) 309 del vars, 50 del conss, 0 add conss, 309 chg bounds, 0 chg sides, 0 chg coeffs, 309 upgd conss, 1854 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 309 deleted vars, 50 deleted constraints, 0 added constraints, 309 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 1854 implications, 0 cliques
0.00/0.01 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 309 constraints
0.00/0.01 c 309 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.4
0.00/0.01 c
0.00/0.01 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c conflict/interconss = 0
0.00/0.01 c
0.00/0.01 c # should binary conflicts be preferred?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c conflict/preferbinary = TRUE
0.00/0.01 c
0.00/0.01 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c constraints/agelimit = 1
0.00/0.01 c
0.00/0.01 c # should enforcement of pseudo solution be disabled?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/disableenfops = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1800
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = 0
0.00/0.01 c
0.00/0.01 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.01 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01 c lp/pricing = a
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # priority of node selection rule <dfs> in standard mode
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01 c nodeselection/dfs/stdpriority = 1000000
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 55 | - | 893k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.02 o -1
0.00/0.02 c R 0.0s| 1 | 0 | 55 | - | 893k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.02 o -2
0.00/0.02 c s 0.0s| 1 | 0 | 55 | - | 894k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.02 c 0.0s| 1 | 0 | 85 | - | 898k| 0 | 45 | 50 | 309 | 50 | 315 | 6 | 0 | 0 |-2.250000e+01 |-2.000000e+00 | 91.11%
0.00/0.02 o -7
0.00/0.02 c b 0.0s| 1 | 0 | 85 | - | 900k| 0 | 45 | 50 | 309 | 50 | 315 | 6 | 0 | 0 |-2.250000e+01 |-7.000000e+00 | 68.89%
0.02/0.03 c 0.0s| 1 | 0 | 114 | - | 907k| 0 | 41 | 50 | 309 | 50 | 322 | 13 | 0 | 0 |-2.050000e+01 |-7.000000e+00 | 65.85%
0.02/0.03 c 0.0s| 1 | 0 | 154 | - | 918k| 0 | 39 | 50 | 309 | 50 | 327 | 18 | 0 | 0 |-1.825000e+01 |-7.000000e+00 | 61.64%
0.02/0.04 c 0.0s| 1 | 0 | 168 | - | 926k| 0 | 36 | 50 | 309 | 50 | 336 | 27 | 0 | 0 |-1.800000e+01 |-7.000000e+00 | 61.11%
0.02/0.05 c 0.0s| 1 | 0 | 215 | - | 942k| 0 | 48 | 50 | 309 | 50 | 342 | 33 | 0 | 0 |-1.735714e+01 |-7.000000e+00 | 59.67%
0.02/0.06 c 0.1s| 1 | 0 | 260 | - | 961k| 0 | 45 | 50 | 309 | 50 | 348 | 39 | 0 | 0 |-1.687143e+01 |-7.000000e+00 | 58.51%
0.02/0.08 c 0.1s| 1 | 0 | 315 | - |1111k| 0 | 45 | 50 | 309 | 50 | 356 | 47 | 0 | 0 |-1.656522e+01 |-7.000000e+00 | 57.74%
0.02/0.08 o -7
0.02/0.08 c s 0.1s| 1 | 0 | 315 | - |1112k| 0 | 45 | 50 | 309 | 50 | 356 | 47 | 0 | 0 |-1.656522e+01 |-7.000000e+00 | 57.74%
0.02/0.09 c 0.1s| 1 | 0 | 376 | - |1180k| 0 | 46 | 50 | 309 | 50 | 365 | 56 | 0 | 0 |-1.598246e+01 |-7.000000e+00 | 56.20%
0.02/0.09 o -8
0.02/0.09 c b 0.1s| 1 | 0 | 376 | - |1182k| 0 | 46 | 50 | 309 | 50 | 365 | 56 | 0 | 0 |-1.598246e+01 |-8.000000e+00 | 49.95%
0.09/0.11 c 0.1s| 1 | 0 | 424 | - |1272k| 0 | 47 | 50 | 309 | 50 | 373 | 64 | 0 | 0 |-1.541176e+01 |-8.000000e+00 | 48.09%
0.09/0.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 454 | - |1423k| 0 | 45 | 50 | 309 | 50 | 380 | 71 | 0 | 0 |-1.509692e+01 |-8.000000e+00 | 47.01%
0.09/0.15 c 0.1s| 1 | 0 | 518 | - |1551k| 0 | 46 | 50 | 309 | 50 | 165 | 82 | 0 | 0 |-1.489474e+01 |-8.000000e+00 | 46.29%
0.09/0.16 c 0.2s| 1 | 0 | 536 | - |1614k| 0 | 48 | 50 | 309 | 50 | 173 | 90 | 0 | 0 |-1.475385e+01 |-8.000000e+00 | 45.78%
0.09/0.16 c 0.2s| 1 | 0 | 565 | - |1843k| 0 | 43 | 50 | 309 | 50 | 182 | 99 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.17 c 0.2s| 1 | 0 | 579 | - |2050k| 0 | 45 | 50 | 309 | 50 | 189 | 106 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.18 c 0.2s| 1 | 0 | 589 | - |2146k| 0 | 47 | 50 | 309 | 50 | 195 | 112 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.19 c 0.2s| 1 | 0 | 600 | - |2250k| 0 | 47 | 50 | 309 | 50 | 200 | 117 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.19/0.20 c 0.2s| 1 | 0 | 618 | - |2342k| 0 | 48 | 50 | 309 | 50 | 147 | 124 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.19/0.20 c 0.2s| 1 | 0 | 625 | - |2412k| 0 | 48 | 50 | 309 | 50 | 150 | 127 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.29/0.35 c 0.3s| 1 | 2 | 625 | - |2413k| 0 | 48 | 50 | 309 | 50 | 150 | 127 | 0 | 30 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.29/0.35 o -9
0.29/0.35 c * 0.3s| 7 | 5 | 625 | 0.0 |2418k| 6 | - | 50 | 309 | 0 | 0 | 127 | 0 | 30 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.29/0.35 o -10
0.29/0.35 c * 0.3s| 17 | 5 | 625 | 0.0 |2419k| 7 | - | 50 | 309 | 0 | 0 | 127 | 0 | 30 |-1.400000e+01 |-1.000000e+01 | 28.57%
0.29/0.35 o -11
0.29/0.35 c * 0.4s| 209 | 5 | 625 | 0.0 |2421k| 14 | - | 50 | 312 | 0 | 0 | 127 | 7 | 30 |-1.400000e+01 |-1.100000e+01 | 21.43%
0.29/0.35 o -12
0.29/0.35 c * 0.4s| 267 | 1 | 625 | 0.0 |2420k| 14 | - | 50 | 310 | 0 | 0 | 127 | 8 | 30 |-1.400000e+01 |-1.200000e+01 | 14.29%
0.40/0.47 o -13
0.40/0.47 c * 0.5s| 2938 | 5 | 625 | 0.0 |2399k| 29 | - | 50 | 292 | 0 | 0 | 127 |1572 | 30 |-1.400000e+01 |-1.300000e+01 | 7.14%
0.50/0.55 c
0.50/0.55 c SCIP Status : problem is solved [optimal solution found]
0.50/0.55 c Solving Time (sec) : 0.55
0.50/0.55 c Solving Nodes : 4793
0.50/0.55 c Primal Bound : -1.30000000000000e+01 (13 solutions)
0.50/0.55 c Dual Bound : -1.30000000000000e+01
0.50/0.55 c Gap : 0.00 %
0.50/0.55 s OPTIMUM FOUND
0.50/0.55 v -x50 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
0.50/0.55 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.50/0.55 c SCIP Status : problem is solved [optimal solution found]
0.50/0.55 c Total Time : 0.55
0.50/0.55 c solving : 0.55
0.50/0.55 c presolving : 0.01 (included in solving)
0.50/0.55 c reading : 0.00 (included in solving)
0.50/0.55 c Original Problem :
0.50/0.55 c Problem name : HOME/instance-3452301-1307106352.opb
0.50/0.55 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.50/0.55 c Constraints : 50 initial, 50 maximal
0.50/0.55 c Presolved Problem :
0.50/0.55 c Problem name : t_HOME/instance-3452301-1307106352.opb
0.50/0.55 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.50/0.55 c Constraints : 309 initial, 452 maximal
0.50/0.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.50/0.55 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c and : 0.01 0 0 0 0 0 0 0 0 0
0.50/0.55 c linear : 0.00 309 0 0 309 0 50 0 0 0
0.50/0.55 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.50/0.55 c root node : - 50 - - 50 - - - - -
0.50/0.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.50/0.55 c integral : 0 0 0 1 0 12 0 0 0 0 0 2
0.50/0.55 c logicor : 309+ 18 6874 0 5 8 89743 1344 14165 1 0 0
0.50/0.55 c countsols : 0 0 0 0 5 10 0 0 0 0 0 0
0.50/0.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.50/0.55 c integral : 0.14 0.00 0.00 0.14 0.00 0.00 0.00
0.50/0.55 c logicor : 0.06 0.00 0.05 0.00 0.00 0.00 0.01
0.50/0.55 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.50/0.55 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.50/0.55 c vbounds : 0 0 0 0
0.50/0.55 c rootredcost : 5 0 0 0
0.50/0.55 c pseudoobj : 18231 2589 1432 13495
0.50/0.55 c Propagator Timings : TotalTime Propagate Resprop
0.50/0.55 c vbounds : 0.00 0.00 0.00
0.50/0.55 c rootredcost : 0.00 0.00 0.00
0.50/0.55 c pseudoobj : 0.06 0.05 0.01
0.50/0.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.50/0.55 c propagation : 0.04 2776 2656 2656 3.8 0 0.0 -
0.50/0.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.50/0.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.50/0.55 c applied globally : - - - 2656 3.8 - - -
0.50/0.55 c applied locally : - - - 0 0.0 - - -
0.50/0.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.50/0.55 c cut pool : 0.00 17 - - 321 - (maximal pool size: 999)
0.50/0.55 c redcost : 0.00 18 0 0 0 0
0.50/0.55 c impliedbounds : 0.00 18 0 0 2 0
0.50/0.55 c intobj : 0.00 0 0 0 0 0
0.50/0.55 c gomory : 0.07 18 0 0 2956 0
0.50/0.55 c cgmip : 0.00 0 0 0 0 0
0.50/0.55 c closecuts : 0.00 0 0 0 0 0
0.50/0.55 c strongcg : 0.06 18 0 0 3231 0
0.50/0.55 c cmir : 0.01 10 0 0 1 0
0.50/0.55 c flowcover : 0.01 10 0 0 1 0
0.50/0.55 c clique : 0.00 18 0 0 121 0
0.50/0.55 c zerohalf : 0.00 0 0 0 0 0
0.50/0.55 c mcf : 0.00 1 0 0 0 0
0.50/0.55 c oddcycle : 0.00 0 0 0 0 0
0.50/0.55 c rapidlearning : 0.00 0 0 0 0 0
0.50/0.55 c Pricers : Time Calls Vars
0.50/0.55 c problem variables: 0.00 0 0
0.50/0.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.50/0.55 c relpscost : 0.14 1 0 0 0 0 2
0.50/0.55 c pscost : 0.00 0 0 0 0 0 0
0.50/0.55 c inference : 0.01 2837 0 0 0 0 5674
0.50/0.55 c mostinf : 0.00 0 0 0 0 0 0
0.50/0.55 c leastinf : 0.00 0 0 0 0 0 0
0.50/0.55 c fullstrong : 0.00 0 0 0 0 0 0
0.50/0.55 c allfullstrong : 0.00 0 0 0 0 0 0
0.50/0.55 c random : 0.00 0 0 0 0 0 0
0.50/0.55 c Primal Heuristics : Time Calls Found
0.50/0.55 c LP solutions : 0.00 - 0
0.50/0.55 c pseudo solutions : 0.00 - 5
0.50/0.55 c crossover : 0.00 0 0
0.50/0.55 c oneopt : 0.00 4 2
0.50/0.55 c trivial : 0.00 2 1
0.50/0.55 c shiftandpropagate: 0.00 0 0
0.50/0.55 c simplerounding : 0.00 19 0
0.50/0.55 c zirounding : 0.00 1 1
0.50/0.55 c rounding : 0.00 19 1
0.50/0.55 c shifting : 0.00 19 3
0.50/0.55 c intshifting : 0.00 0 0
0.50/0.55 c twoopt : 0.00 0 0
0.50/0.55 c fixandinfer : 0.00 0 0
0.50/0.55 c feaspump : 0.00 0 0
0.50/0.55 c clique : 0.00 0 0
0.50/0.55 c coefdiving : 0.00 0 0
0.50/0.55 c pscostdiving : 0.00 0 0
0.50/0.55 c fracdiving : 0.00 0 0
0.50/0.55 c veclendiving : 0.00 0 0
0.50/0.55 c intdiving : 0.00 0 0
0.50/0.55 c actconsdiving : 0.00 0 0
0.50/0.55 c objpscostdiving : 0.00 0 0
0.50/0.55 c rootsoldiving : 0.00 0 0
0.50/0.55 c linesearchdiving : 0.00 0 0
0.50/0.55 c guideddiving : 0.00 0 0
0.50/0.55 c octane : 0.00 0 0
0.50/0.55 c rens : 0.00 0 0
0.50/0.55 c rins : 0.00 0 0
0.50/0.55 c localbranching : 0.00 0 0
0.50/0.55 c mutation : 0.00 0 0
0.50/0.55 c dins : 0.00 0 0
0.50/0.55 c vbounds : 0.00 0 0
0.50/0.55 c undercover : 0.00 0 0
0.50/0.55 c subnlp : 0.00 0 0
0.50/0.55 c trysol : 0.00 0 0
0.50/0.55 c LP : Time Calls Iterations Iter/call Iter/sec
0.50/0.55 c primal LP : 0.00 0 0 0.00 -
0.50/0.55 c dual LP : 0.02 19 625 32.89 34059.95
0.50/0.55 c lex dual LP : 0.00 0 0 0.00 -
0.50/0.55 c barrier LP : 0.00 0 0 0.00 -
0.50/0.55 c diving/probing LP: 0.00 0 0 0.00 -
0.50/0.55 c strong branching : 0.14 30 4844 161.47 35124.87
0.50/0.55 c (at root node) : - 30 4844 161.47 -
0.50/0.55 c conflict analysis: 0.00 0 0 0.00 -
0.50/0.55 c B&B Tree :
0.50/0.55 c number of runs : 1
0.50/0.55 c nodes : 4793
0.50/0.55 c nodes (total) : 4793
0.50/0.55 c nodes left : 0
0.50/0.55 c max depth : 36
0.50/0.55 c max depth (total): 36
0.50/0.55 c backtracks : 880 (18.4%)
0.50/0.55 c delayed cutoffs : 876
0.50/0.55 c repropagations : 8032 (11025 domain reductions, 826 cutoffs)
0.50/0.55 c avg switch length: 4.25
0.50/0.55 c switching time : 0.03
0.50/0.55 c Solution :
0.50/0.55 c Solutions found : 13 (11 improvements)
0.50/0.55 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.50/0.55 c Primal Bound : -1.30000000000000e+01 (in run 1, after 2938 nodes, 0.47 seconds, depth 18, found by <relaxation>)
0.50/0.55 c Dual Bound : -1.30000000000000e+01
0.50/0.55 c Gap : 0.00 %
0.50/0.55 c Root Dual Bound : -1.40000000000000e+01
0.50/0.55 c Root Iterations : 625
0.50/0.55 c Time complete: 0.55.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
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-3452301-1307106352/watcher-3452301-1307106352 -o /tmp/evaluation-result-3452301-1307106352/solver-3452301-1307106352 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452301-1307106352.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.02 2.02 2.00 2/373 10426
/proc/meminfo: memFree=22656372/32951124 swapFree=37148216/67111528
[pid=10426] ppid=10424 vsize=15784 CPUtime=0 cores=1,3,5,7
/proc/10426/stat : 10426 (scip-2.0.1.4.li) R 10424 10426 9067 0 -1 4202496 2984 0 0 0 0 0 0 0 25 0 1 0 822235686 16162816 2680 33554432000 4194304 9128323 140736525718560 18446744073709551615 18446744073699065939 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10426/statm: 3946 2680 498 1205 0 2737 0
[startup+0.028065 s]
/proc/loadavg: 2.02 2.02 2.00 2/373 10426
/proc/meminfo: memFree=22656372/32951124 swapFree=37148216/67111528
[pid=10426] ppid=10424 vsize=17984 CPUtime=0.02 cores=1,3,5,7
/proc/10426/stat : 10426 (scip-2.0.1.4.li) R 10424 10426 9067 0 -1 4202496 3637 0 0 0 2 0 0 0 25 0 1 0 822235686 18415616 3329 33554432000 4194304 9128323 140736525718560 18446744073709551615 4780424 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10426/statm: 4496 3329 663 1205 0 3287 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 17984
[startup+0.10109 s]
/proc/loadavg: 2.02 2.02 2.00 2/373 10426
/proc/meminfo: memFree=22656372/32951124 swapFree=37148216/67111528
[pid=10426] ppid=10424 vsize=20380 CPUtime=0.09 cores=1,3,5,7
/proc/10426/stat : 10426 (scip-2.0.1.4.li) R 10424 10426 9067 0 -1 4202496 4221 0 0 0 9 0 0 0 25 0 1 0 822235686 20869120 3911 33554432000 4194304 9128323 140736525718560 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10426/statm: 5095 3911 666 1205 0 3886 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20380
[startup+0.301055 s]
/proc/loadavg: 2.02 2.02 2.00 2/373 10426
/proc/meminfo: memFree=22656372/32951124 swapFree=37148216/67111528
[pid=10426] ppid=10424 vsize=23096 CPUtime=0.29 cores=1,3,5,7
/proc/10426/stat : 10426 (scip-2.0.1.4.li) R 10424 10426 9067 0 -1 4202496 5627 0 0 0 28 1 0 0 25 0 1 0 822235686 23650304 4734 33554432000 4194304 9128323 140736525718560 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10426/statm: 5774 4734 690 1205 0 4565 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 23096
Solver just ended. Dumping a history of the last processes samples
[startup+0.501016 s]
/proc/loadavg: 2.02 2.02 2.00 2/373 10426
/proc/meminfo: memFree=22656372/32951124 swapFree=37148216/67111528
[pid=10426] ppid=10424 vsize=23096 CPUtime=0.5 cores=1,3,5,7
/proc/10426/stat : 10426 (scip-2.0.1.4.li) R 10424 10426 9067 0 -1 4202496 5640 0 0 0 48 2 0 0 25 0 1 0 822235686 23650304 4747 33554432000 4194304 9128323 140736525718560 18446744073709551615 6581872 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/10426/statm: 5774 4747 703 1205 0 4565 0
Current children cumulated CPU time (s) 0.5
Current children cumulated vsize (KiB) 23096
Child status: 0
Real time (s): 0.556699
CPU time (s): 0.556914
CPU user time (s): 0.534918
CPU system time (s): 0.021996
CPU usage (%): 100.039
Max. virtual memory (cumulated for all children) (KiB): 23096
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.534918
system time used= 0.021996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5649
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= 7
runsolver used 0.003999 second user time and 0.011998 second system time
The end