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-3733339-1338696436.opb>
0.00/0.00 c original problem has 106 variables (106 bin, 0 int, 0 impl, 0 cont) and 2 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted 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 106 variables (106 bin, 0 int, 0 impl, 0 cont) and 1 constraints
0.00/0.01 c 1 constraints of type <linear>
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 1.2.1.3
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 = 1790
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 # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
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 # 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 disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
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 # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/nlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
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 0.0s| 1 | 0 | 2 | - | 312k| 0 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 2 | 2 | - | 312k| 0 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.62 c 0.6s| 10000 | 983 | 7147 | 0.7 |1427k| 75 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.21 c 1.2s| 20000 | 2005 | 14242 | 0.7 |2306k| 75 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.80 c 1.8s| 30000 | 3031 | 21467 | 0.7 |3153k| 82 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.28/2.38 c 2.4s| 40000 | 3763 | 28295 | 0.7 |3840k| 82 | - | 106 | 1 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.97 c 3.0s| 50000 | 4617 | 35090 | 0.7 |4617k| 87 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.49/3.56 c 3.6s| 60000 | 5413 | 42015 | 0.7 |5350k| 87 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.09/4.14 c 4.1s| 70000 | 6177 | 48832 | 0.7 |5974k| 87 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.68/4.72 c 4.7s| 80000 | 7087 | 55705 | 0.7 |6704k| 87 | 1 | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
5.08/5.12 c * 5.1s| 86717 | 0 | 60263 | 0.7 | 377k| 87 | - | 106 | 1 | 106 | 1 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
5.08/5.12 c
5.08/5.12 c SCIP Status : problem is solved [optimal solution found]
5.08/5.12 c Solving Time (sec) : 5.12
5.08/5.12 c Solving Nodes : 86717
5.08/5.12 c Primal Bound : +0.00000000000000e+00 (1 solutions)
5.08/5.12 c Dual Bound : +0.00000000000000e+00
5.08/5.12 c Gap : 0.00 %
5.08/5.12 s SATISFIABLE
5.08/5.12 v -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
5.08/5.12 v -x81 -x80 -x79 -x78 -x77 x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
5.08/5.12 v -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32
5.08/5.12 v -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6
5.08/5.12 v -x5 -x4 -x3 -x2 x1
5.08/5.12 c SCIP Status : problem is solved [optimal solution found]
5.08/5.12 c Solving Time : 5.12
5.08/5.12 c Original Problem :
5.08/5.12 c Problem name : HOME/instance-3733339-1338696436.opb
5.08/5.12 c Variables : 106 (106 binary, 0 integer, 0 implicit integer, 0 continuous)
5.08/5.12 c Constraints : 2 initial, 2 maximal
5.08/5.12 c Presolved Problem :
5.08/5.12 c Problem name : t_HOME/instance-3733339-1338696436.opb
5.08/5.12 c Variables : 106 (106 binary, 0 integer, 0 implicit integer, 0 continuous)
5.08/5.12 c Constraints : 1 initial, 1 maximal
5.08/5.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.08/5.12 c trivial : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c implics : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c probing : 0.00 0 0 0 0 0 0 0 0
5.08/5.12 c linear : 0.00 0 0 0 0 0 1 0 0
5.08/5.12 c root node : - 0 - - 0 - - - -
5.08/5.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.08/5.12 c integral : 0 0 0 47139 0 0 0 0 0 94276
5.08/5.12 c linear : 1 1 97104 0 0 39578 344250 0 0 0
5.08/5.12 c countsols : 0 0 0 1 0 0 0 0 0 0
5.08/5.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.08/5.12 c integral : 0.22 0.00 0.00 0.22 0.00
5.08/5.12 c linear : 1.07 0.00 1.07 0.00 0.00
5.08/5.12 c countsols : 0.00 0.00 0.00 0.00 0.00
5.08/5.12 c Propagators : Time Calls Cutoffs DomReds
5.08/5.12 c vbounds : 0.07 1 0 0
5.08/5.12 c rootredcost : 0.06 0 0 0
5.08/5.12 c pseudoobj : 0.06 0 0 0
5.08/5.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.08/5.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.08/5.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.08/5.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.08/5.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.08/5.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.08/5.12 c applied globally : - - - 0 0.0 - - -
5.08/5.12 c applied locally : - - - 0 0.0 - - -
5.08/5.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.08/5.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.08/5.12 c redcost : 0.12 47139 0 0 0 0
5.08/5.12 c impliedbounds : 0.00 1 0 0 0 0
5.08/5.12 c intobj : 0.00 0 0 0 0 0
5.08/5.12 c cgmip : 0.00 0 0 0 0 0
5.08/5.12 c gomory : 0.00 1 0 0 0 0
5.08/5.12 c strongcg : 0.00 1 0 0 0 0
5.08/5.12 c cmir : 0.00 0 0 0 0 0
5.08/5.12 c flowcover : 0.00 0 0 0 0 0
5.08/5.12 c clique : 0.00 1 0 0 0 0
5.08/5.12 c zerohalf : 0.00 0 0 0 0 0
5.08/5.12 c mcf : 0.00 0 0 0 0 0
5.08/5.12 c rapidlearning : 0.01 1 0 0 0 0
5.08/5.12 c Pricers : Time Calls Vars
5.08/5.12 c problem variables: 0.00 0 0
5.08/5.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.08/5.12 c relpscost : 0.14 47138 0 0 0 0 94276
5.08/5.12 c pscost : 0.00 0 0 0 0 0 0
5.08/5.12 c inference : 0.00 0 0 0 0 0 0
5.08/5.12 c mostinf : 0.00 0 0 0 0 0 0
5.08/5.12 c leastinf : 0.00 0 0 0 0 0 0
5.08/5.12 c fullstrong : 0.00 0 0 0 0 0 0
5.08/5.12 c allfullstrong : 0.00 0 0 0 0 0 0
5.08/5.12 c random : 0.00 0 0 0 0 0 0
5.08/5.12 c Primal Heuristics : Time Calls Found
5.08/5.12 c LP solutions : 0.01 - 1
5.08/5.12 c pseudo solutions : 0.00 - 0
5.08/5.12 c trivial : 0.00 1 0
5.08/5.12 c simplerounding : 0.00 0 0
5.08/5.12 c zirounding : 0.00 0 0
5.08/5.12 c rounding : 0.00 0 0
5.08/5.12 c shifting : 0.00 0 0
5.08/5.12 c intshifting : 0.00 0 0
5.08/5.12 c oneopt : 0.00 0 0
5.08/5.12 c twoopt : 0.00 0 0
5.08/5.12 c fixandinfer : 0.00 0 0
5.08/5.12 c feaspump : 0.00 0 0
5.08/5.12 c coefdiving : 0.00 0 0
5.08/5.12 c pscostdiving : 0.00 0 0
5.08/5.12 c fracdiving : 0.00 0 0
5.08/5.12 c veclendiving : 0.00 0 0
5.08/5.12 c intdiving : 0.00 0 0
5.08/5.12 c actconsdiving : 0.00 0 0
5.08/5.12 c objpscostdiving : 0.00 0 0
5.08/5.12 c rootsoldiving : 0.00 0 0
5.08/5.12 c linesearchdiving : 0.00 0 0
5.08/5.12 c guideddiving : 0.00 0 0
5.08/5.12 c octane : 0.00 0 0
5.08/5.12 c rens : 0.00 0 0
5.08/5.12 c rins : 0.00 0 0
5.08/5.12 c localbranching : 0.00 0 0
5.08/5.12 c mutation : 0.00 0 0
5.08/5.12 c crossover : 0.00 0 0
5.08/5.12 c dins : 0.00 0 0
5.08/5.12 c undercover : 0.00 0 0
5.08/5.12 c nlp : 0.00 0 0
5.08/5.12 c trysol : 0.00 0 0
5.08/5.12 c LP : Time Calls Iterations Iter/call Iter/sec
5.08/5.12 c primal LP : 0.00 0 0 0.00 -
5.08/5.12 c dual LP : 1.14 47138 60263 1.28 52823.22
5.08/5.12 c lex dual LP : 0.00 0 0 0.00 -
5.08/5.12 c barrier LP : 0.00 0 0 0.00 -
5.08/5.12 c diving/probing LP: 0.00 0 0 0.00 -
5.08/5.12 c strong branching : 0.00 0 0 0.00 -
5.08/5.12 c (at root node) : - 0 0 0.00 -
5.08/5.12 c conflict analysis: 0.00 0 0 0.00 -
5.08/5.12 c B&B Tree :
5.08/5.12 c number of runs : 1
5.08/5.12 c nodes : 86717
5.08/5.12 c nodes (total) : 86717
5.08/5.12 c nodes left : 0
5.08/5.12 c max depth : 87
5.08/5.12 c max depth (total): 87
5.08/5.12 c backtracks : 6511 (7.5%)
5.08/5.12 c delayed cutoffs : 0
5.08/5.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.08/5.12 c avg switch length: 3.91
5.08/5.12 c switching time : 0.51
5.08/5.12 c Solution :
5.08/5.12 c Solutions found : 1 (1 improvements)
5.08/5.12 c First Solution : +0.00000000000000e+00 (in run 1, after 86717 nodes, 5.11 seconds, depth 32, found by <relaxation>)
5.08/5.12 c Primal Bound : +0.00000000000000e+00 (in run 1, after 86717 nodes, 5.11 seconds, depth 32, found by <relaxation>)
5.08/5.12 c Dual Bound : +0.00000000000000e+00
5.08/5.12 c Gap : 0.00 %
5.08/5.12 c Root Dual Bound : +0.00000000000000e+00
5.08/5.12 c Root Iterations : 2
5.08/5.13 c Time complete: 5.11.
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-3733339-1338696436/watcher-3733339-1338696436 -o /tmp/evaluation-result-3733339-1338696436/solver-3733339-1338696436 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3733339-1338696436.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.00 2.00 2.00 3/176 23571
/proc/meminfo: memFree=26761436/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=8944 CPUtime=0 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 1313 0 0 0 0 0 0 0 20 0 1 0 335772168 9158656 1259 33554432000 4194304 8395647 140736231992752 140736509538104 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 2236 1265 374 1026 0 1206 0
[startup+0.0874219 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 23571
/proc/meminfo: memFree=26761436/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=0.07 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4607 0 0 0 7 0 0 0 20 0 1 0 335772168 22351872 4200 33554432000 4194304 8395647 140736231992752 140736509538104 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4200 579 1026 0 4427 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 21828
[startup+0.100326 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 23571
/proc/meminfo: memFree=26761436/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=0.09 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4607 0 0 0 9 0 0 0 20 0 1 0 335772168 22351872 4200 33554432000 4194304 8395647 140736231992752 140736509538104 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4200 579 1026 0 4427 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 21828
[startup+0.300232 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 23571
/proc/meminfo: memFree=26761436/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=0.29 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4609 0 0 0 28 1 0 0 20 0 1 0 335772168 22351872 4202 33554432000 4194304 8395647 140736231992752 140736509538104 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4202 579 1026 0 4427 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 21828
[startup+0.700228 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 23571
/proc/meminfo: memFree=26761436/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=0.69 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4611 0 0 0 67 2 0 0 20 0 1 0 335772168 22351872 4204 33554432000 4194304 8395647 140736231992752 140736509538104 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4204 579 1026 0 4427 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 21828
[startup+1.50023 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 23572
/proc/meminfo: memFree=26746796/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=1.49 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4617 0 0 0 145 4 0 0 20 0 1 0 335772168 22351872 4210 33554432000 4194304 8395647 140736231992752 140736231988360 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4210 579 1026 0 4427 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 21828
[startup+3.10024 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 23572
/proc/meminfo: memFree=26746052/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=3.08 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4702 0 0 0 300 8 0 0 20 0 1 0 335772168 22351872 4295 33554432000 4194304 8395647 140736231992752 140736231988360 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4295 579 1026 0 4427 0
Current children cumulated CPU time (s) 3.08
Current children cumulated vsize (KiB) 21828
Solver just ended. Dumping a history of the last processes samples
[startup+3.90023 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 23572
/proc/meminfo: memFree=26746052/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=3.89 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4820 0 0 0 378 11 0 0 20 0 1 0 335772168 22351872 4413 33554432000 4194304 8395647 140736231992752 140736231988360 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4413 579 1026 0 4427 0
Current children cumulated CPU time (s) 3.89
Current children cumulated vsize (KiB) 21828
[startup+4.70023 s]
/proc/loadavg: 2.00 2.00 2.00 5/177 23572
/proc/meminfo: memFree=26744688/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=4.68 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4963 0 0 0 455 13 0 0 20 0 1 0 335772168 22351872 4556 33554432000 4194304 8395647 140736231992752 140736231988360 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4556 579 1026 0 4427 0
Current children cumulated CPU time (s) 4.68
Current children cumulated vsize (KiB) 21828
[startup+5.10024 s]
/proc/loadavg: 2.00 2.00 2.00 5/177 23572
/proc/meminfo: memFree=26744688/32873844 swapFree=7628/7628
[pid=23571] ppid=23569 vsize=21828 CPUtime=5.08 cores=1,3,5,7
/proc/23571/stat : 23571 (pbscip.linux.x8) R 23569 23571 20882 0 -1 4202496 4966 0 0 0 494 14 0 0 20 0 1 0 335772168 22351872 4559 33554432000 4194304 8395647 140736231992752 140736231988360 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/23571/statm: 5457 4559 579 1026 0 4427 0
Current children cumulated CPU time (s) 5.08
Current children cumulated vsize (KiB) 21828
Child status: 0
Real time (s): 5.1308
CPU time (s): 5.12822
CPU user time (s): 4.97824
CPU system time (s): 0.149977
CPU usage (%): 99.9497
Max. virtual memory (cumulated for all children) (KiB): 21828
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.97824
system time used= 0.149977
maximum resident set size= 18248
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4972
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= 6
runsolver used 0.008998 second user time and 0.026995 second system time
The end