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-3730623-1338682217.opb>
0.00/0.01 c original problem has 495 variables (495 bin, 0 int, 0 impl, 0 cont) and 940 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.00/0.02 c (round 1) 66 del vars, 18 del conss, 5 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.02 c (round 2) 68 del vars, 138 del conss, 7 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.02 c (round 3) 70 del vars, 143 del conss, 9 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.00/0.02 c (round 4) 74 del vars, 149 del conss, 13 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.00/0.02 c (round 5) 88 del vars, 176 del conss, 22 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6316 impls, 0 clqs
0.00/0.02 c (round 6) 95 del vars, 198 del conss, 28 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6370 impls, 0 clqs
0.00/0.02 c (round 7) 104 del vars, 214 del conss, 32 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6480 impls, 0 clqs
0.00/0.02 c (round 8) 112 del vars, 236 del conss, 36 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6520 impls, 0 clqs
0.00/0.02 c (round 9) 119 del vars, 255 del conss, 40 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6584 impls, 0 clqs
0.00/0.02 c (round 10) 127 del vars, 272 del conss, 44 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6664 impls, 0 clqs
0.00/0.02 c (round 11) 140 del vars, 301 del conss, 51 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6797 impls, 0 clqs
0.00/0.02 c (round 12) 147 del vars, 325 del conss, 57 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6811 impls, 0 clqs
0.00/0.02 c (round 13) 155 del vars, 344 del conss, 64 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6823 impls, 0 clqs
0.00/0.02 c (round 14) 164 del vars, 362 del conss, 70 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6871 impls, 0 clqs
0.00/0.02 c (round 15) 166 del vars, 377 del conss, 72 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.00/0.02 c (round 16) 170 del vars, 383 del conss, 76 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.00/0.02 c (round 17) 177 del vars, 396 del conss, 82 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6965 impls, 0 clqs
0.00/0.02 c (round 18) 184 del vars, 417 del conss, 88 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7067 impls, 0 clqs
0.00/0.02 c (round 19) 195 del vars, 444 del conss, 93 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7191 impls, 0 clqs
0.00/0.02 c (round 20) 199 del vars, 464 del conss, 95 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7203 impls, 0 clqs
0.00/0.02 c (round 21) 205 del vars, 477 del conss, 97 chg bounds, 71 chg sides, 145 chg coeffs, 0 upgd conss, 7243 impls, 0 clqs
0.00/0.02 c (round 22) 212 del vars, 496 del conss, 99 chg bounds, 73 chg sides, 148 chg coeffs, 0 upgd conss, 7262 impls, 0 clqs
0.00/0.03 c (round 23) 225 del vars, 528 del conss, 104 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.00/0.03 c (round 24) 225 del vars, 549 del conss, 104 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.00/0.03 c (round 25) 225 del vars, 556 del conss, 104 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.00/0.03 c (round 26) 267 del vars, 563 del conss, 104 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.00/0.03 c presolving (27 rounds):
0.00/0.03 c 267 deleted vars, 563 deleted constraints, 104 tightened bounds, 0 added holes, 75 changed sides, 152 changed coefficients
0.00/0.03 c 7326 implications, 0 cliques
0.00/0.03 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 377 constraints
0.00/0.03 c 112 constraints of type <knapsack>
0.00/0.03 c 184 constraints of type <setppc>
0.00/0.03 c 81 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1790
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 94 | - |1997k| 0 | 84 | 228 | 377 | 228 | 377 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 147 | - |2400k| 0 | 85 | 228 | 656 | 228 | 403 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 218 | - |2472k| 0 | 101 | 228 | 656 | 228 | 440 | 63 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 279 | - |2518k| 0 | 98 | 228 | 656 | 228 | 486 | 109 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 356 | - |2555k| 0 | 112 | 228 | 656 | 228 | 522 | 145 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 482 | - |2590k| 0 | 112 | 228 | 656 | 228 | 565 | 188 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 2 | 482 | - |2591k| 0 | 112 | 228 | 656 | 228 | 565 | 188 | 0 | 15 | 0.000000e+00 | -- | Inf
2.28/2.39 c
2.28/2.39 c SCIP Status : problem is solved [infeasible]
2.28/2.39 c Solving Time (sec) : 2.38
2.28/2.39 c Solving Nodes : 401
2.28/2.39 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.28/2.39 c Dual Bound : +1.00000000000000e+20
2.28/2.39 c Gap : 0.00 %
2.28/2.39 s UNSATISFIABLE
2.28/2.39 c SCIP Status : problem is solved [infeasible]
2.28/2.39 c Solving Time : 2.38
2.28/2.39 c Original Problem :
2.28/2.39 c Problem name : HOME/instance-3730623-1338682217.opb
2.28/2.39 c Variables : 495 (495 binary, 0 integer, 0 implicit integer, 0 continuous)
2.28/2.39 c Constraints : 940 initial, 940 maximal
2.28/2.39 c Presolved Problem :
2.28/2.39 c Problem name : t_HOME/instance-3730623-1338682217.opb
2.28/2.39 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
2.28/2.39 c Constraints : 377 initial, 699 maximal
2.28/2.39 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.28/2.39 c trivial : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c dualfix : 0.00 1 0 0 0 0 0 0 0
2.28/2.39 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c implics : 0.00 0 116 0 0 0 0 0 0
2.28/2.39 c probing : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c setppc : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c linear : 0.01 104 46 0 104 0 563 75 152
2.28/2.39 c logicor : 0.00 0 0 0 0 0 0 0 0
2.28/2.39 c root node : - 37 - - 37 - - - -
2.28/2.39 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.28/2.39 c integral : 0 0 0 421 0 3 63 0 0 756
2.28/2.39 c knapsack : 112 5 894 0 0 7 524 532 0 0
2.28/2.39 c setppc : 184 5 887 0 0 4 507 0 0 0
2.28/2.39 c linear : 0+ 5 882 0 0 0 5 71 0 0
2.28/2.39 c logicor : 81+ 5 290 0 0 13 227 0 0 0
2.28/2.39 c countsols : 0 0 0 0 0 0 0 0 0 0
2.28/2.39 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.28/2.39 c integral : 1.91 0.00 0.00 1.91 0.00
2.28/2.39 c knapsack : 0.01 0.00 0.01 0.00 0.00
2.28/2.39 c setppc : 0.00 0.00 0.00 0.00 0.00
2.28/2.39 c linear : 0.01 0.00 0.01 0.00 0.00
2.28/2.39 c logicor : 0.00 0.00 0.00 0.00 0.00
2.28/2.39 c countsols : 0.00 0.00 0.00 0.00 0.00
2.28/2.39 c Propagators : Time Calls Cutoffs DomReds
2.28/2.39 c vbounds : 0.00 1 0 0
2.28/2.39 c rootredcost : 0.00 0 0 0
2.28/2.39 c pseudoobj : 0.00 0 0 0
2.28/2.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.28/2.39 c propagation : 0.00 24 24 46 6.6 8 3.9 -
2.28/2.39 c infeasible LP : 0.00 5 5 7 1.9 1 3.0 0
2.28/2.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.28/2.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.28/2.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.28/2.39 c applied globally : - - - 55 5.5 - - -
2.28/2.39 c applied locally : - - - 0 0.0 - - -
2.28/2.39 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.28/2.39 c cut pool : 0.00 4 - - 13 - (maximal pool size: 176)
2.28/2.39 c redcost : 0.00 386 0 0 0 0
2.28/2.39 c impliedbounds : 0.00 5 0 0 0 0
2.28/2.39 c intobj : 0.00 0 0 0 0 0
2.28/2.39 c cgmip : 0.00 0 0 0 0 0
2.28/2.39 c gomory : 0.02 5 0 0 678 0
2.28/2.39 c strongcg : 0.01 5 0 0 680 0
2.28/2.39 c cmir : 0.00 0 0 0 0 0
2.28/2.39 c flowcover : 0.00 0 0 0 0 0
2.28/2.39 c clique : 0.00 5 0 0 12 0
2.28/2.39 c zerohalf : 0.00 0 0 0 0 0
2.28/2.39 c mcf : 0.00 1 0 0 0 0
2.28/2.39 c rapidlearning : 0.08 1 0 0 0 279
2.28/2.39 c Pricers : Time Calls Vars
2.28/2.39 c problem variables: 0.00 0 0
2.28/2.39 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.28/2.39 c relpscost : 1.91 421 3 63 0 0 756
2.28/2.39 c pscost : 0.00 0 0 0 0 0 0
2.28/2.39 c inference : 0.00 0 0 0 0 0 0
2.28/2.39 c mostinf : 0.00 0 0 0 0 0 0
2.28/2.39 c leastinf : 0.00 0 0 0 0 0 0
2.28/2.39 c fullstrong : 0.00 0 0 0 0 0 0
2.28/2.39 c allfullstrong : 0.00 0 0 0 0 0 0
2.28/2.39 c random : 0.00 0 0 0 0 0 0
2.28/2.39 c Primal Heuristics : Time Calls Found
2.28/2.39 c LP solutions : 0.00 - 0
2.28/2.39 c pseudo solutions : 0.00 - 0
2.28/2.39 c trivial : 0.00 1 0
2.28/2.39 c simplerounding : 0.00 0 0
2.28/2.39 c zirounding : 0.00 0 0
2.28/2.39 c rounding : 0.00 0 0
2.28/2.39 c shifting : 0.00 0 0
2.28/2.39 c intshifting : 0.00 0 0
2.28/2.39 c oneopt : 0.00 0 0
2.28/2.39 c twoopt : 0.00 0 0
2.28/2.39 c fixandinfer : 0.00 0 0
2.28/2.39 c feaspump : 0.00 0 0
2.28/2.39 c coefdiving : 0.00 0 0
2.28/2.39 c pscostdiving : 0.00 0 0
2.28/2.39 c fracdiving : 0.00 0 0
2.28/2.39 c veclendiving : 0.00 0 0
2.28/2.39 c intdiving : 0.00 0 0
2.28/2.39 c actconsdiving : 0.00 0 0
2.28/2.39 c objpscostdiving : 0.00 0 0
2.28/2.39 c rootsoldiving : 0.00 0 0
2.28/2.39 c linesearchdiving : 0.00 0 0
2.28/2.39 c guideddiving : 0.00 0 0
2.28/2.39 c octane : 0.00 0 0
2.28/2.39 c rens : 0.00 0 0
2.28/2.39 c rins : 0.00 0 0
2.28/2.39 c localbranching : 0.00 0 0
2.28/2.39 c mutation : 0.00 0 0
2.28/2.39 c crossover : 0.00 0 0
2.28/2.39 c dins : 0.00 0 0
2.28/2.39 c undercover : 0.00 0 0
2.28/2.39 c nlp : 0.00 0 0
2.28/2.39 c trysol : 0.00 0 0
2.28/2.39 c LP : Time Calls Iterations Iter/call Iter/sec
2.28/2.39 c primal LP : 0.00 0 0 0.00 -
2.28/2.39 c dual LP : 0.26 430 5156 11.99 20064.83
2.28/2.39 c lex dual LP : 0.00 0 0 0.00 -
2.28/2.39 c barrier LP : 0.00 0 0 0.00 -
2.28/2.39 c diving/probing LP: 0.00 0 0 0.00 -
2.28/2.39 c strong branching : 1.90 1534 31622 20.61 16653.40
2.28/2.39 c (at root node) : - 15 648 43.20 -
2.28/2.39 c conflict analysis: 0.00 0 0 0.00 -
2.28/2.39 c B&B Tree :
2.28/2.39 c number of runs : 1
2.28/2.39 c nodes : 401
2.28/2.39 c nodes (total) : 401
2.28/2.39 c nodes left : 0
2.28/2.39 c max depth : 33
2.28/2.39 c max depth (total): 33
2.28/2.39 c backtracks : 38 (9.5%)
2.28/2.39 c delayed cutoffs : 356
2.28/2.39 c repropagations : 90 (223 domain reductions, 9 cutoffs)
2.28/2.39 c avg switch length: 3.22
2.28/2.39 c switching time : 0.01
2.28/2.39 c Solution :
2.28/2.39 c Solutions found : 0 (0 improvements)
2.28/2.39 c Primal Bound : infeasible
2.28/2.39 c Dual Bound : -
2.28/2.39 c Gap : 0.00 %
2.28/2.39 c Root Dual Bound : +0.00000000000000e+00
2.28/2.39 c Root Iterations : 482
2.28/2.39 c Time complete: 2.39.