0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691763-1338039124.opb>
0.19/0.28 c original problem has 28798 variables (28798 bin, 0 int, 0 impl, 0 cont) and 99736 constraints
0.19/0.28 c problem read in 0.28
0.19/0.28 c No objective function, only one solution is needed.
0.19/0.28 c presolving settings loaded
0.48/0.53 c presolving:
2.78/2.85 c (round 1) 8920 del vars, 25541 del conss, 0 add conss, 7135 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5265922 impls, 0 clqs
3.99/4.02 c (round 2) 16297 del vars, 57235 del conss, 0 add conss, 13927 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5320110 impls, 0 clqs
4.19/4.24 c (round 3) 18675 del vars, 68815 del conss, 0 add conss, 15373 chg bounds, 39 chg sides, 37 chg coeffs, 0 upgd conss, 5336796 impls, 0 clqs
4.30/4.36 c (round 4) 20018 del vars, 73486 del conss, 0 add conss, 16278 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5352147 impls, 0 clqs
4.39/4.44 c (round 5) 21065 del vars, 77209 del conss, 0 add conss, 16972 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5364129 impls, 0 clqs
4.39/4.50 c (round 6) 21619 del vars, 79271 del conss, 0 add conss, 17289 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5369765 impls, 0 clqs
4.49/4.53 c (round 7) 21941 del vars, 80582 del conss, 0 add conss, 17475 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5372943 impls, 0 clqs
4.49/4.56 c (round 8) 22064 del vars, 81132 del conss, 0 add conss, 17536 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5374415 impls, 0 clqs
4.49/4.59 c (round 9) 22119 del vars, 81338 del conss, 0 add conss, 17560 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5375191 impls, 0 clqs
4.58/4.61 c (round 10) 22143 del vars, 81458 del conss, 0 add conss, 17568 chg bounds, 58 chg sides, 58 chg coeffs, 0 upgd conss, 5375644 impls, 0 clqs
4.58/4.63 c (round 11) 22146 del vars, 81478 del conss, 0 add conss, 17569 chg bounds, 59 chg sides, 59 chg coeffs, 0 upgd conss, 5375708 impls, 0 clqs
4.58/4.65 c (round 12) 22146 del vars, 81480 del conss, 0 add conss, 17569 chg bounds, 60 chg sides, 60 chg coeffs, 0 upgd conss, 5375708 impls, 0 clqs
4.68/4.79 c (round 13) 22146 del vars, 81480 del conss, 0 add conss, 17569 chg bounds, 60 chg sides, 60 chg coeffs, 18257 upgd conss, 5375708 impls, 0 clqs
4.79/4.87 c (round 14) 22155 del vars, 81528 del conss, 0 add conss, 17578 chg bounds, 63 chg sides, 127 chg coeffs, 18257 upgd conss, 5377183 impls, 86 clqs
4.88/4.91 c (round 15) 22164 del vars, 81534 del conss, 0 add conss, 17578 chg bounds, 63 chg sides, 146 chg coeffs, 18257 upgd conss, 5377183 impls, 95 clqs
4.88/4.99 c (round 16) 22164 del vars, 90929 del conss, 2969 add conss, 17578 chg bounds, 63 chg sides, 156 chg coeffs, 18257 upgd conss, 5377183 impls, 95 clqs
4.98/5.08 c (round 17) 22164 del vars, 93380 del conss, 5420 add conss, 17578 chg bounds, 63 chg sides, 160 chg coeffs, 18257 upgd conss, 5377183 impls, 583 clqs
5.09/5.15 c presolving (18 rounds):
5.09/5.15 c 22164 deleted vars, 93380 deleted constraints, 5420 added constraints, 17578 tightened bounds, 0 added holes, 63 changed sides, 161 changed coefficients
5.09/5.15 c 5377183 implications, 3034 cliques
5.09/5.15 c presolved problem has 6634 variables (6634 bin, 0 int, 0 impl, 0 cont) and 11776 constraints
5.09/5.15 c 406 constraints of type <knapsack>
5.09/5.15 c 11332 constraints of type <setppc>
5.09/5.15 c 30 constraints of type <and>
5.09/5.15 c 8 constraints of type <logicor>
5.09/5.15 c transformed objective value is always integral (scale: 1)
5.09/5.15 c Presolving Time: 4.69
5.09/5.15 c - non default parameters ----------------------------------------------------------------------
5.09/5.15 c # SCIP version 2.1.1.4
5.09/5.15 c
5.09/5.15 c # maximal time in seconds to run
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.09/5.15 c limits/time = 1797
5.09/5.15 c
5.09/5.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.09/5.15 c limits/memory = 13950
5.09/5.15 c
5.09/5.15 c # solving stops, if the given number of solutions were found (-1: no limit)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: -1]
5.09/5.15 c limits/solutions = 1
5.09/5.15 c
5.09/5.15 c # maximal number of separation rounds per node (-1: unlimited)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 5]
5.09/5.15 c separating/maxrounds = 1
5.09/5.15 c
5.09/5.15 c # maximal number of separation rounds in the root node (-1: unlimited)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: -1]
5.09/5.15 c separating/maxroundsroot = 5
5.09/5.15 c
5.09/5.15 c # default clock type (1: CPU user seconds, 2: wall clock time)
5.09/5.15 c # [type: int, range: [1,2], default: 1]
5.09/5.15 c timing/clocktype = 2
5.09/5.15 c
5.09/5.15 c # belongs reading time to solving time?
5.09/5.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.09/5.15 c timing/reading = TRUE
5.09/5.15 c
5.09/5.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
5.09/5.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
5.09/5.15 c constraints/knapsack/disaggregation = FALSE
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/coefdiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/coefdiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/coefdiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 30]
5.09/5.15 c heuristics/crossover/freq = -1
5.09/5.15 c
5.09/5.15 c # number of nodes added to the contingent of the total nodes
5.09/5.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
5.09/5.15 c heuristics/crossover/nodesofs = 750
5.09/5.15 c
5.09/5.15 c # number of nodes without incumbent change that heuristic should wait
5.09/5.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
5.09/5.15 c heuristics/crossover/nwaitingnodes = 100
5.09/5.15 c
5.09/5.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
5.09/5.15 c # [type: real, range: [0,1], default: 0.1]
5.09/5.15 c heuristics/crossover/nodesquot = 0.15
5.09/5.15 c
5.09/5.15 c # minimum percentage of integer variables that have to be fixed
5.09/5.15 c # [type: real, range: [0,1], default: 0.666]
5.09/5.15 c heuristics/crossover/minfixingrate = 0.5
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 20]
5.09/5.15 c heuristics/feaspump/freq = -1
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/feaspump/maxlpiterofs = 2000
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/fracdiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/fracdiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/fracdiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/guideddiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/guideddiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/guideddiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/intdiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/intshifting/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/linesearchdiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 20]
5.09/5.15 c heuristics/objpscostdiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to total iteration number
5.09/5.15 c # [type: real, range: [0,1], default: 0.01]
5.09/5.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/oneopt/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/pscostdiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/pscostdiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c heuristics/rens/freq = -1
5.09/5.15 c
5.09/5.15 c # minimum percentage of integer variables that have to be fixable
5.09/5.15 c # [type: real, range: [0,1], default: 0.5]
5.09/5.15 c heuristics/rens/minfixingrate = 0.3
5.09/5.15 c
5.09/5.15 c # number of nodes added to the contingent of the total nodes
5.09/5.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
5.09/5.15 c heuristics/rens/nodesofs = 2000
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 20]
5.09/5.15 c heuristics/rootsoldiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
5.09/5.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/rounding/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c heuristics/shiftandpropagate/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/shifting/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/simplerounding/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/subnlp/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c heuristics/trivial/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/trysol/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c heuristics/undercover/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 10]
5.09/5.15 c heuristics/veclendiving/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal fraction of diving LP iterations compared to node LP iterations
5.09/5.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.09/5.15 c heuristics/veclendiving/maxlpiterquot = 0.075
5.09/5.15 c
5.09/5.15 c # additional number of allowed LP iterations
5.09/5.15 c # [type: int, range: [0,2147483647], default: 1000]
5.09/5.15 c heuristics/veclendiving/maxlpiterofs = 1500
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/zirounding/freq = -1
5.09/5.15 c
5.09/5.15 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: -1]
5.09/5.15 c propagating/probing/maxprerounds = 0
5.09/5.15 c
5.09/5.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c separating/cmir/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 0]
5.09/5.15 c separating/flowcover/freq = -1
5.09/5.15 c
5.09/5.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: -1]
5.09/5.15 c separating/rapidlearning/freq = 0
5.09/5.15 c
5.09/5.15 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
5.09/5.15 c # [type: int, range: [-1,2147483647], default: 1]
5.09/5.15 c heuristics/indoneopt/freq = -1
5.09/5.15 c
5.09/5.15 c -----------------------------------------------------------------------------------------------
5.09/5.15 c start solving
5.09/5.15 c
43.57/43.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
43.57/43.60 c 43.6s| 1 | 0 | 22586 | - | 145M| 0 | - |6634 | 11k|6634 | 11k| 0 | 0 | 0 | cutoff | -- | 0.00%
43.57/43.60 c 43.6s| 1 | 0 | 22586 | - | 145M| 0 | - |6634 | 11k|6634 | 11k| 0 | 0 | 0 | cutoff | -- | 0.00%
43.57/43.60 c
43.57/43.60 c SCIP Status : problem is solved [infeasible]
43.57/43.60 c Solving Time (sec) : 43.60
43.57/43.60 c Solving Nodes : 1
43.57/43.60 c Primal Bound : +1.00000000000000e+20 (0 solutions)
43.57/43.60 c Dual Bound : +1.00000000000000e+20
43.57/43.60 c Gap : 0.00 %
43.57/43.60 s UNSATISFIABLE
43.57/43.60 c SCIP Status : problem is solved [infeasible]
43.57/43.60 c Total Time : 43.60
43.57/43.60 c solving : 43.60
43.57/43.60 c presolving : 4.69 (included in solving)
43.57/43.60 c reading : 0.28 (included in solving)
43.57/43.60 c copying : 0.00 (0 times copied the problem)
43.57/43.60 c Original Problem :
43.57/43.60 c Problem name : HOME/instance-3691763-1338039124.opb
43.57/43.60 c Variables : 28798 (28798 binary, 0 integer, 0 implicit integer, 0 continuous)
43.57/43.60 c Constraints : 99736 initial, 99736 maximal
43.57/43.60 c Objective sense : minimize
43.57/43.60 c Presolved Problem :
43.57/43.60 c Problem name : t_HOME/instance-3691763-1338039124.opb
43.57/43.60 c Variables : 6634 (6634 binary, 0 integer, 0 implicit integer, 0 continuous)
43.57/43.60 c Constraints : 11776 initial, 11776 maximal
43.57/43.60 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
43.57/43.60 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c trivial : 0.02 0.00 744 0 0 0 0 0 0 0 0
43.57/43.60 c dualfix : 0.02 0.00 110 0 0 0 0 0 0 0 0
43.57/43.60 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c gateextraction : 0.05 0.00 0 0 0 0 0 9395 2969 0 0
43.57/43.60 c implics : 0.06 0.00 0 3 0 0 0 0 0 0 0
43.57/43.60 c components : 0.01 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
43.57/43.60 c knapsack : 0.07 0.00 0 0 0 9 0 0 0 3 101
43.57/43.60 c setppc : 0.12 0.00 6 0 0 0 0 45 0 0 0
43.57/43.60 c and : 0.06 0.00 0 0 0 0 0 2451 2451 0 0
43.57/43.60 c linear : 4.06 0.05 16859 4442 0 17569 0 81480 0 60 60
43.57/43.60 c logicor : 0.04 0.00 0 0 0 0 0 9 0 0 0
43.57/43.60 c root node : - - 0 - - 0 - - - - -
43.57/43.60 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
43.57/43.60 c integral : 0 0 0 0 0 0 0 0 0 0 0 0 0
43.57/43.60 c knapsack : 406 406 0 1 0 0 0 0 0 0 0 0 0
43.57/43.60 c setppc : 11332 11332 0 1 0 0 0 0 0 0 0 0 0
43.57/43.60 c and : 30 30 0 1 0 0 0 0 0 0 0 0 0
43.57/43.60 c logicor : 8 8 0 1 0 0 0 0 0 0 0 0 0
43.57/43.60 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
43.57/43.60 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
43.57/43.60 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c Propagators : #Propagate #ResProp Cutoffs DomReds
43.57/43.60 c rootredcost : 0 0 0 0
43.57/43.60 c pseudoobj : 0 0 0 0
43.57/43.60 c vbounds : 0 0 0 0
43.57/43.60 c redcost : 0 0 0 0
43.57/43.60 c probing : 0 0 0 0
43.57/43.60 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
43.57/43.60 c rootredcost : 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c vbounds : 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c redcost : 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c probing : 0.00 0.00 0.00 0.00 0.00
43.57/43.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
43.57/43.60 c propagation : 0.00 0 0 0 0.0 0 0.0 -
43.57/43.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
43.57/43.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
43.57/43.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
43.57/43.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
43.57/43.60 c applied globally : - - - 0 0.0 - - -
43.57/43.60 c applied locally : - - - 0 0.0 - - -
43.57/43.60 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
43.57/43.60 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
43.57/43.60 c clique : 0.00 0.00 0 0 0 0 0
43.57/43.60 c closecuts : 0.00 0.00 0 0 0 0 0
43.57/43.60 c cgmip : 0.00 0.00 0 0 0 0 0
43.57/43.60 c cmir : 0.00 0.00 0 0 0 0 0
43.57/43.60 c flowcover : 0.00 0.00 0 0 0 0 0
43.57/43.60 c gomory : 0.00 0.00 0 0 0 0 0
43.57/43.60 c impliedbounds : 0.00 0.00 0 0 0 0 0
43.57/43.60 c intobj : 0.00 0.00 0 0 0 0 0
43.57/43.60 c mcf : 0.00 0.00 0 0 0 0 0
43.57/43.60 c oddcycle : 0.00 0.00 0 0 0 0 0
43.57/43.60 c rapidlearning : 0.00 0.00 0 0 0 0 0
43.57/43.60 c strongcg : 0.00 0.00 0 0 0 0 0
43.57/43.60 c zerohalf : 0.00 0.00 0 0 0 0 0
43.57/43.60 c Pricers : ExecTime SetupTime Calls Vars
43.57/43.60 c problem variables: 0.00 - 0 0
43.57/43.60 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
43.57/43.60 c pscost : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c inference : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c mostinf : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c leastinf : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c fullstrong : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c random : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c relpscost : 0.00 0.00 0 0 0 0 0 0
43.57/43.60 c Primal Heuristics : ExecTime SetupTime Calls Found
43.57/43.60 c LP solutions : 0.00 - - 0
43.57/43.60 c pseudo solutions : 0.00 - - 0
43.57/43.60 c smallcard : 0.00 0.00 0 0
43.57/43.60 c trivial : 0.02 0.00 1 0
43.57/43.60 c shiftandpropagate: 0.00 0.00 0 0
43.57/43.60 c simplerounding : 0.00 0.00 0 0
43.57/43.60 c zirounding : 0.00 0.00 0 0
43.57/43.60 c rounding : 0.00 0.00 0 0
43.57/43.60 c shifting : 0.00 0.00 0 0
43.57/43.60 c intshifting : 0.00 0.00 0 0
43.57/43.60 c oneopt : 0.00 0.00 0 0
43.57/43.60 c twoopt : 0.00 0.00 0 0
43.57/43.60 c indtwoopt : 0.00 0.00 0 0
43.57/43.60 c indoneopt : 0.00 0.00 0 0
43.57/43.60 c fixandinfer : 0.00 0.00 0 0
43.57/43.60 c feaspump : 0.00 0.00 0 0
43.57/43.60 c clique : 0.00 0.00 0 0
43.57/43.60 c indrounding : 0.00 0.00 0 0
43.57/43.60 c indcoefdiving : 0.00 0.00 0 0
43.57/43.60 c coefdiving : 0.00 0.00 0 0
43.57/43.60 c pscostdiving : 0.00 0.00 0 0
43.57/43.60 c nlpdiving : 0.00 0.00 0 0
43.57/43.60 c fracdiving : 0.00 0.00 0 0
43.57/43.60 c veclendiving : 0.00 0.00 0 0
43.57/43.60 c intdiving : 0.00 0.00 0 0
43.57/43.60 c actconsdiving : 0.00 0.00 0 0
43.57/43.60 c objpscostdiving : 0.00 0.00 0 0
43.57/43.60 c rootsoldiving : 0.00 0.00 0 0
43.57/43.60 c linesearchdiving : 0.00 0.00 0 0
43.57/43.60 c guideddiving : 0.00 0.00 0 0
43.57/43.60 c octane : 0.00 0.00 0 0
43.57/43.60 c rens : 0.00 0.00 0 0
43.57/43.60 c rins : 0.00 0.00 0 0
43.57/43.60 c localbranching : 0.00 0.00 0 0
43.57/43.60 c mutation : 0.00 0.00 0 0
43.57/43.60 c crossover : 0.00 0.00 0 0
43.57/43.60 c dins : 0.00 0.00 0 0
43.57/43.60 c vbounds : 0.00 0.00 0 0
43.57/43.60 c undercover : 0.00 0.00 0 0
43.57/43.60 c subnlp : 0.00 0.00 0 0
43.57/43.60 c trysol : 0.00 0.00 0 0
43.57/43.60 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
43.57/43.60 c primal LP : 0.00 0 0 0.00 - 0.00 0
43.57/43.60 c dual LP : 38.42 1 22586 22586.00 587.92 0.00 0
43.57/43.60 c lex dual LP : 0.00 0 0 0.00 -
43.57/43.60 c barrier LP : 0.00 0 0 0.00 - 0.00 0
43.57/43.60 c diving/probing LP: 0.00 0 0 0.00 -
43.57/43.60 c strong branching : 0.00 0 0 0.00 -
43.57/43.60 c (at root node) : - 0 0 0.00 -
43.57/43.60 c conflict analysis: 0.00 0 0 0.00 -
43.57/43.60 c B&B Tree :
43.57/43.60 c number of runs : 1
43.57/43.60 c nodes : 1
43.57/43.60 c nodes (total) : 1
43.57/43.60 c nodes left : 0
43.57/43.60 c max depth : 0
43.57/43.60 c max depth (total): 0
43.57/43.60 c backtracks : 0 (0.0%)
43.57/43.60 c delayed cutoffs : 0
43.57/43.60 c repropagations : 0 (0 domain reductions, 0 cutoffs)
43.57/43.60 c avg switch length: 2.00
43.57/43.60 c switching time : 0.00
43.57/43.60 c Solution :
43.57/43.60 c Solutions found : 0 (0 improvements)
43.57/43.60 c Primal Bound : infeasible
43.57/43.60 c Dual Bound : -
43.57/43.60 c Gap : 0.00 %
43.57/43.60 c Root Dual Bound : -
43.57/43.60 c Root Iterations : 22586
43.68/43.78 c Time complete: 43.77.