0.02/0.05 c SCIP version 1.1.0.7
0.02/0.05 c LP-Solver Clp 1.8.2
0.02/0.05 c user parameter file <scip.set> not found - using default parameters
0.02/0.05 c read problem <HOME/instance-1868205-1245115953.opb>
0.02/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.06 c No objective function, only one solution is needed.
0.02/0.06 c start presolving problem
0.02/0.06 c presolving:
0.09/0.10 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.11 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.05
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 48 |3513k| 0 | 22 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.22 c 0.1s| 1 | 0 | 63 |3518k| 0 | 32 | 231 |2564 |2564 | 231 |2569 | 5 | 0 | 0 | 1.100000e+01 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 74 |3776k| 0 | 22 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 180 |4030k| 0 | 43 | 231 |2564 |2564 | 231 |2586 | 22 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.68 c 0.6s| 1 | 0 | 306 |4427k| 0 | 48 | 231 |2564 |2564 | 231 |2592 | 28 | 0 | 0 | 1.100000e+01 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 376 |4725k| 0 | 49 | 231 |2564 |2564 | 231 |2597 | 33 | 0 | 0 | 1.100000e+01 | -- | Inf
1.99/2.10 c 2.0s| 1 | 2 | 376 |4726k| 0 | 49 | 231 |2564 |2564 | 231 |2597 | 33 | 0 | 20 | 1.100000e+01 | -- | Inf
141.92/142.04 c 141s| 10000 | 838 |369246 |7118k| 66 | - | 231 |3066 |1281 | 231 |2574 | 33 |1178 |2037 | 1.400000e+01 | -- | Inf
243.38/243.51 c 242s| 20000 | 794 |714805 |7213k| 66 | 31 | 231 |2849 |1099 | 231 |2574 | 33 |2534 |2386 | 1.500000e+01 | -- | Inf
348.15/348.33 c 346s| 30000 | 678 | 1042k|7164k| 66 | - | 231 |2840 |1547 | 231 |2574 | 33 |3472 |2990 | 1.500000e+01 | -- | Inf
446.81/447.00 c 444s| 40000 | 83 | 1344k|5483k| 66 | - | 231 |2919 |1303 | 231 |2574 | 33 |4469 |3518 | 1.700000e+01 | -- | Inf
450.81/451.03 c
450.81/451.03 c SCIP Status : problem is solved [infeasible]
450.81/451.03 c Solving Time (sec) : 448.29
450.81/451.03 c Solving Nodes : 40494
450.81/451.03 c Primal Bound : +1.00000000000000e+20 (0 solutions)
450.81/451.03 c Dual Bound : +1.00000000000000e+20
450.81/451.03 c Gap : 0.00 %
450.81/451.03 c NODE 40494
450.81/451.03 c DUAL BOUND 1e+20
450.81/451.03 c PRIMAL BOUND 1e+20
450.81/451.03 c GAP 0
450.81/451.03 s UNSATISFIABLE
450.81/451.03 c SCIP Status : problem is solved [infeasible]
450.81/451.03 c Solving Time : 448.29
450.81/451.03 c Original Problem :
450.81/451.03 c Problem name : HOME/instance-1868205-1245115953.opb
450.81/451.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
450.81/451.03 c Constraints : 2707 initial, 2707 maximal
450.81/451.03 c Presolved Problem :
450.81/451.03 c Problem name : t_HOME/instance-1868205-1245115953.opb
450.81/451.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
450.81/451.03 c Constraints : 2564 initial, 3301 maximal
450.81/451.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
450.81/451.03 c trivial : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c implics : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c probing : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c knapsack : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c setppc : 0.00 0 0 0 0 0 0 0 0
450.81/451.03 c linear : 0.02 0 0 0 0 0 143 0 0
450.81/451.03 c logicor : 0.03 0 0 0 0 0 0 0 0
450.81/451.03 c root node : - 1 - - 1 - - - -
450.81/451.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
450.81/451.03 c integral : 0 0 0 21035 0 135 1160 0 0 40604
450.81/451.03 c knapsack : 1 5 87039 0 0 548 146912 0 0 0
450.81/451.03 c setppc : 22 5 86696 0 0 1227 224868 0 0 0
450.81/451.03 c logicor : 2541+ 5 73975 0 0 534 251105 0 0 0
450.81/451.03 c countsols : 0 0 0 0 0 0 0 0 0 0
450.81/451.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
450.81/451.03 c integral : 64.82 0.00 0.00 64.82 0.00
450.81/451.03 c knapsack : 0.54 0.00 0.54 0.00 0.00
450.81/451.03 c setppc : 0.94 0.00 0.94 0.00 0.00
450.81/451.03 c logicor : 6.06 0.00 6.06 0.00 0.00
450.81/451.03 c countsols : 0.00 0.00 0.00 0.00 0.00
450.81/451.03 c Propagators : Time Calls Cutoffs DomReds
450.81/451.03 c rootredcost : 0.10 0 0 0
450.81/451.03 c pseudoobj : 0.97 87252 1 0
450.81/451.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
450.81/451.03 c propagation : 0.11 2309 2309 9504 16.5 26 17.2 -
450.81/451.03 c infeasible LP : 0.52 17858 0 0 0.0 0 0.0 0
450.81/451.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
450.81/451.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
450.81/451.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
450.81/451.03 c applied globally : - - - 4493 14.6 - - -
450.81/451.03 c applied locally : - - - 7 33.9 - - -
450.81/451.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
450.81/451.03 c cut pool : 0.00 4 - - 13 - (maximal pool size: 473)
450.81/451.03 c redcost : 0.37 20474 0 0 0 0
450.81/451.03 c impliedbounds : 0.00 5 0 0 0 0
450.81/451.03 c intobj : 0.00 0 0 0 0 0
450.81/451.03 c gomory : 0.46 5 0 0 2153 0
450.81/451.03 c strongcg : 0.30 5 0 0 2500 0
450.81/451.03 c cmir : 0.00 0 0 0 0 0
450.81/451.03 c flowcover : 0.00 0 0 0 0 0
450.81/451.03 c clique : 0.00 5 0 0 0 0
450.81/451.03 c zerohalf : 0.00 0 0 0 0 0
450.81/451.03 c mcf : 0.00 1 0 0 0 0
450.81/451.03 c Pricers : Time Calls Vars
450.81/451.03 c problem variables: 0.00 0 0
450.81/451.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
450.81/451.03 c relpscost : 64.78 21035 135 1160 0 0 40604
450.81/451.03 c pscost : 0.00 0 0 0 0 0 0
450.81/451.03 c inference : 0.00 0 0 0 0 0 0
450.81/451.03 c mostinf : 0.00 0 0 0 0 0 0
450.81/451.03 c leastinf : 0.00 0 0 0 0 0 0
450.81/451.03 c fullstrong : 0.00 0 0 0 0 0 0
450.81/451.03 c allfullstrong : 0.00 0 0 0 0 0 0
450.81/451.03 c random : 0.00 0 0 0 0 0 0
450.81/451.03 c Primal Heuristics : Time Calls Found
450.81/451.03 c LP solutions : 0.00 - 0
450.81/451.03 c pseudo solutions : 0.00 - 0
450.81/451.03 c simplerounding : 0.00 0 0
450.81/451.03 c rounding : 0.00 0 0
450.81/451.03 c shifting : 0.00 0 0
450.81/451.03 c intshifting : 0.00 0 0
450.81/451.03 c oneopt : 0.00 0 0
450.81/451.03 c fixandinfer : 0.00 0 0
450.81/451.03 c feaspump : 0.00 0 0
450.81/451.03 c coefdiving : 0.00 0 0
450.81/451.03 c pscostdiving : 0.00 0 0
450.81/451.03 c fracdiving : 0.00 0 0
450.81/451.03 c veclendiving : 0.00 0 0
450.81/451.03 c intdiving : 0.00 0 0
450.81/451.03 c actconsdiving : 0.00 0 0
450.81/451.03 c objpscostdiving : 0.00 0 0
450.81/451.03 c rootsoldiving : 0.00 0 0
450.81/451.03 c linesearchdiving : 0.00 0 0
450.81/451.03 c guideddiving : 0.00 0 0
450.81/451.03 c octane : 0.00 0 0
450.81/451.03 c rens : 0.00 0 0
450.81/451.03 c rins : 0.00 0 0
450.81/451.03 c localbranching : 0.00 0 0
450.81/451.03 c mutation : 0.00 0 0
450.81/451.03 c crossover : 0.00 0 0
450.81/451.03 c dins : 0.00 0 0
450.81/451.03 c LP : Time Calls Iterations Iter/call Iter/sec
450.81/451.03 c primal LP : 0.01 0 0 0.00 0.00
450.81/451.03 c dual LP : 353.46 38826 1354036 34.87 3830.80
450.81/451.03 c barrier LP : 0.00 0 0 0.00 -
450.81/451.03 c diving/probing LP: 0.00 0 0 0.00 -
450.81/451.03 c strong branching : 63.94 3547 263290 74.23 4117.77
450.81/451.03 c (at root node) : - 20 3141 157.05 -
450.81/451.03 c conflict analysis: 0.00 0 0 0.00 -
450.81/451.03 c B&B Tree :
450.81/451.03 c number of runs : 1
450.81/451.03 c nodes : 40494
450.81/451.03 c nodes (total) : 40494
450.81/451.03 c nodes left : 0
450.81/451.03 c max depth : 66
450.81/451.03 c max depth (total): 66
450.81/451.03 c backtracks : 4095 (10.1%)
450.81/451.03 c delayed cutoffs : 111
450.81/451.03 c repropagations : 5588 (13852 domain reductions, 111 cutoffs)
450.81/451.03 c avg switch length: 4.55
450.81/451.03 c switching time : 5.91
450.81/451.03 c Solution :
450.81/451.03 c Solutions found : 0 (0 improvements)
450.81/451.03 c Primal Bound : infeasible
450.81/451.03 c Dual Bound : -
450.81/451.03 c Gap : 0.00 %
450.81/451.03 c Root Dual Bound : +1.10000000000000e+01
450.81/451.04 c Time complete: 450.84.