0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver Clp 1.8.2
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1868369-1245122779.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c start presolving problem
0.00/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.06
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 | 57 |3513k| 0 | 33 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 94 |3601k| 0 | 32 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 145 |3925k| 0 | 34 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 254 |4338k| 0 | 38 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 330 |4361k| 0 | 41 | 231 |2564 |2564 | 231 |2582 | 18 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.21 c 1.1s| 1 | 0 | 432 |4439k| 0 | 43 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
2.10/2.13 c 2.0s| 1 | 2 | 432 |4440k| 0 | 43 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 22 | 1.100000e+01 | -- | Inf
133.14/133.29 c 132s| 10000 | 977 |350089 |7062k| 54 | 31 | 231 |2913 |1138 | 231 |2570 | 21 | 719 |2702 | 1.400000e+01 | -- | Inf
221.32/221.40 c 220s| 20000 | 1162 |642929 |7747k| 61 | 34 | 231 |2816 |1669 | 231 |2570 | 21 |1418 |2965 | 1.500000e+01 | -- | Inf
316.80/316.99 c 315s| 30000 | 1190 |939788 |8160k| 61 | - | 231 |2829 |1840 | 231 |2570 | 21 |2099 |3695 | 1.500000e+01 | -- | Inf
404.07/404.23 c 402s| 40000 | 668 | 1196k|7091k| 61 | 36 | 231 |3124 |1225 | 231 |2570 | 21 |3099 |4352 | 1.600000e+01 | -- | Inf
453.56/453.72 c
453.56/453.72 c SCIP Status : problem is solved [infeasible]
453.56/453.72 c Solving Time (sec) : 450.71
453.56/453.72 c Solving Nodes : 46379
453.56/453.72 c Primal Bound : +1.00000000000000e+20 (0 solutions)
453.56/453.72 c Dual Bound : +1.00000000000000e+20
453.56/453.72 c Gap : 0.00 %
453.56/453.72 c NODE 46379
453.56/453.72 c DUAL BOUND 1e+20
453.56/453.72 c PRIMAL BOUND 1e+20
453.56/453.72 c GAP 0
453.56/453.72 s UNSATISFIABLE
453.56/453.72 c SCIP Status : problem is solved [infeasible]
453.56/453.72 c Solving Time : 450.71
453.56/453.72 c Original Problem :
453.56/453.72 c Problem name : HOME/instance-1868369-1245122779.opb
453.56/453.72 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
453.56/453.72 c Constraints : 2707 initial, 2707 maximal
453.56/453.72 c Presolved Problem :
453.56/453.72 c Problem name : t_HOME/instance-1868369-1245122779.opb
453.56/453.72 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
453.56/453.72 c Constraints : 2564 initial, 3134 maximal
453.56/453.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
453.56/453.72 c trivial : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c dualfix : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c implics : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c probing : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c knapsack : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c setppc : 0.00 0 0 0 0 0 0 0 0
453.56/453.72 c linear : 0.03 0 0 0 0 0 143 0 0
453.56/453.72 c logicor : 0.03 0 0 0 0 0 0 0 0
453.56/453.72 c root node : - 1 - - 1 - - - -
453.56/453.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
453.56/453.72 c integral : 0 0 0 24486 0 193 2042 0 0 46454
453.56/453.72 c knapsack : 1 5 99000 0 0 303 126592 0 0 0
453.56/453.72 c setppc : 22 5 98857 0 0 1054 243827 0 0 0
453.56/453.72 c logicor : 2541+ 5 86772 0 0 314 281460 0 0 0
453.56/453.72 c countsols : 0 0 0 0 0 0 0 0 0 0
453.56/453.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
453.56/453.72 c integral : 60.13 0.00 0.00 60.13 0.00
453.56/453.72 c knapsack : 0.37 0.00 0.37 0.00 0.00
453.56/453.72 c setppc : 1.13 0.00 1.13 0.00 0.00
453.56/453.72 c logicor : 6.47 0.00 6.47 0.00 0.00
453.56/453.72 c countsols : 0.00 0.00 0.00 0.00 0.00
453.56/453.72 c Propagators : Time Calls Cutoffs DomReds
453.56/453.72 c rootredcost : 0.05 0 0 0
453.56/453.72 c pseudoobj : 1.38 99170 1 0
453.56/453.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
453.56/453.72 c propagation : 0.09 1671 1671 7557 15.6 13 13.8 -
453.56/453.72 c infeasible LP : 0.68 21363 0 0 0.0 0 0.0 0
453.56/453.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
453.56/453.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
453.56/453.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
453.56/453.72 c applied globally : - - - 3679 14.2 - - -
453.56/453.72 c applied locally : - - - 4 34.2 - - -
453.56/453.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
453.56/453.72 c cut pool : 0.00 4 - - 11 - (maximal pool size: 354)
453.56/453.72 c redcost : 0.33 23469 0 0 0 0
453.56/453.72 c impliedbounds : 0.00 5 0 0 0 0
453.56/453.72 c intobj : 0.00 0 0 0 0 0
453.56/453.72 c gomory : 0.50 5 0 0 1624 0
453.56/453.72 c strongcg : 0.41 5 0 0 1689 0
453.56/453.72 c cmir : 0.00 0 0 0 0 0
453.56/453.72 c flowcover : 0.00 0 0 0 0 0
453.56/453.72 c clique : 0.00 5 0 0 0 0
453.56/453.72 c zerohalf : 0.00 0 0 0 0 0
453.56/453.72 c mcf : 0.00 1 0 0 0 0
453.56/453.72 c Pricers : Time Calls Vars
453.56/453.72 c problem variables: 0.00 0 0
453.56/453.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
453.56/453.72 c relpscost : 60.11 24486 193 2042 0 0 46454
453.56/453.72 c pscost : 0.00 0 0 0 0 0 0
453.56/453.72 c inference : 0.00 0 0 0 0 0 0
453.56/453.72 c mostinf : 0.00 0 0 0 0 0 0
453.56/453.72 c leastinf : 0.00 0 0 0 0 0 0
453.56/453.72 c fullstrong : 0.00 0 0 0 0 0 0
453.56/453.72 c allfullstrong : 0.00 0 0 0 0 0 0
453.56/453.72 c random : 0.00 0 0 0 0 0 0
453.56/453.72 c Primal Heuristics : Time Calls Found
453.56/453.72 c LP solutions : 0.00 - 0
453.56/453.72 c pseudo solutions : 0.00 - 0
453.56/453.72 c simplerounding : 0.00 0 0
453.56/453.72 c rounding : 0.00 0 0
453.56/453.72 c shifting : 0.00 0 0
453.56/453.72 c intshifting : 0.00 0 0
453.56/453.72 c oneopt : 0.00 0 0
453.56/453.72 c fixandinfer : 0.00 0 0
453.56/453.72 c feaspump : 0.00 0 0
453.56/453.72 c coefdiving : 0.00 0 0
453.56/453.72 c pscostdiving : 0.00 0 0
453.56/453.72 c fracdiving : 0.00 0 0
453.56/453.72 c veclendiving : 0.00 0 0
453.56/453.72 c intdiving : 0.00 0 0
453.56/453.72 c actconsdiving : 0.00 0 0
453.56/453.72 c objpscostdiving : 0.00 0 0
453.56/453.72 c rootsoldiving : 0.00 0 0
453.56/453.72 c linesearchdiving : 0.00 0 0
453.56/453.72 c guideddiving : 0.00 0 0
453.56/453.72 c octane : 0.00 0 0
453.56/453.72 c rens : 0.00 0 0
453.56/453.72 c rins : 0.00 0 0
453.56/453.72 c localbranching : 0.00 0 0
453.56/453.72 c mutation : 0.00 0 0
453.56/453.72 c crossover : 0.00 0 0
453.56/453.72 c dins : 0.00 0 0
453.56/453.72 c LP : Time Calls Iterations Iter/call Iter/sec
453.56/453.72 c primal LP : 0.01 0 0 0.00 0.00
453.56/453.72 c dual LP : 357.52 45754 1324056 28.94 3703.45
453.56/453.72 c barrier LP : 0.00 0 0 0.00 -
453.56/453.72 c diving/probing LP: 0.00 0 0 0.00 -
453.56/453.72 c strong branching : 59.09 4730 242848 51.34 4109.80
453.56/453.72 c (at root node) : - 22 3180 144.55 -
453.56/453.72 c conflict analysis: 0.00 0 0 0.00 -
453.56/453.72 c B&B Tree :
453.56/453.72 c number of runs : 1
453.56/453.72 c nodes : 46379
453.56/453.72 c nodes (total) : 46379
453.56/453.72 c nodes left : 0
453.56/453.72 c max depth : 61
453.56/453.72 c max depth (total): 61
453.56/453.72 c backtracks : 5215 (11.2%)
453.56/453.72 c delayed cutoffs : 76
453.56/453.72 c repropagations : 3743 (11101 domain reductions, 76 cutoffs)
453.56/453.72 c avg switch length: 4.76
453.56/453.72 c switching time : 6.85
453.56/453.72 c Solution :
453.56/453.72 c Solutions found : 0 (0 improvements)
453.56/453.72 c Primal Bound : infeasible
453.56/453.72 c Dual Bound : -
453.56/453.72 c Gap : 0.00 %
453.56/453.72 c Root Dual Bound : +1.10000000000000e+01
453.56/453.74 c Time complete: 453.61.