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-3737951-1338719489.opb>
0.00/0.01 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.01/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11908 impls, 100 clqs
0.01/0.06 c presolving (2 rounds):
0.01/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.06 c 11908 implications, 100 cliques
0.01/0.06 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.01/0.06 c 1 constraints of type <knapsack>
0.01/0.06 c 150 constraints of type <setppc>
0.01/0.06 c 1476 constraints of type <and>
0.01/0.06 c 1 constraints of type <linear>
0.01/0.06 c transformed objective value is always integral (scale: 1)
0.01/0.06 c Presolving Time: 0.04
0.01/0.06 c - non default parameters ----------------------------------------------------------------------
0.01/0.06 c # SCIP version 1.2.1.3
0.01/0.06 c
0.01/0.06 c # frequency for displaying node information lines
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06 c display/freq = 10000
0.01/0.06 c
0.01/0.06 c # maximal time in seconds to run
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/time = 1790
0.01/0.06 c
0.01/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/memory = 13950
0.01/0.06 c
0.01/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c limits/solutions = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06 c separating/maxrounds = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/maxroundsroot = 5
0.01/0.06 c
0.01/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.06 c # [type: int, range: [1,2], default: 1]
0.01/0.06 c timing/clocktype = 2
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify inequalities
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/linear/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/indicator/addCouplingCons = TRUE
0.01/0.06 c
0.01/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06 c constraints/knapsack/disaggregation = FALSE
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify knapsacks
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c presolving/probing/maxrounds = 0
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/coefdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06 c heuristics/crossover/freq = -1
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/crossover/nodesofs = 750
0.01/0.06 c
0.01/0.06 c # number of nodes without incumbent change that heuristic should wait
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06 c heuristics/crossover/nwaitingnodes = 100
0.01/0.06 c
0.01/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06 c # [type: real, range: [0,1], default: 0.1]
0.01/0.06 c heuristics/crossover/nodesquot = 0.15
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixed
0.01/0.06 c # [type: real, range: [0,1], default: 0.666]
0.01/0.06 c heuristics/crossover/minfixingrate = 0.5
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/feaspump/freq = -1
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/fracdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/guideddiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/intshifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/linesearchdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/nlp/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/objpscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06 c # [type: real, range: [0,1], default: 0.01]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/oneopt/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/pscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/rens/freq = -1
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixable
0.01/0.06 c # [type: real, range: [0,1], default: 0.5]
0.01/0.06 c heuristics/rens/minfixingrate = 0.3
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/rens/nodesofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/rootsoldiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/rounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/shifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/simplerounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/trivial/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/trysol/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/veclendiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/zirounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/cmir/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/flowcover/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/rapidlearning/freq = 0
0.01/0.06 c
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c start solving
0.01/0.06 c
0.09/0.17 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.17 c 0.2s| 1 | 0 | 691 | - |7180k| 0 | 322 |1576 |1628 |1576 |3104 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.96 c 1.0s| 1 | 0 | 1017 | - |9299k| 0 | 344 |1576 |1941 |1576 |3132 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.57 c 1.6s| 1 | 0 | 1305 | - |9684k| 0 | 343 |1576 |1941 |1576 |3149 | 45 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.36 c 2.3s| 1 | 0 | 1734 | - | 10M| 0 | 307 |1576 |1941 |1576 |3163 | 59 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.93 c 2.9s| 1 | 0 | 1998 | - | 10M| 0 | 308 |1576 |1941 |1576 |3177 | 73 | 0 | 0 | 0.000000e+00 | -- | Inf
3.49/3.59 c 3.6s| 1 | 0 | 2204 | - | 11M| 0 | 276 |1576 |1941 |1576 |3187 | 83 | 0 | 0 | 0.000000e+00 | -- | Inf
6.39/6.41 c 6.4s| 1 | 2 | 2204 | - | 11M| 0 | 276 |1576 |1941 |1576 |3187 | 83 | 0 | 9 | 0.000000e+00 | -- | Inf
51.58/51.65 c
51.58/51.65 c SCIP Status : problem is solved [infeasible]
51.58/51.65 c Solving Time (sec) : 51.64
51.58/51.65 c Solving Nodes : 344
51.58/51.65 c Primal Bound : +1.00000000000000e+20 (0 solutions)
51.58/51.65 c Dual Bound : +1.00000000000000e+20
51.58/51.65 c Gap : 0.00 %
51.58/51.65 s UNSATISFIABLE
51.58/51.65 c SCIP Status : problem is solved [infeasible]
51.58/51.65 c Solving Time : 51.64
51.58/51.65 c Original Problem :
51.58/51.65 c Problem name : HOME/instance-3737951-1338719489.opb
51.58/51.65 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
51.58/51.65 c Constraints : 1628 initial, 1628 maximal
51.58/51.65 c Presolved Problem :
51.58/51.65 c Problem name : t_HOME/instance-3737951-1338719489.opb
51.58/51.65 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
51.58/51.65 c Constraints : 1628 initial, 1999 maximal
51.58/51.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
51.58/51.65 c trivial : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c dualfix : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c implics : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c probing : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c knapsack : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c setppc : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c and : 0.04 0 0 0 0 0 0 0 0
51.58/51.65 c linear : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c logicor : 0.00 0 0 0 0 0 0 0 0
51.58/51.65 c root node : - 139 - - 139 - - - -
51.58/51.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
51.58/51.65 c integral : 0 0 0 213 0 3 93 0 0 348
51.58/51.65 c knapsack : 1 5 1648 0 0 0 0 0 0 0
51.58/51.65 c setppc : 150 5 1648 0 0 0 711 0 0 0
51.58/51.65 c and : 1476 287 1648 0 0 0 23247 34978 0 0
51.58/51.65 c linear : 1+ 6 1648 0 0 0 25 0 0 0
51.58/51.65 c logicor : 0+ 0 316 0 0 1 242 0 0 0
51.58/51.65 c countsols : 0 0 0 0 0 0 0 0 0 0
51.58/51.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
51.58/51.65 c integral : 26.41 0.00 0.00 26.41 0.00
51.58/51.65 c knapsack : 0.00 0.00 0.00 0.00 0.00
51.58/51.65 c setppc : 0.00 0.00 0.00 0.00 0.00
51.58/51.65 c and : 0.10 0.06 0.05 0.00 0.00
51.58/51.65 c linear : 0.03 0.00 0.02 0.00 0.00
51.58/51.65 c logicor : 0.00 0.00 0.00 0.00 0.00
51.58/51.65 c countsols : 0.00 0.00 0.00 0.00 0.00
51.58/51.65 c Propagators : Time Calls Cutoffs DomReds
51.58/51.65 c vbounds : 0.00 1 0 0
51.58/51.65 c rootredcost : 0.00 0 0 0
51.58/51.65 c pseudoobj : 0.00 0 0 0
51.58/51.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
51.58/51.65 c propagation : 0.00 1 0 0 0.0 0 0.0 -
51.58/51.65 c infeasible LP : 0.02 167 163 527 11.2 1 3.0 0
51.58/51.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
51.58/51.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
51.58/51.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
51.58/51.65 c applied globally : - - - 241 9.2 - - -
51.58/51.65 c applied locally : - - - 0 0.0 - - -
51.58/51.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
51.58/51.65 c cut pool : 0.00 4 - - 1 - (maximal pool size: 527)
51.58/51.65 c redcost : 0.01 287 0 0 0 0
51.58/51.65 c impliedbounds : 0.00 5 0 0 83 0
51.58/51.65 c intobj : 0.00 0 0 0 0 0
51.58/51.65 c cgmip : 0.00 0 0 0 0 0
51.58/51.65 c gomory : 1.81 5 0 0 0 0
51.58/51.65 c strongcg : 0.85 5 0 0 2500 0
51.58/51.65 c cmir : 0.00 0 0 0 0 0
51.58/51.65 c flowcover : 0.00 0 0 0 0 0
51.58/51.65 c clique : 0.02 5 0 0 31 0
51.58/51.65 c zerohalf : 0.00 0 0 0 0 0
51.58/51.65 c mcf : 0.05 5 0 0 123 0
51.58/51.65 c rapidlearning : 0.20 1 0 0 0 313
51.58/51.65 c Pricers : Time Calls Vars
51.58/51.65 c problem variables: 0.00 0 0
51.58/51.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
51.58/51.65 c relpscost : 26.41 213 3 93 0 0 348
51.58/51.65 c pscost : 0.00 0 0 0 0 0 0
51.58/51.65 c inference : 0.00 0 0 0 0 0 0
51.58/51.65 c mostinf : 0.00 0 0 0 0 0 0
51.58/51.65 c leastinf : 0.00 0 0 0 0 0 0
51.58/51.65 c fullstrong : 0.00 0 0 0 0 0 0
51.58/51.65 c allfullstrong : 0.00 0 0 0 0 0 0
51.58/51.65 c random : 0.00 0 0 0 0 0 0
51.58/51.65 c Primal Heuristics : Time Calls Found
51.58/51.65 c LP solutions : 0.00 - 0
51.58/51.65 c pseudo solutions : 0.00 - 0
51.58/51.65 c trivial : 0.00 1 0
51.58/51.65 c simplerounding : 0.00 0 0
51.58/51.65 c zirounding : 0.00 0 0
51.58/51.65 c rounding : 0.00 0 0
51.58/51.65 c shifting : 0.00 0 0
51.58/51.65 c intshifting : 0.00 0 0
51.58/51.65 c oneopt : 0.00 0 0
51.58/51.65 c twoopt : 0.00 0 0
51.58/51.65 c fixandinfer : 0.00 0 0
51.58/51.65 c feaspump : 0.00 0 0
51.58/51.65 c coefdiving : 0.00 0 0
51.58/51.65 c pscostdiving : 0.00 0 0
51.58/51.65 c fracdiving : 0.00 0 0
51.58/51.65 c veclendiving : 0.00 0 0
51.58/51.65 c intdiving : 0.00 0 0
51.58/51.65 c actconsdiving : 0.00 0 0
51.58/51.65 c objpscostdiving : 0.00 0 0
51.58/51.65 c rootsoldiving : 0.00 0 0
51.58/51.65 c linesearchdiving : 0.00 0 0
51.58/51.65 c guideddiving : 0.00 0 0
51.58/51.65 c octane : 0.00 0 0
51.58/51.65 c rens : 0.00 0 0
51.58/51.65 c rins : 0.00 0 0
51.58/51.65 c localbranching : 0.00 0 0
51.58/51.65 c mutation : 0.00 0 0
51.58/51.65 c crossover : 0.00 0 0
51.58/51.65 c dins : 0.00 0 0
51.58/51.65 c undercover : 0.00 0 0
51.58/51.65 c nlp : 0.00 0 0
51.58/51.65 c trysol : 0.00 0 0
51.58/51.65 c LP : Time Calls Iterations Iter/call Iter/sec
51.58/51.65 c primal LP : 0.13 0 0 0.00 0.00
51.58/51.65 c dual LP : 21.61 665 139596 209.92 6459.09
51.58/51.65 c lex dual LP : 0.00 0 0 0.00 -
51.58/51.65 c barrier LP : 0.00 0 0 0.00 -
51.58/51.65 c diving/probing LP: 0.00 0 0 0.00 -
51.58/51.65 c strong branching : 26.40 843 177585 210.66 6727.95
51.58/51.65 c (at root node) : - 9 8164 907.11 -
51.58/51.65 c conflict analysis: 0.00 0 0 0.00 -
51.58/51.65 c B&B Tree :
51.58/51.65 c number of runs : 1
51.58/51.65 c nodes : 344
51.58/51.65 c nodes (total) : 344
51.58/51.65 c nodes left : 0
51.58/51.65 c max depth : 41
51.58/51.65 c max depth (total): 41
51.58/51.65 c backtracks : 68 (19.8%)
51.58/51.65 c delayed cutoffs : 5
51.58/51.65 c repropagations : 693 (4429 domain reductions, 1 cutoffs)
51.58/51.65 c avg switch length: 5.58
51.58/51.65 c switching time : 0.18
51.58/51.65 c Solution :
51.58/51.65 c Solutions found : 0 (0 improvements)
51.58/51.65 c Primal Bound : infeasible
51.58/51.65 c Dual Bound : -
51.58/51.65 c Gap : 0.00 %
51.58/51.65 c Root Dual Bound : +0.00000000000000e+00
51.58/51.65 c Root Iterations : 2204
51.58/51.66 c Time complete: 51.64.
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-3737951-1338719489/watcher-3737951-1338719489 -o /tmp/evaluation-result-3737951-1338719489/solver-3737951-1338719489 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3737951-1338719489.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: 1.92 1.98 1.96 3/176 2953
/proc/meminfo: memFree=28613580/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=9972 CPUtime=0 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 1717 0 0 0 0 0 0 0 20 0 1 0 338074615 10211328 1664 33554432000 4194304 8395647 140734162863632 140735815753976 7382157 0 0 4096 0 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 2493 1675 374 1026 0 1463 0
[startup+0.021774 s]
/proc/loadavg: 1.92 1.98 1.96 3/176 2953
/proc/meminfo: memFree=28613580/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=17652 CPUtime=0.01 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 3754 0 0 0 1 0 0 0 20 0 1 0 338074615 18075648 3346 33554432000 4194304 8395647 140734162863632 140735815753976 6347101 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 4413 3346 453 1026 0 3383 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 17652
[startup+0.100278 s]
/proc/loadavg: 1.92 1.98 1.96 3/176 2953
/proc/meminfo: memFree=28613580/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=26800 CPUtime=0.09 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 6184 0 0 0 9 0 0 0 20 0 1 0 338074615 27443200 5703 33554432000 4194304 8395647 140734162863632 140735815753976 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 6700 5703 563 1026 0 5670 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26800
[startup+0.300236 s]
/proc/loadavg: 1.92 1.98 1.96 3/176 2953
/proc/meminfo: memFree=28613580/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=27180 CPUtime=0.29 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 6357 0 0 0 28 1 0 0 20 0 1 0 338074615 27832320 5872 33554432000 4194304 8395647 140734162863632 140735815753976 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 6795 5872 589 1026 0 5765 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 27180
[startup+0.700226 s]
/proc/loadavg: 1.92 1.98 1.96 3/176 2953
/proc/meminfo: memFree=28613580/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=43356 CPUtime=0.69 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 10130 0 0 0 66 3 0 0 20 0 1 0 338074615 44396544 9645 33554432000 4194304 8395647 140734162863632 140734162858920 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 10839 9645 609 1026 0 9809 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 43356
[startup+1.50023 s]
/proc/loadavg: 1.92 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28571264/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=1.49 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11792 0 0 0 141 8 0 0 20 0 1 0 338074615 50671616 11250 33554432000 4194304 8395647 140734162863632 140734162858920 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11250 628 1026 0 11341 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 49484
[startup+3.10025 s]
/proc/loadavg: 1.92 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28570396/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=3.08 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11807 0 0 0 300 8 0 0 20 0 1 0 338074615 50671616 11265 33554432000 4194304 8395647 140734162863632 140734162858872 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11265 628 1026 0 11341 0
Current children cumulated CPU time (s) 3.08
Current children cumulated vsize (KiB) 49484
[startup+6.30022 s]
/proc/loadavg: 1.93 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28570148/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=6.29 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11883 0 0 0 619 10 0 0 20 0 1 0 338074615 50671616 11341 33554432000 4194304 8395647 140734162863632 140734162858504 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11341 628 1026 0 11341 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 49484
[startup+12.7002 s]
/proc/loadavg: 1.93 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28569288/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=12.69 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11888 0 0 0 1254 15 0 0 20 0 1 0 338074615 50671616 11653 33554432000 4194304 8395647 140734162863632 140734162858504 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11653 630 1026 0 11341 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 49484
[startup+25.5002 s]
/proc/loadavg: 1.95 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28568108/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=25.48 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11895 0 0 0 2524 24 0 0 20 0 1 0 338074615 50671616 11659 33554432000 4194304 8395647 140734162863632 140734162858888 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11659 632 1026 0 11341 0
Current children cumulated CPU time (s) 25.48
Current children cumulated vsize (KiB) 49484
[startup+51.1002 s]
/proc/loadavg: 1.96 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28567104/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=51.08 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11897 0 0 0 5067 41 0 0 20 0 1 0 338074615 50671616 11913 33554432000 4194304 8395647 140734162863632 140734162859144 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11913 632 1026 0 11341 0
Current children cumulated CPU time (s) 51.08
Current children cumulated vsize (KiB) 49484
Solver just ended. Dumping a history of the last processes samples
[startup+51.5002 s]
/proc/loadavg: 1.96 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28567104/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=51.47 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11897 0 0 0 5106 41 0 0 20 0 1 0 338074615 50671616 11913 33554432000 4194304 8395647 140734162863632 140734162859144 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11913 632 1026 0 11341 0
Current children cumulated CPU time (s) 51.47
Current children cumulated vsize (KiB) 49484
[startup+51.6002 s]
/proc/loadavg: 1.96 1.98 1.96 3/177 2954
/proc/meminfo: memFree=28567104/32873844 swapFree=7112/7112
[pid=2953] ppid=2951 vsize=49484 CPUtime=51.58 cores=0,2,4,6
/proc/2953/stat : 2953 (pbscip.linux.x8) R 2951 2953 2459 0 -1 4202496 11897 0 0 0 5117 41 0 0 20 0 1 0 338074615 50671616 11913 33554432000 4194304 8395647 140734162863632 140734162858760 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/2953/statm: 12371 11913 632 1026 0 11341 0
Current children cumulated CPU time (s) 51.58
Current children cumulated vsize (KiB) 49484
Child status: 0
Real time (s): 51.6672
CPU time (s): 51.6521
CPU user time (s): 51.2322
CPU system time (s): 0.419936
CPU usage (%): 99.9708
Max. virtual memory (cumulated for all children) (KiB): 49484
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 51.2322
system time used= 0.419936
maximum resident set size= 47660
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11902
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= 13
involuntary context switches= 72
runsolver used 0.093985 second user time and 0.207968 second system time
The end