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-3452913-1307068703.opb>
0.00/0.02 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.06 c presolving (4 rounds):
0.00/0.06 c 0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 242 implications, 22 cliques
0.00/0.06 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 22 constraints of type <setppc>
0.00/0.06 c 2420 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.04
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.0.1.4
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.07 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.07 c 0.1s| 1 | 0 | 76 | - |3626k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.15 c 0.2s| 1 | 0 | 90 | - |3932k| 0 | 43 | 231 |2491 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 105 | - |4378k| 0 | 46 | 231 |2491 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 111 | - |4673k| 0 | 45 | 231 |2491 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 129 | - |4940k| 0 | 46 | 231 |2491 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 151 | - |5210k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 2 | 151 | - |5211k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 12 | 0.000000e+00 | -- | Inf
42.09/42.14 c 42.1s| 10000 | 17 |215938 | 21.6 |7602k| 35 | 32 | 231 |7860 | 231 |2451 | 24 |7302 |2371 | 0.000000e+00 | -- | Inf
70.20/70.25 c 70.3s| 20000 | 25 |423638 | 21.2 |9375k| 45 | - | 231 | 11k| 231 |2451 | 24 | 14k|2879 | 0.000000e+00 | -- | Inf
96.30/96.39 c 96.4s| 30000 | 10 |626225 | 20.9 | 10M| 53 | - | 231 | 14k| 231 |2451 | 24 | 22k|3015 | 0.000000e+00 | -- | Inf
103.59/103.64 c
103.59/103.64 c SCIP Status : problem is solved [infeasible]
103.59/103.64 c Solving Time (sec) : 103.64
103.59/103.64 c Solving Nodes : 32482
103.59/103.64 c Primal Bound : +1.00000000000000e+20 (0 solutions)
103.59/103.64 c Dual Bound : +1.00000000000000e+20
103.59/103.64 c Gap : 0.00 %
103.59/103.64 s UNSATISFIABLE
103.59/103.64 c SCIP Status : problem is solved [infeasible]
103.59/103.64 c Total Time : 103.64
103.59/103.64 c solving : 103.64
103.59/103.64 c presolving : 0.04 (included in solving)
103.59/103.64 c reading : 0.02 (included in solving)
103.59/103.64 c Original Problem :
103.59/103.64 c Problem name : HOME/instance-3452913-1307068703.opb
103.59/103.64 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
103.59/103.64 c Constraints : 2707 initial, 2707 maximal
103.59/103.64 c Presolved Problem :
103.59/103.64 c Problem name : t_HOME/instance-3452913-1307068703.opb
103.59/103.64 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
103.59/103.64 c Constraints : 2443 initial, 15386 maximal
103.59/103.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
103.59/103.64 c trivial : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c implics : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c probing : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
103.59/103.64 c setppc : 0.00 0 0 0 0 0 121 0 0 0
103.59/103.64 c linear : 0.01 0 0 0 0 0 143 0 0 0
103.59/103.64 c logicor : 0.01 0 0 0 0 0 0 0 0 0
103.59/103.64 c root node : - 49 - - 49 - - - - -
103.59/103.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
103.59/103.64 c integral : 0 0 0 17228 0 1 0 67 1484 0 0 32748
103.59/103.64 c knapsack : 1 5 135817 0 0 0 13515 226 77691 0 0 0
103.59/103.64 c setppc : 22 5 135703 0 0 0 311715 892 188750 0 0 0
103.59/103.64 c linear : 0+ 5 104458 0 0 0 135 1 957 0 0 0
103.59/103.64 c logicor : 2420+ 5 60086 0 0 0 153340 306 197626 0 0 0
103.59/103.64 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
103.59/103.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
103.59/103.64 c integral : 18.21 0.00 0.00 18.21 0.00 0.00 0.00
103.59/103.64 c knapsack : 0.13 0.00 0.12 0.00 0.00 0.00 0.01
103.59/103.64 c setppc : 0.40 0.00 0.33 0.00 0.00 0.00 0.06
103.59/103.64 c linear : 0.07 0.00 0.06 0.00 0.00 0.00 0.00
103.59/103.64 c logicor : 2.59 0.00 2.48 0.00 0.00 0.00 0.11
103.59/103.64 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
103.59/103.64 c Propagators : #Propagate #Resprop Cutoffs DomReds
103.59/103.64 c vbounds : 0 0 0 0
103.59/103.64 c rootredcost : 0 0 0 0
103.59/103.64 c pseudoobj : 0 0 0 0
103.59/103.64 c Propagator Timings : TotalTime Propagate Resprop
103.59/103.64 c vbounds : 0.02 0.02 0.00
103.59/103.64 c rootredcost : 0.02 0.02 0.00
103.59/103.64 c pseudoobj : 0.01 0.01 0.00
103.59/103.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
103.59/103.64 c propagation : 0.05 1425 1424 6958 20.4 17 17.2 -
103.59/103.64 c infeasible LP : 1.06 14880 14810 84587 29.8 40 15.8 0
103.59/103.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
103.59/103.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
103.59/103.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
103.59/103.64 c applied globally : - - - 24444 19.1 - - -
103.59/103.64 c applied locally : - - - 102 31.7 - - -
103.59/103.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
103.59/103.64 c cut pool : 0.00 4 - - 121 - (maximal pool size: 503)
103.59/103.64 c redcost : 0.06 16475 0 0 0 0
103.59/103.64 c impliedbounds : 0.00 5 0 0 0 0
103.59/103.64 c intobj : 0.00 0 0 0 0 0
103.59/103.64 c gomory : 0.27 5 0 0 1251 0
103.59/103.64 c cgmip : 0.00 0 0 0 0 0
103.59/103.64 c closecuts : 0.00 0 0 0 0 0
103.59/103.64 c strongcg : 0.20 5 0 0 2342 0
103.59/103.64 c cmir : 0.00 0 0 0 0 0
103.59/103.64 c flowcover : 0.00 0 0 0 0 0
103.59/103.64 c clique : 0.00 5 0 0 0 0
103.59/103.64 c zerohalf : 0.00 0 0 0 0 0
103.59/103.64 c mcf : 0.00 1 0 0 0 0
103.59/103.64 c oddcycle : 0.00 0 0 0 0 0
103.59/103.64 c rapidlearning : 0.04 1 0 0 0 48
103.59/103.64 c Pricers : Time Calls Vars
103.59/103.64 c problem variables: 0.00 0 0
103.59/103.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
103.59/103.64 c relpscost : 18.20 17228 67 1484 0 0 32748
103.59/103.64 c pscost : 0.00 0 0 0 0 0 0
103.59/103.64 c inference : 0.00 0 0 0 0 0 0
103.59/103.64 c mostinf : 0.00 0 0 0 0 0 0
103.59/103.64 c leastinf : 0.00 0 0 0 0 0 0
103.59/103.64 c fullstrong : 0.00 0 0 0 0 0 0
103.59/103.64 c allfullstrong : 0.00 0 0 0 0 0 0
103.59/103.64 c random : 0.00 0 0 0 0 0 0
103.59/103.64 c Primal Heuristics : Time Calls Found
103.59/103.64 c LP solutions : 0.00 - 0
103.59/103.64 c pseudo solutions : 0.00 - 0
103.59/103.64 c trivial : 0.00 1 0
103.59/103.64 c shiftandpropagate: 0.00 0 0
103.59/103.64 c simplerounding : 0.00 0 0
103.59/103.64 c zirounding : 0.00 0 0
103.59/103.64 c rounding : 0.00 0 0
103.59/103.64 c shifting : 0.00 0 0
103.59/103.64 c intshifting : 0.00 0 0
103.59/103.64 c oneopt : 0.00 0 0
103.59/103.64 c twoopt : 0.00 0 0
103.59/103.64 c fixandinfer : 0.00 0 0
103.59/103.64 c feaspump : 0.00 0 0
103.59/103.64 c clique : 0.00 0 0
103.59/103.64 c coefdiving : 0.00 0 0
103.59/103.64 c pscostdiving : 0.00 0 0
103.59/103.64 c fracdiving : 0.00 0 0
103.59/103.64 c veclendiving : 0.00 0 0
103.59/103.64 c intdiving : 0.00 0 0
103.59/103.64 c actconsdiving : 0.00 0 0
103.59/103.64 c objpscostdiving : 0.00 0 0
103.59/103.64 c rootsoldiving : 0.00 0 0
103.59/103.64 c linesearchdiving : 0.00 0 0
103.59/103.64 c guideddiving : 0.00 0 0
103.59/103.64 c octane : 0.00 0 0
103.59/103.64 c rens : 0.00 0 0
103.59/103.64 c rins : 0.00 0 0
103.59/103.64 c localbranching : 0.00 0 0
103.59/103.64 c mutation : 0.00 0 0
103.59/103.64 c crossover : 0.00 0 0
103.59/103.64 c dins : 0.00 0 0
103.59/103.64 c vbounds : 0.00 0 0
103.59/103.64 c undercover : 0.00 0 0
103.59/103.64 c subnlp : 0.00 0 0
103.59/103.64 c trysol : 0.00 0 0
103.59/103.64 c LP : Time Calls Iterations Iter/call Iter/sec
103.59/103.64 c primal LP : 0.00 0 0 0.00 -
103.59/103.64 c dual LP : 73.28 32033 681155 21.26 9295.23
103.59/103.64 c lex dual LP : 0.00 0 0 0.00 -
103.59/103.64 c barrier LP : 0.00 0 0 0.00 -
103.59/103.64 c diving/probing LP: 0.00 0 0 0.00 -
103.59/103.64 c strong branching : 17.91 3081 159036 51.62 8879.43
103.59/103.64 c (at root node) : - 12 3324 277.00 -
103.59/103.64 c conflict analysis: 0.00 0 0 0.00 -
103.59/103.64 c B&B Tree :
103.59/103.64 c number of runs : 1
103.59/103.64 c nodes : 32482
103.59/103.64 c nodes (total) : 32482
103.59/103.64 c nodes left : 0
103.59/103.64 c max depth : 53
103.59/103.64 c max depth (total): 53
103.59/103.64 c backtracks : 3383 (10.4%)
103.59/103.64 c delayed cutoffs : 267
103.59/103.64 c repropagations : 61766 (68045 domain reductions, 264 cutoffs)
103.59/103.64 c avg switch length: 5.17
103.59/103.64 c switching time : 2.57
103.59/103.64 c Solution :
103.59/103.64 c Solutions found : 0 (0 improvements)
103.59/103.64 c Primal Bound : infeasible
103.59/103.64 c Dual Bound : -
103.59/103.64 c Gap : 0.00 %
103.59/103.64 c Root Dual Bound : +0.00000000000000e+00
103.59/103.64 c Root Iterations : 151
103.59/103.66 c Time complete: 103.65.
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-3452913-1307068703/watcher-3452913-1307068703 -o /tmp/evaluation-result-3452913-1307068703/solver-3452913-1307068703 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452913-1307068703.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 1.68 1.40 2/498 8387
/proc/meminfo: memFree=29099508/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=10868 CPUtime=0.01 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 1699 0 0 0 1 0 0 0 25 0 1 0 818469909 11128832 1652 33554432000 4194304 9128323 140733827888272 18446744073709551615 8057568 0 0 4096 0 0 0 0 17 3 0 0 0
/proc/8387/statm: 2717 1652 397 1205 0 1508 0
[startup+0.115776 s]
/proc/loadavg: 2.00 1.68 1.40 2/498 8387
/proc/meminfo: memFree=29099508/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=27432 CPUtime=0.1 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 6147 0 0 0 10 0 0 0 25 0 1 0 818469909 28090368 5802 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 6858 5802 657 1205 0 5649 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 27432
[startup+0.200766 s]
/proc/loadavg: 2.00 1.68 1.40 2/498 8387
/proc/meminfo: memFree=29099508/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40532 CPUtime=0.19 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9544 0 0 0 18 1 0 0 25 0 1 0 818469909 41504768 8844 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10133 8844 711 1205 0 8924 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 40532
[startup+0.300745 s]
/proc/loadavg: 2.00 1.68 1.40 2/498 8387
/proc/meminfo: memFree=29099508/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40632 CPUtime=0.29 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9567 0 0 0 28 1 0 0 25 0 1 0 818469909 41607168 8867 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10158 8867 711 1205 0 8949 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 40632
[startup+0.700674 s]
/proc/loadavg: 2.00 1.68 1.40 2/498 8387
/proc/meminfo: memFree=29099508/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=0.69 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9675 0 0 0 67 2 0 0 25 0 1 0 818469909 41844736 8975 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 8975 713 1205 0 9007 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40864
[startup+1.50054 s]
/proc/loadavg: 2.00 1.68 1.40 3/499 8388
/proc/meminfo: memFree=29065276/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=1.49 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9677 0 0 0 145 4 0 0 25 0 1 0 818469909 41844736 8977 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 8977 715 1205 0 9007 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 40864
[startup+3.10027 s]
/proc/loadavg: 2.00 1.68 1.40 3/499 8388
/proc/meminfo: memFree=29064292/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=3.09 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9682 0 0 0 300 9 0 0 25 0 1 0 818469909 41844736 8982 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 8982 715 1205 0 9007 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 40864
[startup+6.30076 s]
/proc/loadavg: 2.16 1.72 1.41 3/499 8388
/proc/meminfo: memFree=29063688/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=6.29 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9682 0 0 0 611 18 0 0 25 0 1 0 818469909 41844736 8982 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 8982 715 1205 0 9007 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 40864
[startup+12.7007 s]
/proc/loadavg: 2.15 1.72 1.41 3/499 8390
/proc/meminfo: memFree=29063200/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=12.69 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9716 0 0 0 1231 38 0 0 25 0 1 0 818469909 41844736 9016 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 9016 715 1205 0 9007 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 40864
[startup+25.5005 s]
/proc/loadavg: 2.11 1.74 1.42 3/499 8390
/proc/meminfo: memFree=29063812/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=25.49 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9716 0 0 0 2473 76 0 0 25 0 1 0 818469909 41844736 9016 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 9016 715 1205 0 9007 0
Current children cumulated CPU time (s) 25.49
Current children cumulated vsize (KiB) 40864
[startup+51.1012 s]
/proc/loadavg: 2.07 1.76 1.44 3/499 8390
/proc/meminfo: memFree=29064032/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=40864 CPUtime=51.09 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 9898 0 0 0 4958 151 0 0 25 0 1 0 818469909 41844736 9198 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10216 9198 715 1205 0 9007 0
Current children cumulated CPU time (s) 51.09
Current children cumulated vsize (KiB) 40864
[startup+102.301 s]
/proc/loadavg: 2.03 1.79 1.46 3/499 8392
/proc/meminfo: memFree=29060788/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=43212 CPUtime=102.3 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 10549 0 0 0 9936 294 0 0 25 0 1 0 818469909 44249088 9849 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10803 9849 715 1205 0 9594 0
Current children cumulated CPU time (s) 102.3
Current children cumulated vsize (KiB) 43212
Solver just ended. Dumping a history of the last processes samples
[startup+102.419 s]
/proc/loadavg: 2.03 1.79 1.46 3/499 8392
/proc/meminfo: memFree=29060788/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=43212 CPUtime=102.41 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 10549 0 0 0 9947 294 0 0 25 0 1 0 818469909 44249088 9849 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10803 9849 715 1205 0 9594 0
Current children cumulated CPU time (s) 102.41
Current children cumulated vsize (KiB) 43212
[startup+103.2 s]
/proc/loadavg: 2.03 1.79 1.46 3/499 8392
/proc/meminfo: memFree=29060788/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=43212 CPUtime=103.2 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 10559 0 0 0 10023 297 0 0 25 0 1 0 818469909 44249088 9859 33554432000 4194304 9128323 140733827888272 18446744073709551615 7342969 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10803 9859 715 1205 0 9594 0
Current children cumulated CPU time (s) 103.2
Current children cumulated vsize (KiB) 43212
[startup+103.6 s]
/proc/loadavg: 2.03 1.79 1.46 3/499 8392
/proc/meminfo: memFree=29060908/32951132 swapFree=57925096/67111528
[pid=8387] ppid=8385 vsize=43212 CPUtime=103.59 cores=1,3,5,7
/proc/8387/stat : 8387 (scip-2.0.1.4.li) R 8385 8387 7222 0 -1 4202496 10560 0 0 0 10061 298 0 0 25 0 1 0 818469909 44249088 9860 33554432000 4194304 9128323 140733827888272 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/8387/statm: 10803 9860 715 1205 0 9594 0
Current children cumulated CPU time (s) 103.59
Current children cumulated vsize (KiB) 43212
Child status: 0
Real time (s): 103.662
CPU time (s): 103.663
CPU user time (s): 100.675
CPU system time (s): 2.98854
CPU usage (%): 100.001
Max. virtual memory (cumulated for all children) (KiB): 43212
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 100.675
system time used= 2.98855
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10565
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= 139
runsolver used 0.482926 second user time and 1.22681 second system time
The end