0.00/0.00 c SCIP version 2.0.1.5 [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-3739634-1338736497.opb>
0.48/0.55 c original problem has 28798 variables (28798 bin, 0 int, 0 impl, 0 cont) and 99736 constraints
0.48/0.55 c problem read
0.48/0.56 c No objective function, only one solution is needed.
0.48/0.56 c presolving settings loaded
0.69/0.78 c presolving:
3.20/3.21 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
4.19/4.27 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.39/4.42 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.49/4.51 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.49/4.56 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.49/4.59 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.59/4.61 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.78/4.82 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.78/4.82 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.78/4.82 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.78/4.82 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.78/4.82 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.78/4.82 c (round 13) 22146 del vars, 81480 del conss, 0 add conss, 17569 chg bounds, 60 chg sides, 60 chg coeffs, 18256 upgd conss, 5375708 impls, 0 clqs
4.78/4.82 c (round 14) 22155 del vars, 81528 del conss, 0 add conss, 17578 chg bounds, 63 chg sides, 127 chg coeffs, 18256 upgd conss, 5377183 impls, 86 clqs
4.78/4.84 c (round 15) 22164 del vars, 81531 del conss, 0 add conss, 17578 chg bounds, 63 chg sides, 146 chg coeffs, 18256 upgd conss, 5377183 impls, 95 clqs
4.78/4.87 c presolving (16 rounds):
4.78/4.87 c 22164 deleted vars, 81531 deleted constraints, 0 added constraints, 17578 tightened bounds, 0 added holes, 63 changed sides, 156 changed coefficients
4.78/4.87 c 5377183 implications, 95 cliques
4.78/4.87 c presolved problem has 6634 variables (6634 bin, 0 int, 0 impl, 0 cont) and 18205 constraints
4.78/4.87 c 406 constraints of type <knapsack>
4.78/4.87 c 14818 constraints of type <setppc>
4.78/4.87 c 2981 constraints of type <logicor>
4.78/4.87 c transformed objective value is always integral (scale: 1)
4.78/4.87 c Presolving Time: 4.15
4.78/4.87 c - non default parameters ----------------------------------------------------------------------
4.78/4.87 c # SCIP version 2.0.1.5
4.78/4.87 c
4.78/4.87 c # frequency for displaying node information lines
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 100]
4.78/4.87 c display/freq = 10000
4.78/4.87 c
4.78/4.87 c # maximal time in seconds to run
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.78/4.87 c limits/time = 1797
4.78/4.87 c
4.78/4.87 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.78/4.87 c limits/memory = 13950
4.78/4.87 c
4.78/4.87 c # solving stops, if the given number of solutions were found (-1: no limit)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: -1]
4.78/4.87 c limits/solutions = 1
4.78/4.87 c
4.78/4.87 c # maximal number of separation rounds per node (-1: unlimited)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 5]
4.78/4.87 c separating/maxrounds = 1
4.78/4.87 c
4.78/4.87 c # maximal number of separation rounds in the root node (-1: unlimited)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: -1]
4.78/4.87 c separating/maxroundsroot = 5
4.78/4.87 c
4.78/4.87 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.78/4.87 c # [type: int, range: [1,2], default: 1]
4.78/4.87 c timing/clocktype = 2
4.78/4.87 c
4.78/4.87 c # belongs reading time to solving time?
4.78/4.87 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.78/4.87 c timing/reading = TRUE
4.78/4.87 c
4.78/4.87 c # should presolving try to simplify inequalities
4.78/4.87 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.78/4.87 c constraints/linear/simplifyinequalities = TRUE
4.78/4.87 c
4.78/4.87 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.78/4.87 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.78/4.87 c constraints/indicator/addCouplingCons = TRUE
4.78/4.87 c
4.78/4.87 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.78/4.87 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.78/4.87 c constraints/knapsack/disaggregation = FALSE
4.78/4.87 c
4.78/4.87 c # should presolving try to simplify knapsacks
4.78/4.87 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.78/4.87 c constraints/knapsack/simplifyinequalities = TRUE
4.78/4.87 c
4.78/4.87 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: -1]
4.78/4.87 c presolving/probing/maxrounds = 0
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/coefdiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/coefdiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/coefdiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 30]
4.78/4.87 c heuristics/crossover/freq = -1
4.78/4.87 c
4.78/4.87 c # number of nodes added to the contingent of the total nodes
4.78/4.87 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.78/4.87 c heuristics/crossover/nodesofs = 750
4.78/4.87 c
4.78/4.87 c # number of nodes without incumbent change that heuristic should wait
4.78/4.87 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.78/4.87 c heuristics/crossover/nwaitingnodes = 100
4.78/4.87 c
4.78/4.87 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.78/4.87 c # [type: real, range: [0,1], default: 0.1]
4.78/4.87 c heuristics/crossover/nodesquot = 0.15
4.78/4.87 c
4.78/4.87 c # minimum percentage of integer variables that have to be fixed
4.78/4.87 c # [type: real, range: [0,1], default: 0.666]
4.78/4.87 c heuristics/crossover/minfixingrate = 0.5
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 20]
4.78/4.87 c heuristics/feaspump/freq = -1
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/feaspump/maxlpiterofs = 2000
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/fracdiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/fracdiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/fracdiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/guideddiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/guideddiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/guideddiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/intdiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/intshifting/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/linesearchdiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 20]
4.78/4.87 c heuristics/objpscostdiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to total iteration number
4.78/4.87 c # [type: real, range: [0,1], default: 0.01]
4.78/4.87 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/oneopt/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/pscostdiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/pscostdiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c heuristics/rens/freq = -1
4.78/4.87 c
4.78/4.87 c # minimum percentage of integer variables that have to be fixable
4.78/4.87 c # [type: real, range: [0,1], default: 0.5]
4.78/4.87 c heuristics/rens/minfixingrate = 0.3
4.78/4.87 c
4.78/4.87 c # number of nodes added to the contingent of the total nodes
4.78/4.87 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.78/4.87 c heuristics/rens/nodesofs = 2000
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 20]
4.78/4.87 c heuristics/rootsoldiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.78/4.87 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/rounding/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c heuristics/shiftandpropagate/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/shifting/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/simplerounding/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/subnlp/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c heuristics/trivial/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/trysol/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c heuristics/undercover/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 10]
4.78/4.87 c heuristics/veclendiving/freq = -1
4.78/4.87 c
4.78/4.87 c # maximal fraction of diving LP iterations compared to node LP iterations
4.78/4.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.78/4.87 c heuristics/veclendiving/maxlpiterquot = 0.075
4.78/4.87 c
4.78/4.87 c # additional number of allowed LP iterations
4.78/4.87 c # [type: int, range: [0,2147483647], default: 1000]
4.78/4.87 c heuristics/veclendiving/maxlpiterofs = 1500
4.78/4.87 c
4.78/4.87 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 1]
4.78/4.87 c heuristics/zirounding/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c separating/cmir/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: 0]
4.78/4.87 c separating/flowcover/freq = -1
4.78/4.87 c
4.78/4.87 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.78/4.87 c # [type: int, range: [-1,2147483647], default: -1]
4.78/4.87 c separating/rapidlearning/freq = 0
4.78/4.87 c
4.78/4.87 c -----------------------------------------------------------------------------------------------
4.78/4.87 c start solving
4.78/4.87 c
33.68/33.75 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
33.68/33.75 c 33.7s| 1 | 0 | 23975 | - | 140M| 0 | - |6634 | 18k|6634 | 18k| 0 | 0 | 0 | cutoff | -- | 0.00%
33.68/33.75 c 33.7s| 1 | 0 | 23975 | - | 140M| 0 | - |6634 | 18k|6634 | 18k| 0 | 0 | 0 | cutoff | -- | 0.00%
33.68/33.75 c
33.68/33.75 c SCIP Status : problem is solved [infeasible]
33.68/33.75 c Solving Time (sec) : 33.75
33.68/33.75 c Solving Nodes : 1
33.68/33.75 c Primal Bound : +1.00000000000000e+20 (0 solutions)
33.68/33.75 c Dual Bound : +1.00000000000000e+20
33.68/33.75 c Gap : 0.00 %
33.68/33.75 s UNSATISFIABLE
33.68/33.75 c SCIP Status : problem is solved [infeasible]
33.68/33.75 c Total Time : 33.75
33.68/33.75 c solving : 33.75
33.68/33.75 c presolving : 4.15 (included in solving)
33.68/33.75 c reading : 0.55 (included in solving)
33.68/33.75 c Original Problem :
33.68/33.75 c Problem name : HOME/instance-3739634-1338736497.opb
33.68/33.75 c Variables : 28798 (28798 binary, 0 integer, 0 implicit integer, 0 continuous)
33.68/33.75 c Constraints : 99736 initial, 99736 maximal
33.68/33.75 c Presolved Problem :
33.68/33.75 c Problem name : t_HOME/instance-3739634-1338736497.opb
33.68/33.75 c Variables : 6634 (6634 binary, 0 integer, 0 implicit integer, 0 continuous)
33.68/33.75 c Constraints : 18205 initial, 18205 maximal
33.68/33.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
33.68/33.75 c trivial : 0.01 744 0 0 0 0 0 0 0 0
33.68/33.75 c dualfix : 0.02 110 0 0 0 0 0 0 0 0
33.68/33.75 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
33.68/33.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
33.68/33.75 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
33.68/33.75 c implics : 0.06 0 3 0 0 0 0 0 0 0
33.68/33.75 c probing : 0.00 0 0 0 0 0 0 0 0 0
33.68/33.75 c knapsack : 0.05 0 0 0 9 0 0 0 3 96
33.68/33.75 c setppc : 0.03 6 0 0 0 0 45 0 0 0
33.68/33.75 c linear : 3.79 16859 4442 0 17569 0 81480 0 60 60
33.68/33.75 c logicor : 0.03 0 0 0 0 0 6 0 0 0
33.68/33.75 c root node : - 0 - - 0 - - - - -
33.68/33.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
33.68/33.75 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
33.68/33.75 c knapsack : 406 0 1 0 0 0 0 0 0 0 0 0
33.68/33.75 c setppc : 14818 0 1 0 0 0 0 0 0 0 0 0
33.68/33.75 c logicor : 2981 0 1 0 0 0 0 0 0 0 0 0
33.68/33.75 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
33.68/33.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
33.68/33.75 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
33.68/33.75 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
33.68/33.75 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
33.68/33.75 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
33.68/33.75 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
33.68/33.75 c Propagators : #Propagate #Resprop Cutoffs DomReds
33.68/33.75 c vbounds : 0 0 0 0
33.68/33.75 c rootredcost : 0 0 0 0
33.68/33.75 c pseudoobj : 0 0 0 0
33.68/33.75 c Propagator Timings : TotalTime Propagate Resprop
33.68/33.75 c vbounds : 0.00 0.00 0.00
33.68/33.75 c rootredcost : 0.00 0.00 0.00
33.68/33.75 c pseudoobj : 0.00 0.00 0.00
33.68/33.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
33.68/33.75 c propagation : 0.00 0 0 0 0.0 0 0.0 -
33.68/33.75 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
33.68/33.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
33.68/33.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
33.68/33.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
33.68/33.75 c applied globally : - - - 0 0.0 - - -
33.68/33.75 c applied locally : - - - 0 0.0 - - -
33.68/33.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
33.68/33.75 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
33.68/33.75 c redcost : 0.00 0 0 0 0 0
33.68/33.75 c impliedbounds : 0.00 0 0 0 0 0
33.68/33.75 c intobj : 0.00 0 0 0 0 0
33.68/33.75 c gomory : 0.00 0 0 0 0 0
33.68/33.75 c cgmip : 0.00 0 0 0 0 0
33.68/33.75 c closecuts : 0.00 0 0 0 0 0
33.68/33.75 c strongcg : 0.00 0 0 0 0 0
33.68/33.75 c cmir : 0.00 0 0 0 0 0
33.68/33.75 c flowcover : 0.00 0 0 0 0 0
33.68/33.75 c clique : 0.00 0 0 0 0 0
33.68/33.75 c zerohalf : 0.00 0 0 0 0 0
33.68/33.75 c mcf : 0.00 0 0 0 0 0
33.68/33.75 c oddcycle : 0.00 0 0 0 0 0
33.68/33.75 c rapidlearning : 0.00 0 0 0 0 0
33.68/33.75 c Pricers : Time Calls Vars
33.68/33.75 c problem variables: 0.00 0 0
33.68/33.75 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
33.68/33.75 c pscost : 0.00 0 0 0 0 0 0
33.68/33.75 c inference : 0.00 0 0 0 0 0 0
33.68/33.75 c mostinf : 0.00 0 0 0 0 0 0
33.68/33.75 c leastinf : 0.00 0 0 0 0 0 0
33.68/33.75 c fullstrong : 0.00 0 0 0 0 0 0
33.68/33.75 c allfullstrong : 0.00 0 0 0 0 0 0
33.68/33.75 c random : 0.00 0 0 0 0 0 0
33.68/33.75 c relpscost : 0.00 0 0 0 0 0 0
33.68/33.75 c Primal Heuristics : Time Calls Found
33.68/33.75 c LP solutions : 0.00 - 0
33.68/33.75 c pseudo solutions : 0.00 - 0
33.68/33.75 c trivial : 0.02 1 0
33.68/33.75 c shiftandpropagate: 0.00 0 0
33.68/33.75 c simplerounding : 0.00 0 0
33.68/33.75 c zirounding : 0.00 0 0
33.68/33.75 c rounding : 0.00 0 0
33.68/33.75 c shifting : 0.00 0 0
33.68/33.75 c intshifting : 0.00 0 0
33.68/33.75 c oneopt : 0.00 0 0
33.68/33.75 c twoopt : 0.00 0 0
33.68/33.75 c fixandinfer : 0.00 0 0
33.68/33.75 c feaspump : 0.00 0 0
33.68/33.75 c clique : 0.00 0 0
33.68/33.75 c coefdiving : 0.00 0 0
33.68/33.75 c pscostdiving : 0.00 0 0
33.68/33.75 c fracdiving : 0.00 0 0
33.68/33.75 c veclendiving : 0.00 0 0
33.68/33.75 c intdiving : 0.00 0 0
33.68/33.75 c actconsdiving : 0.00 0 0
33.68/33.75 c objpscostdiving : 0.00 0 0
33.68/33.75 c rootsoldiving : 0.00 0 0
33.68/33.75 c linesearchdiving : 0.00 0 0
33.68/33.75 c guideddiving : 0.00 0 0
33.68/33.75 c octane : 0.00 0 0
33.68/33.75 c rens : 0.00 0 0
33.68/33.75 c rins : 0.00 0 0
33.68/33.75 c localbranching : 0.00 0 0
33.68/33.75 c mutation : 0.00 0 0
33.68/33.75 c crossover : 0.00 0 0
33.68/33.75 c dins : 0.00 0 0
33.68/33.75 c vbounds : 0.00 0 0
33.68/33.75 c undercover : 0.00 0 0
33.68/33.75 c subnlp : 0.00 0 0
33.68/33.75 c trysol : 0.00 0 0
33.68/33.75 c LP : Time Calls Iterations Iter/call Iter/sec
33.68/33.75 c primal LP : 0.00 0 0 0.00 -
33.68/33.75 c dual LP : 28.83 1 23975 23975.00 831.63
33.68/33.75 c lex dual LP : 0.00 0 0 0.00 -
33.68/33.75 c barrier LP : 0.00 0 0 0.00 -
33.68/33.75 c diving/probing LP: 0.00 0 0 0.00 -
33.68/33.75 c strong branching : 0.00 0 0 0.00 -
33.68/33.75 c (at root node) : - 0 0 0.00 -
33.68/33.75 c conflict analysis: 0.00 0 0 0.00 -
33.68/33.75 c B&B Tree :
33.68/33.75 c number of runs : 1
33.68/33.75 c nodes : 1
33.68/33.75 c nodes (total) : 1
33.68/33.75 c nodes left : 0
33.68/33.75 c max depth : 0
33.68/33.75 c max depth (total): 0
33.68/33.75 c backtracks : 0 (0.0%)
33.68/33.75 c delayed cutoffs : 0
33.68/33.75 c repropagations : 0 (0 domain reductions, 0 cutoffs)
33.68/33.75 c avg switch length: 2.00
33.68/33.75 c switching time : 0.00
33.68/33.75 c Solution :
33.68/33.75 c Solutions found : 0 (0 improvements)
33.68/33.75 c Primal Bound : infeasible
33.68/33.75 c Dual Bound : -
33.68/33.75 c Gap : 0.00 %
33.68/33.75 c Root Dual Bound : -
33.68/33.75 c Root Iterations : 23975
33.88/33.92 c Time complete: 33.91.