0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1868293-1245119621.opb>
0.00/0.04 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c start presolving problem
0.00/0.05 c presolving:
0.05/0.09 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.10 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.11 c presolving (3 rounds):
0.09/0.11 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 242 implications, 22 cliques
0.09/0.11 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.11 c 1 constraints of type <knapsack>
0.09/0.11 c 22 constraints of type <setppc>
0.09/0.11 c 2541 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.05
0.09/0.11 c SATUNSAT-LIN
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/flowcover/freq = c -1
0.09/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/cmir/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/veclendiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/simplerounding/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/shifting/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/rounding/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/rootsoldiving/freq = c -1
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/rens/nodesofs = c 2000
0.09/0.11 c # minimum percentage of integer variables that have to be fixable
0.09/0.11 c # [type: real, range: [0,1], default: 0.5]
0.09/0.11 c heuristics/rens/minfixingrate = c 0.3
0.09/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/rens/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/pscostdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/oneopt/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.11 c # [type: real, range: [0,1], default: 0.01]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/objpscostdiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/linesearchdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/intshifting/freq = c -1
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 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 | 55 |3513k| 0 | 33 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 75 |3730k| 0 | 35 | 231 |2564 |2564 | 231 |2571 | 7 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 139 |4237k| 0 | 45 | 231 |2564 |2564 | 231 |2575 | 11 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.81 c 0.8s| 1 | 0 | 173 |4242k| 0 | 45 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
1.09/1.17 c 1.1s| 1 | 0 | 361 |4245k| 0 | 42 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 456 |4247k| 0 | 44 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
2.59/2.67 c 2.6s| 1 | 2 | 456 |4248k| 0 | 44 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 19 | 1.100000e+01 | -- | Inf
139.73/139.81 c 139s| 10000 | 661 |391098 |6372k| 64 | - | 231 |3171 | 630 | 231 |2571 | 17 |1740 |1846 | 1.400000e+01 | -- | Inf
236.58/236.75 c 235s| 20000 | 674 |723273 |6651k| 64 | - | 231 |3039 |1167 | 231 |2571 | 17 |3459 |2310 | 1.500000e+01 | -- | Inf
327.64/327.88 c 326s| 30000 | 373 | 1025k|6026k| 64 | 26 | 231 |3155 |1440 | 231 |2571 | 17 |4759 |2682 | 1.600000e+01 | -- | Inf
362.62/362.83 c
362.62/362.83 c SCIP Status : problem is solved [infeasible]
362.62/362.83 c Solving Time (sec) : 360.72
362.62/362.83 c Solving Nodes : 34531
362.62/362.83 c Primal Bound : +1.00000000000000e+20 (0 solutions)
362.62/362.83 c Dual Bound : +1.00000000000000e+20
362.62/362.83 c Gap : 0.00 %
362.62/362.83 c NODE 34531
362.62/362.83 c DUAL BOUND 1e+20
362.62/362.83 c PRIMAL BOUND 1e+20
362.62/362.83 c GAP 0
362.62/362.83 s UNSATISFIABLE
362.62/362.83 c SCIP Status : problem is solved [infeasible]
362.62/362.83 c Solving Time : 360.72
362.62/362.83 c Original Problem :
362.62/362.83 c Problem name : HOME/instance-1868293-1245119621.opb
362.62/362.83 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
362.62/362.83 c Constraints : 2707 initial, 2707 maximal
362.62/362.83 c Presolved Problem :
362.62/362.83 c Problem name : t_HOME/instance-1868293-1245119621.opb
362.62/362.83 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
362.62/362.83 c Constraints : 2564 initial, 3258 maximal
362.62/362.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
362.62/362.83 c trivial : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c implics : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c probing : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c knapsack : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c setppc : 0.00 0 0 0 0 0 0 0 0
362.62/362.83 c linear : 0.02 0 0 0 0 0 143 0 0
362.62/362.83 c logicor : 0.03 0 0 0 0 0 0 0 0
362.62/362.83 c root node : - 1 - - 1 - - - -
362.62/362.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
362.62/362.83 c integral : 0 0 0 17951 0 93 919 0 0 34710
362.62/362.83 c knapsack : 1 5 75567 0 0 282 128979 0 0 0
362.62/362.83 c setppc : 22 5 75460 0 0 1613 180223 0 0 0
362.62/362.83 c logicor : 2541+ 5 63284 0 0 550 208568 0 0 0
362.62/362.83 c countsols : 0 0 0 0 0 0 0 0 0 0
362.62/362.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
362.62/362.83 c integral : 58.08 0.00 0.00 58.08 0.00
362.62/362.83 c knapsack : 0.42 0.00 0.42 0.00 0.00
362.62/362.83 c setppc : 0.87 0.00 0.87 0.00 0.00
362.62/362.83 c logicor : 4.62 0.00 4.62 0.00 0.00
362.62/362.83 c countsols : 0.00 0.00 0.00 0.00 0.00
362.62/362.83 c Propagators : Time Calls Cutoffs DomReds
362.62/362.83 c rootredcost : 0.02 0 0 0
362.62/362.83 c pseudoobj : 0.91 75758 1 0
362.62/362.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
362.62/362.83 c propagation : 0.20 2445 2445 10185 15.1 22 18.0 -
362.62/362.83 c infeasible LP : 0.61 14817 0 0 0.0 0 0.0 0
362.62/362.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
362.62/362.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
362.62/362.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
362.62/362.83 c applied globally : - - - 5314 13.6 - - -
362.62/362.83 c applied locally : - - - 8 31.9 - - -
362.62/362.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
362.62/362.83 c cut pool : 0.00 4 - - 13 - (maximal pool size: 286)
362.62/362.83 c redcost : 0.27 17494 0 0 0 0
362.62/362.83 c impliedbounds : 0.00 5 0 0 0 0
362.62/362.83 c intobj : 0.00 0 0 0 0 0
362.62/362.83 c gomory : 0.71 5 0 0 1403 0
362.62/362.83 c strongcg : 0.50 5 0 0 1403 0
362.62/362.83 c cmir : 0.00 0 0 0 0 0
362.62/362.83 c flowcover : 0.00 0 0 0 0 0
362.62/362.83 c clique : 0.01 5 0 0 0 0
362.62/362.83 c zerohalf : 0.00 0 0 0 0 0
362.62/362.83 c mcf : 0.00 1 0 0 0 0
362.62/362.83 c Pricers : Time Calls Vars
362.62/362.83 c problem variables: 0.00 0 0
362.62/362.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
362.62/362.83 c relpscost : 58.06 17951 93 919 0 0 34710
362.62/362.83 c pscost : 0.00 0 0 0 0 0 0
362.62/362.83 c inference : 0.00 0 0 0 0 0 0
362.62/362.83 c mostinf : 0.00 0 0 0 0 0 0
362.62/362.83 c leastinf : 0.00 0 0 0 0 0 0
362.62/362.83 c fullstrong : 0.00 0 0 0 0 0 0
362.62/362.83 c allfullstrong : 0.00 0 0 0 0 0 0
362.62/362.83 c random : 0.00 0 0 0 0 0 0
362.62/362.83 c Primal Heuristics : Time Calls Found
362.62/362.83 c LP solutions : 0.00 - 0
362.62/362.83 c pseudo solutions : 0.00 - 0
362.62/362.83 c simplerounding : 0.00 0 0
362.62/362.83 c rounding : 0.00 0 0
362.62/362.83 c shifting : 0.00 0 0
362.62/362.83 c intshifting : 0.00 0 0
362.62/362.83 c oneopt : 0.00 0 0
362.62/362.83 c fixandinfer : 0.00 0 0
362.62/362.83 c feaspump : 0.00 0 0
362.62/362.83 c coefdiving : 0.00 0 0
362.62/362.83 c pscostdiving : 0.00 0 0
362.62/362.83 c fracdiving : 0.00 0 0
362.62/362.83 c veclendiving : 0.00 0 0
362.62/362.83 c intdiving : 0.00 0 0
362.62/362.83 c actconsdiving : 0.00 0 0
362.62/362.83 c objpscostdiving : 0.00 0 0
362.62/362.83 c rootsoldiving : 0.00 0 0
362.62/362.83 c linesearchdiving : 0.00 0 0
362.62/362.83 c guideddiving : 0.00 0 0
362.62/362.83 c octane : 0.00 0 0
362.62/362.83 c rens : 0.00 0 0
362.62/362.83 c rins : 0.00 0 0
362.62/362.83 c localbranching : 0.00 0 0
362.62/362.83 c mutation : 0.00 0 0
362.62/362.83 c crossover : 0.00 0 0
362.62/362.83 c dins : 0.00 0 0
362.62/362.83 c LP : Time Calls Iterations Iter/call Iter/sec
362.62/362.83 c primal LP : 0.02 0 0 0.00 0.00
362.62/362.83 c dual LP : 277.14 32693 1128766 34.53 4072.91
362.62/362.83 c barrier LP : 0.00 0 0 0.00 -
362.62/362.83 c diving/probing LP: 0.00 0 0 0.00 -
362.62/362.83 c strong branching : 57.39 2825 248491 87.96 4329.87
362.62/362.83 c (at root node) : - 19 3845 202.37 -
362.62/362.83 c conflict analysis: 0.00 0 0 0.00 -
362.62/362.83 c B&B Tree :
362.62/362.83 c number of runs : 1
362.62/362.83 c nodes : 34531
362.62/362.83 c nodes (total) : 34531
362.62/362.83 c nodes left : 0
362.62/362.83 c max depth : 64
362.62/362.83 c max depth (total): 64
362.62/362.83 c backtracks : 3484 (10.1%)
362.62/362.83 c delayed cutoffs : 180
362.62/362.83 c repropagations : 5688 (14042 domain reductions, 180 cutoffs)
362.62/362.83 c avg switch length: 4.36
362.62/362.83 c switching time : 5.09
362.62/362.83 c Solution :
362.62/362.83 c Solutions found : 0 (0 improvements)
362.62/362.83 c Primal Bound : infeasible
362.62/362.83 c Dual Bound : -
362.62/362.83 c Gap : 0.00 %
362.62/362.83 c Root Dual Bound : +1.10000000000000e+01
362.62/362.84 c Time complete: 362.67.