0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3485774-1307751438.opb>
0.00/0.01 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 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.02 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.04 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.05 c presolving (4 rounds):
0.00/0.05 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.05 c 242 implications, 22 cliques
0.00/0.05 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.05 c 1 constraints of type <knapsack>
0.00/0.05 c 22 constraints of type <setppc>
0.00/0.05 c 2420 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.4
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1797
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/shiftandpropagate/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/subnlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/undercover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.06 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.06 c 0.1s| 1 | 0 | 76 | - |3626k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 90 | - |3928k| 0 | 43 | 231 |2491 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 105 | - |4374k| 0 | 46 | 231 |2491 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 111 | - |4666k| 0 | 45 | 231 |2491 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 129 | - |4932k| 0 | 46 | 231 |2491 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.6s| 1 | 0 | 151 | - |5202k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.94 c 0.9s| 1 | 2 | 151 | - |5203k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 12 | 0.000000e+00 | -- | Inf
39.50/39.51 c 39.5s| 10000 | 12 |217295 | 21.7 |7433k| 35 | - | 231 |7646 | 231 |2451 | 24 |7063 |2669 | 0.000000e+00 | -- | Inf
65.50/65.58 c 65.6s| 20000 | 57 |429222 | 21.5 |9496k| 37 | - | 231 | 12k| 231 |2451 | 24 | 14k|2677 | 0.000000e+00 | -- | Inf
96.80/96.89 c 96.9s| 30000 | 31 |653039 | 21.8 | 10M| 47 | 37 | 231 | 14k| 231 |2451 | 24 | 21k|3409 | 0.000000e+00 | -- | Inf
106.49/106.51 c
106.49/106.51 c SCIP Status : problem is solved [infeasible]
106.49/106.51 c Solving Time (sec) : 106.51
106.49/106.51 c Solving Nodes : 33105
106.49/106.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
106.49/106.51 c Dual Bound : +1.00000000000000e+20
106.49/106.51 c Gap : 0.00 %
106.49/106.51 s UNSATISFIABLE
106.49/106.51 c SCIP Status : problem is solved [infeasible]
106.49/106.51 c Total Time : 106.51
106.49/106.51 c solving : 106.51
106.49/106.51 c presolving : 0.03 (included in solving)
106.49/106.51 c reading : 0.02 (included in solving)
106.49/106.51 c Original Problem :
106.49/106.51 c Problem name : HOME/instance-3485774-1307751438.opb
106.49/106.51 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
106.49/106.51 c Constraints : 2707 initial, 2707 maximal
106.49/106.51 c Presolved Problem :
106.49/106.51 c Problem name : t_HOME/instance-3485774-1307751438.opb
106.49/106.51 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
106.49/106.51 c Constraints : 2443 initial, 15374 maximal
106.49/106.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
106.49/106.51 c trivial : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c implics : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c probing : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
106.49/106.51 c setppc : 0.00 0 0 0 0 0 121 0 0 0
106.49/106.51 c linear : 0.01 0 0 0 0 0 143 0 0 0
106.49/106.51 c logicor : 0.01 0 0 0 0 0 0 0 0 0
106.49/106.51 c root node : - 1 - - 1 - - - - -
106.49/106.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
106.49/106.51 c integral : 0 0 0 17471 0 1 0 55 1433 0 0 33310
106.49/106.51 c knapsack : 1 5 133077 0 0 0 7837 132 53678 0 0 0
106.49/106.51 c setppc : 22 5 133056 0 0 0 340606 597 188423 0 0 0
106.49/106.51 c linear : 0+ 5 105266 0 0 0 66 0 379 0 0 0
106.49/106.51 c logicor : 2420+ 5 61652 0 0 0 127259 215 195200 0 0 0
106.49/106.51 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
106.49/106.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
106.49/106.51 c integral : 16.86 0.00 0.00 16.86 0.00 0.00 0.00
106.49/106.51 c knapsack : 0.11 0.00 0.11 0.00 0.00 0.00 0.01
106.49/106.51 c setppc : 0.38 0.00 0.32 0.00 0.00 0.00 0.07
106.49/106.51 c linear : 0.06 0.00 0.06 0.00 0.00 0.00 0.00
106.49/106.51 c logicor : 2.76 0.00 2.67 0.00 0.00 0.00 0.08
106.49/106.51 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
106.49/106.51 c Propagators : #Propagate #Resprop Cutoffs DomReds
106.49/106.51 c vbounds : 0 0 0 0
106.49/106.51 c rootredcost : 0 0 0 0
106.49/106.51 c pseudoobj : 0 0 0 0
106.49/106.51 c Propagator Timings : TotalTime Propagate Resprop
106.49/106.51 c vbounds : 0.02 0.02 0.00
106.49/106.51 c rootredcost : 0.02 0.02 0.00
106.49/106.51 c pseudoobj : 0.01 0.01 0.00
106.49/106.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
106.49/106.51 c propagation : 0.02 944 941 4519 17.5 20 17.2 -
106.49/106.51 c infeasible LP : 1.12 15656 15601 90349 28.0 68 15.5 0
106.49/106.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
106.49/106.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
106.49/106.51 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
106.49/106.51 c applied globally : - - - 23892 17.5 - - -
106.49/106.51 c applied locally : - - - 215 32.6 - - -
106.49/106.51 c Separators : Time Calls Cutoffs DomReds Cuts Conss
106.49/106.51 c cut pool : 0.00 4 - - 121 - (maximal pool size: 501)
106.49/106.51 c redcost : 0.06 16750 0 0 0 0
106.49/106.51 c impliedbounds : 0.00 5 0 0 0 0
106.49/106.51 c intobj : 0.00 0 0 0 0 0
106.49/106.51 c gomory : 0.26 5 0 0 1251 0
106.49/106.51 c cgmip : 0.00 0 0 0 0 0
106.49/106.51 c closecuts : 0.00 0 0 0 0 0
106.49/106.51 c strongcg : 0.19 5 0 0 2342 0
106.49/106.51 c cmir : 0.00 0 0 0 0 0
106.49/106.51 c flowcover : 0.00 0 0 0 0 0
106.49/106.51 c clique : 0.00 5 0 0 0 0
106.49/106.51 c zerohalf : 0.00 0 0 0 0 0
106.49/106.51 c mcf : 0.00 1 0 0 0 0
106.49/106.51 c oddcycle : 0.00 0 0 0 0 0
106.49/106.51 c rapidlearning : 0.04 1 0 0 0 48
106.49/106.51 c Pricers : Time Calls Vars
106.49/106.51 c problem variables: 0.00 0 0
106.49/106.51 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
106.49/106.51 c relpscost : 16.85 17471 55 1433 0 0 33310
106.49/106.51 c pscost : 0.00 0 0 0 0 0 0
106.49/106.51 c inference : 0.00 0 0 0 0 0 0
106.49/106.51 c mostinf : 0.00 0 0 0 0 0 0
106.49/106.51 c leastinf : 0.00 0 0 0 0 0 0
106.49/106.51 c fullstrong : 0.00 0 0 0 0 0 0
106.49/106.51 c allfullstrong : 0.00 0 0 0 0 0 0
106.49/106.51 c random : 0.00 0 0 0 0 0 0
106.49/106.51 c Primal Heuristics : Time Calls Found
106.49/106.51 c LP solutions : 0.00 - 0
106.49/106.51 c pseudo solutions : 0.00 - 0
106.49/106.51 c trivial : 0.00 1 0
106.49/106.51 c shiftandpropagate: 0.00 0 0
106.49/106.51 c simplerounding : 0.00 0 0
106.49/106.51 c zirounding : 0.00 0 0
106.49/106.51 c rounding : 0.00 0 0
106.49/106.51 c shifting : 0.00 0 0
106.49/106.51 c intshifting : 0.00 0 0
106.49/106.51 c oneopt : 0.00 0 0
106.49/106.51 c twoopt : 0.00 0 0
106.49/106.51 c fixandinfer : 0.00 0 0
106.49/106.51 c feaspump : 0.00 0 0
106.49/106.51 c clique : 0.00 0 0
106.49/106.51 c coefdiving : 0.00 0 0
106.49/106.51 c pscostdiving : 0.00 0 0
106.49/106.51 c fracdiving : 0.00 0 0
106.49/106.51 c veclendiving : 0.00 0 0
106.49/106.51 c intdiving : 0.00 0 0
106.49/106.51 c actconsdiving : 0.00 0 0
106.49/106.51 c objpscostdiving : 0.00 0 0
106.49/106.51 c rootsoldiving : 0.00 0 0
106.49/106.51 c linesearchdiving : 0.00 0 0
106.49/106.51 c guideddiving : 0.00 0 0
106.49/106.51 c octane : 0.00 0 0
106.49/106.51 c rens : 0.00 0 0
106.49/106.51 c rins : 0.00 0 0
106.49/106.51 c localbranching : 0.00 0 0
106.49/106.51 c mutation : 0.00 0 0
106.49/106.51 c crossover : 0.00 0 0
106.49/106.51 c dins : 0.00 0 0
106.49/106.51 c vbounds : 0.00 0 0
106.49/106.51 c undercover : 0.00 0 0
106.49/106.51 c subnlp : 0.00 0 0
106.49/106.51 c trysol : 0.00 0 0
106.49/106.51 c LP : Time Calls Iterations Iter/call Iter/sec
106.49/106.51 c primal LP : 0.00 0 0 0.00 -
106.49/106.51 c dual LP : 76.62 33062 719682 21.77 9392.79
106.49/106.51 c lex dual LP : 0.00 0 0 0.00 -
106.49/106.51 c barrier LP : 0.00 0 0 0.00 -
106.49/106.51 c diving/probing LP: 0.00 0 0 0.00 -
106.49/106.51 c strong branching : 16.54 3644 145166 39.84 8777.44
106.49/106.51 c (at root node) : - 12 3659 304.92 -
106.49/106.51 c conflict analysis: 0.00 0 0 0.00 -
106.49/106.51 c B&B Tree :
106.49/106.51 c number of runs : 1
106.49/106.51 c nodes : 33105
106.49/106.51 c nodes (total) : 33105
106.49/106.51 c nodes left : 0
106.49/106.51 c max depth : 59
106.49/106.51 c max depth (total): 59
106.49/106.51 c backtracks : 3772 (11.4%)
106.49/106.51 c delayed cutoffs : 206
106.49/106.51 c repropagations : 57752 (75635 domain reductions, 205 cutoffs)
106.49/106.51 c avg switch length: 4.92
106.49/106.51 c switching time : 2.72
106.49/106.51 c Solution :
106.49/106.51 c Solutions found : 0 (0 improvements)
106.49/106.51 c Primal Bound : infeasible
106.49/106.51 c Dual Bound : -
106.49/106.51 c Gap : 0.00 %
106.49/106.51 c Root Dual Bound : +0.00000000000000e+00
106.49/106.51 c Root Iterations : 151
106.49/106.53 c Time complete: 106.52.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 988)
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-3485774-1307751438/watcher-3485774-1307751438 -o /tmp/evaluation-result-3485774-1307751438/solver-3485774-1307751438 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3485774-1307751438.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.01 1.97 1.46 3/177 4201
/proc/meminfo: memFree=31750880/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=9836 CPUtime=0 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 1472 0 0 0 0 0 0 0 25 0 1 0 965374522 10072064 1426 33554432000 4194304 8979876 140734756983808 18446744073709551615 7790414 0 0 4096 0 0 0 0 17 2 0 0 0
/proc/4201/statm: 2498 1438 363 1169 0 1325 0
[startup+0.077771 s]
/proc/loadavg: 2.01 1.97 1.46 3/177 4201
/proc/meminfo: memFree=31750880/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=25424 CPUtime=0.07 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 5603 0 0 0 7 0 0 0 25 0 1 0 965374522 26034176 5260 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 6356 5260 643 1169 0 5183 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 25424
[startup+0.100764 s]
/proc/loadavg: 2.01 1.97 1.46 3/177 4201
/proc/meminfo: memFree=31750880/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=26556 CPUtime=0.09 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 5979 0 0 0 9 0 0 0 25 0 1 0 965374522 27193344 5636 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 6639 5636 644 1169 0 5466 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26556
[startup+0.300728 s]
/proc/loadavg: 2.01 1.97 1.46 3/177 4201
/proc/meminfo: memFree=31750880/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40496 CPUtime=0.29 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9561 0 0 0 28 1 0 0 25 0 1 0 965374522 41467904 8863 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10124 8863 690 1169 0 8951 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 40496
[startup+0.700703 s]
/proc/loadavg: 2.01 1.97 1.46 3/177 4201
/proc/meminfo: memFree=31750880/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=0.69 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9671 0 0 0 68 1 0 0 25 0 1 0 965374522 41705472 8973 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 8973 693 1169 0 9009 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40728
[startup+1.50062 s]
/proc/loadavg: 2.01 1.97 1.46 3/178 4202
/proc/meminfo: memFree=31717796/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=1.49 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9671 0 0 0 147 2 0 0 25 0 1 0 965374522 41705472 8973 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 8973 693 1169 0 9009 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 40728
[startup+3.10033 s]
/proc/loadavg: 2.01 1.97 1.46 3/178 4202
/proc/meminfo: memFree=31717544/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=3.09 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9678 0 0 0 305 4 0 0 25 0 1 0 965374522 41705472 8980 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 8980 696 1169 0 9009 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 40728
[startup+6.30063 s]
/proc/loadavg: 2.00 1.97 1.47 3/178 4202
/proc/meminfo: memFree=31716864/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=6.29 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9678 0 0 0 620 9 0 0 25 0 1 0 965374522 41705472 8980 33554432000 4194304 8979876 140734756983808 18446744073709551615 7146140 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 8980 696 1169 0 9009 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 40728
[startup+12.7005 s]
/proc/loadavg: 2.00 1.97 1.47 3/178 4203
/proc/meminfo: memFree=31716500/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=12.69 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9711 0 0 0 1252 17 0 0 25 0 1 0 965374522 41705472 9013 33554432000 4194304 8979876 140734756983808 18446744073709551615 7179444 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 9013 696 1169 0 9009 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 40728
[startup+25.5001 s]
/proc/loadavg: 2.00 1.97 1.48 3/178 4203
/proc/meminfo: memFree=31716632/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=25.49 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9712 0 0 0 2517 32 0 0 25 0 1 0 965374522 41705472 9014 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 9014 696 1169 0 9009 0
Current children cumulated CPU time (s) 25.49
Current children cumulated vsize (KiB) 40728
[startup+51.1005 s]
/proc/loadavg: 2.00 1.97 1.49 3/178 4204
/proc/meminfo: memFree=31715904/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=40728 CPUtime=51.09 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 9929 0 0 0 5045 64 0 0 25 0 1 0 965374522 41705472 9231 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10182 9231 696 1169 0 9009 0
Current children cumulated CPU time (s) 51.09
Current children cumulated vsize (KiB) 40728
[startup+102.306 s]
/proc/loadavg: 2.00 1.97 1.51 3/178 4205
/proc/meminfo: memFree=31714476/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=42436 CPUtime=102.3 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 10373 0 0 0 10101 129 0 0 25 0 1 0 965374522 43454464 9675 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10609 9675 696 1169 0 9436 0
Current children cumulated CPU time (s) 102.3
Current children cumulated vsize (KiB) 42436
Solver just ended. Dumping a history of the last processes samples
[startup+103.901 s]
/proc/loadavg: 2.00 1.97 1.51 3/178 4205
/proc/meminfo: memFree=31714588/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=42436 CPUtime=103.9 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 10382 0 0 0 10258 132 0 0 25 0 1 0 965374522 43454464 9684 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10609 9684 696 1169 0 9436 0
Current children cumulated CPU time (s) 103.9
Current children cumulated vsize (KiB) 42436
[startup+105.5 s]
/proc/loadavg: 2.00 1.97 1.52 3/178 4205
/proc/meminfo: memFree=31714464/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=42580 CPUtime=105.49 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 10389 0 0 0 10415 134 0 0 25 0 1 0 965374522 43601920 9691 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10645 9691 696 1169 0 9472 0
Current children cumulated CPU time (s) 105.49
Current children cumulated vsize (KiB) 42580
[startup+106.3 s]
/proc/loadavg: 2.00 1.97 1.52 3/178 4205
/proc/meminfo: memFree=31714464/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=42756 CPUtime=106.29 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 10421 0 0 0 10494 135 0 0 25 0 1 0 965374522 43782144 9723 33554432000 4194304 8979876 140734756983808 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10689 9723 696 1169 0 9516 0
Current children cumulated CPU time (s) 106.29
Current children cumulated vsize (KiB) 42756
[startup+106.5 s]
/proc/loadavg: 2.00 1.97 1.52 3/178 4205
/proc/meminfo: memFree=31714464/32950928 swapFree=67051812/67111528
[pid=4201] ppid=4199 vsize=42756 CPUtime=106.49 cores=0,2,4,6
/proc/4201/stat : 4201 (scip-2.0.1.4_2.) R 4199 4201 3085 0 -1 4202496 10427 0 0 0 10513 136 0 0 25 0 1 0 965374522 43782144 9729 33554432000 4194304 8979876 140734756983808 18446744073709551615 6459976 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/4201/statm: 10689 9729 696 1169 0 9516 0
Current children cumulated CPU time (s) 106.49
Current children cumulated vsize (KiB) 42756
Child status: 0
Real time (s): 106.531
CPU time (s): 106.533
CPU user time (s): 105.167
CPU system time (s): 1.36579
CPU usage (%): 100.002
Max. virtual memory (cumulated for all children) (KiB): 42756
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 105.167
system time used= 1.36579
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10435
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= 8
involuntary context switches= 124
runsolver used 0.157975 second user time and 0.335948 second system time
The end