0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3453264-1307092948.opb>
0.00/0.00 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 100
0.00/0.00 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c 50 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.00
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.01 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.01 c t 0.0s| 1 | 0 | 235 | - | 609k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 1.000000e+02 |5652.98%
0.00/0.01 o 33
0.00/0.01 c r 0.0s| 1 | 0 | 235 | - | 612k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.300000e+01 |1798.48%
0.00/0.01 o 32
0.00/0.01 c R 0.0s| 1 | 0 | 235 | - | 614k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.200000e+01 |1740.95%
0.00/0.01 o 31
0.00/0.01 c s 0.0s| 1 | 0 | 235 | - | 617k| 0 | 33 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.738229e+00 | 3.100000e+01 |1683.42%
0.00/0.02 c 0.0s| 1 | 0 | 287 | - | 701k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.100000e+01 |1648.28%
0.00/0.02 o 3
0.00/0.02 c b 0.0s| 1 | 0 | 287 | - | 704k| 0 | 27 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 1.773169e+00 | 3.000000e+00 | 69.19%
0.00/0.03 c 0.0s| 1 | 0 | 333 | - | 749k| 0 | 43 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.03 o 3
0.00/0.03 c s 0.0s| 1 | 0 | 333 | - | 752k| 0 | 43 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.03 c 0.0s| 1 | 0 | 350 | - | 758k| 0 | 44 | 100 | 50 | 100 | 53 | 3 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c 0.1s| 1 | 0 | 350 | - | 763k| 0 | - | 100 | 50 | 100 | 53 | 3 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.10 c (run 1, node 1) restarting after 26 global fixings of integer variables
0.09/0.10 c
0.09/0.10 c (restart) converted 3 cuts from the global cut pool into linear constraints
0.09/0.10 c
0.09/0.10 c presolving:
0.09/0.11 c (round 1) 26 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 3 upgd conss, 0 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 26 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 0 implications, 0 cliques
0.09/0.11 c presolved problem has 74 variables (74 bin, 0 int, 0 impl, 0 cont) and 53 constraints
0.09/0.11 c 3 constraints of type <knapsack>
0.09/0.11 c 50 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.01
0.09/0.11 c
0.09/0.11 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.11 c 0.1s| 1 | 0 | 379 | - | 682k| 0 | 23 | 74 | 53 | 74 | 53 | 0 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.11 c 0.1s| 1 | 0 | 424 | - | 768k| 0 | 42 | 74 | 53 | 74 | 54 | 1 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.12 o 3
0.09/0.12 c s 0.1s| 1 | 0 | 424 | - | 771k| 0 | 42 | 74 | 53 | 74 | 54 | 1 | 0 | 5 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.15 c 0.1s| 1 | 0 | 451 | - | 771k| 0 | 43 | 74 | 53 | 74 | 54 | 1 | 0 | 10 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.18 c 0.2s| 1 | 0 | 493 | - | 772k| 0 | 43 | 74 | 53 | 74 | 54 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.09/0.18 o 3
0.09/0.18 c s 0.2s| 1 | 0 | 493 | - | 775k| 0 | 43 | 74 | 53 | 74 | 54 | 1 | 0 | 15 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.20 c 0.2s| 1 | 0 | 493 | - | 775k| 0 | - | 74 | 53 | 74 | 54 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.20 c (run 2, node 1) restarting after 15 global fixings of integer variables
0.19/0.20 c
0.19/0.20 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.19/0.20 c
0.19/0.20 c presolving:
0.19/0.20 c (round 1) 15 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.19/0.20 c presolving (2 rounds):
0.19/0.20 c 15 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.20 c 0 implications, 0 cliques
0.19/0.20 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.19/0.20 c 4 constraints of type <knapsack>
0.19/0.20 c 50 constraints of type <logicor>
0.19/0.20 c transformed objective value is always integral (scale: 1)
0.19/0.20 c Presolving Time: 0.01
0.19/0.20 c
0.19/0.20 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.20 c 0.2s| 1 | 0 | 523 | - | 670k| 0 | 25 | 59 | 54 | 59 | 54 | 0 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.20 o 3
0.19/0.20 c s 0.2s| 1 | 0 | 523 | - | 673k| 0 | 25 | 59 | 54 | 59 | 54 | 0 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.21 c 0.2s| 1 | 0 | 545 | - | 752k| 0 | 34 | 59 | 54 | 59 | 55 | 1 | 0 | 20 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.22 c 0.2s| 1 | 0 | 599 | - | 755k| 0 | 36 | 59 | 54 | 59 | 55 | 1 | 0 | 25 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.24 c 0.2s| 1 | 0 | 651 | - | 757k| 0 | 32 | 59 | 54 | 59 | 55 | 1 | 0 | 30 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.24 c 0.2s| 1 | 0 | 651 | - | 758k| 0 | - | 59 | 54 | 59 | 55 | 1 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.24 c (run 3, node 1) restarting after 15 global fixings of integer variables
0.19/0.24 c
0.19/0.25 c presolving:
0.19/0.25 c (round 1) 15 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.19/0.25 c presolving (2 rounds):
0.19/0.25 c 15 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.25 c 0 implications, 0 cliques
0.19/0.25 c presolved problem has 44 variables (44 bin, 0 int, 0 impl, 0 cont) and 54 constraints
0.19/0.25 c 4 constraints of type <knapsack>
0.19/0.25 c 50 constraints of type <logicor>
0.19/0.25 c transformed objective value is always integral (scale: 1)
0.19/0.25 c Presolving Time: 0.01
0.19/0.25 c
0.19/0.25 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.25 c 0.2s| 1 | 0 | 702 | - | 651k| 0 | 24 | 44 | 54 | 44 | 54 | 0 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.25 o 3
0.19/0.25 c s 0.2s| 1 | 0 | 702 | - | 654k| 0 | 24 | 44 | 54 | 44 | 54 | 0 | 0 | 35 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.19/0.25 c 0.3s| 1 | 0 | 733 | - | 720k| 0 | - | 44 | 54 | 44 | 55 | 1 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.19/0.25 c 0.3s| 1 | 0 | 733 | - | 720k| 0 | - | 44 | 54 | 44 | 55 | 1 | 0 | 35 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.19/0.25 c
0.19/0.25 c SCIP Status : problem is solved [optimal solution found]
0.19/0.25 c Solving Time (sec) : 0.25
0.19/0.25 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.19/0.25 c Primal Bound : +3.00000000000000e+00 (26 solutions)
0.19/0.25 c Dual Bound : +3.00000000000000e+00
0.19/0.25 c Gap : 0.00 %
0.19/0.25 s OPTIMUM FOUND
0.19/0.25 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.19/0.25 v -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
0.19/0.25 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
0.19/0.25 v -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.19/0.25 c SCIP Status : problem is solved [optimal solution found]
0.19/0.25 c Total Time : 0.25
0.19/0.25 c solving : 0.25
0.19/0.25 c presolving : 0.01 (included in solving)
0.19/0.25 c reading : 0.00 (included in solving)
0.19/0.25 c Original Problem :
0.19/0.25 c Problem name : HOME/instance-3453264-1307092948.opb
0.19/0.25 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 50 initial, 50 maximal
0.19/0.25 c Presolved Problem :
0.19/0.25 c Problem name : t_HOME/instance-3453264-1307092948.opb
0.19/0.25 c Variables : 44 (44 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 54 initial, 54 maximal
0.19/0.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.25 c trivial : 0.00 56 0 0 0 0 0 0 0 0
0.19/0.25 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c root node : - 56 - - 56 - - - - -
0.19/0.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.25 c integral : 0 0 0 7 0 34 0 0 35 0 0 0
0.19/0.25 c knapsack : 4 3 7 0 0 0 0 0 0 2 0 0
0.19/0.25 c logicor : 50 7 43 0 0 26 0 0 0 0 0 0
0.19/0.25 c countsols : 0 0 0 0 0 29 0 0 0 0 0 0
0.19/0.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.25 c integral : 0.15 0.00 0.00 0.15 0.00 0.00 0.00
0.19/0.25 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.25 c vbounds : 0 0 0 0
0.19/0.25 c rootredcost : 0 0 0 0
0.19/0.25 c pseudoobj : 15 0 0 0
0.19/0.25 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.25 c vbounds : 0.00 0.00 0.00
0.19/0.25 c rootredcost : 0.00 0.00 0.00
0.19/0.25 c pseudoobj : 0.00 0.00 0.00
0.19/0.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.25 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c applied globally : - - - 0 0.0 - - -
0.19/0.25 c applied locally : - - - 0 0.0 - - -
0.19/0.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.25 c cut pool : 0.00 0 - - 0 - (maximal pool size: 44)
0.19/0.25 c redcost : 0.00 7 0 21 0 0
0.19/0.25 c impliedbounds : 0.00 7 0 0 0 0
0.19/0.25 c intobj : 0.00 0 0 0 0 0
0.19/0.25 c gomory : 0.01 7 0 0 0 0
0.19/0.25 c cgmip : 0.00 0 0 0 0 0
0.19/0.25 c closecuts : 0.00 0 0 0 0 0
0.19/0.25 c strongcg : 0.01 7 0 0 160 0
0.19/0.25 c cmir : 0.01 7 0 0 3 0
0.19/0.25 c flowcover : 0.01 7 0 0 1 0
0.19/0.25 c clique : 0.00 4 0 0 0 0
0.19/0.25 c zerohalf : 0.00 0 0 0 0 0
0.19/0.25 c mcf : 0.00 4 0 0 0 0
0.19/0.25 c oddcycle : 0.00 0 0 0 0 0
0.19/0.25 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.25 c Pricers : Time Calls Vars
0.19/0.25 c problem variables: 0.00 0 0
0.19/0.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.25 c relpscost : 0.15 7 0 35 0 0 0
0.19/0.25 c pscost : 0.00 0 0 0 0 0 0
0.19/0.25 c inference : 0.00 0 0 0 0 0 0
0.19/0.25 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.25 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.25 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c random : 0.00 0 0 0 0 0 0
0.19/0.25 c Primal Heuristics : Time Calls Found
0.19/0.25 c LP solutions : 0.00 - 0
0.19/0.25 c pseudo solutions : 0.00 - 0
0.19/0.25 c oneopt : 0.00 5 1
0.19/0.25 c trivial : 0.00 2 1
0.19/0.25 c shiftandpropagate: 0.00 0 0
0.19/0.25 c simplerounding : 0.00 13 13
0.19/0.25 c zirounding : 0.00 1 1
0.19/0.25 c rounding : 0.00 13 1
0.19/0.25 c shifting : 0.00 13 8
0.19/0.25 c intshifting : 0.00 0 0
0.19/0.25 c twoopt : 0.00 0 0
0.19/0.25 c fixandinfer : 0.00 0 0
0.19/0.25 c feaspump : 0.00 0 0
0.19/0.25 c clique : 0.00 0 0
0.19/0.25 c coefdiving : 0.00 0 0
0.19/0.25 c pscostdiving : 0.00 0 0
0.19/0.25 c fracdiving : 0.00 0 0
0.19/0.25 c veclendiving : 0.00 0 0
0.19/0.25 c intdiving : 0.00 0 0
0.19/0.25 c actconsdiving : 0.00 0 0
0.19/0.25 c objpscostdiving : 0.00 0 0
0.19/0.25 c rootsoldiving : 0.00 0 0
0.19/0.25 c linesearchdiving : 0.00 0 0
0.19/0.25 c guideddiving : 0.00 0 0
0.19/0.25 c octane : 0.00 0 0
0.19/0.25 c rens : 0.03 1 1
0.19/0.25 c rins : 0.00 0 0
0.19/0.25 c localbranching : 0.00 0 0
0.19/0.25 c mutation : 0.00 0 0
0.19/0.25 c crossover : 0.00 0 0
0.19/0.25 c dins : 0.00 0 0
0.19/0.25 c vbounds : 0.00 0 0
0.19/0.25 c undercover : 0.00 0 0
0.19/0.25 c subnlp : 0.00 0 0
0.19/0.25 c trysol : 0.00 0 0
0.19/0.25 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.25 c primal LP : 0.00 0 0 0.00 -
0.19/0.25 c dual LP : 0.02 14 733 52.36 33534.63
0.19/0.25 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.25 c barrier LP : 0.00 0 0 0.00 -
0.19/0.25 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.25 c strong branching : 0.15 35 5096 145.60 34037.32
0.19/0.25 c (at root node) : - 35 5096 145.60 -
0.19/0.25 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.25 c B&B Tree :
0.19/0.25 c number of runs : 4
0.19/0.25 c nodes : 1
0.19/0.25 c nodes (total) : 4
0.19/0.25 c nodes left : 0
0.19/0.25 c max depth : 0
0.19/0.25 c max depth (total): 0
0.19/0.25 c backtracks : 0 (0.0%)
0.19/0.25 c delayed cutoffs : 0
0.19/0.25 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.25 c avg switch length: 2.00
0.19/0.25 c switching time : 0.00
0.19/0.25 c Solution :
0.19/0.25 c Solutions found : 26 (10 improvements)
0.19/0.25 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.19/0.25 c Primal Bound : +3.00000000000000e+00 (in run 4, after 1 nodes, 0.25 seconds, depth 0, found by <shifting>)
0.19/0.25 c Dual Bound : +3.00000000000000e+00
0.19/0.25 c Gap : 0.00 %
0.19/0.25 c Root Dual Bound : +3.00000000000000e+00
0.19/0.25 c Root Iterations : 733
0.19/0.26 c Time complete: 0.25.
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-3453264-1307092948/watcher-3453264-1307092948 -o /tmp/evaluation-result-3453264-1307092948/solver-3453264-1307092948 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453264-1307092948.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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.06 2.03 2.00 4/428 22113
/proc/meminfo: memFree=29154180/32951124 swapFree=43324008/67111528
[pid=22113] ppid=22111 vsize=17556 CPUtime=0.01 cores=0,2,4,6
/proc/22113/stat : 22113 (scip-2.0.1.4.li) R 22111 22113 22076 0 -1 4202496 3460 0 0 0 1 0 0 0 24 0 1 0 820895223 17977344 3152 33554432000 4194304 9128323 140735852713168 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/22113/statm: 4389 3152 619 1205 0 3180 0
[startup+0.0626259 s]
/proc/loadavg: 2.06 2.03 2.00 4/428 22113
/proc/meminfo: memFree=29154180/32951124 swapFree=43324008/67111528
[pid=22113] ppid=22111 vsize=28920 CPUtime=0.05 cores=0,2,4,6
/proc/22113/stat : 22113 (scip-2.0.1.4.li) R 22111 22113 22076 0 -1 4202496 6107 0 0 0 5 0 0 0 24 0 1 0 820895223 29614080 5794 33554432000 4194304 9128323 140735852713168 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/22113/statm: 7230 5794 681 1205 0 6021 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 28920
[startup+0.100594 s]
/proc/loadavg: 2.06 2.03 2.00 4/428 22113
/proc/meminfo: memFree=29154180/32951124 swapFree=43324008/67111528
[pid=22113] ppid=22111 vsize=19104 CPUtime=0.09 cores=0,2,4,6
/proc/22113/stat : 22113 (scip-2.0.1.4.li) R 22111 22113 22076 0 -1 4202496 6141 0 0 0 9 0 0 0 24 0 1 0 820895223 19562496 3766 33554432000 4194304 9128323 140735852713168 18446744073709551615 7357741 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/22113/statm: 4776 3766 703 1205 0 3567 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19104
Solver just ended. Dumping a history of the last processes samples
[startup+0.200609 s]
/proc/loadavg: 2.06 2.03 2.00 4/428 22113
/proc/meminfo: memFree=29154180/32951124 swapFree=43324008/67111528
[pid=22113] ppid=22111 vsize=18944 CPUtime=0.19 cores=0,2,4,6
/proc/22113/stat : 22113 (scip-2.0.1.4.li) R 22111 22113 22076 0 -1 4202496 6155 0 0 0 18 1 0 0 25 0 1 0 820895223 19398656 3737 33554432000 4194304 9128323 140735852713168 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/22113/statm: 4736 3737 709 1205 0 3527 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 18944
Child status: 0
Real time (s): 0.262089
CPU time (s): 0.260959
CPU user time (s): 0.244962
CPU system time (s): 0.015997
CPU usage (%): 99.5689
Max. virtual memory (cumulated for all children) (KiB): 28920
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.244962
system time used= 0.015997
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6166
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= 4
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.014997 second system time
The end