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-1868275-1245118840.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.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 | 53 |3513k| 0 | 31 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 98 |3692k| 0 | 48 | 231 |2564 |2564 | 231 |2574 | 10 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 131 |3794k| 0 | 45 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 207 |3937k| 0 | 45 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
0.99/1.01 c 0.9s| 1 | 0 | 292 |4211k| 0 | 44 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.20 c 1.1s| 1 | 0 | 336 |4330k| 0 | 42 | 231 |2564 |2564 | 231 |2587 | 23 | 0 | 0 | 1.100000e+01 | -- | Inf
2.10/2.11 c 2.0s| 1 | 2 | 336 |4330k| 0 | 42 | 231 |2564 |2564 | 231 |2587 | 23 | 0 | 18 | 1.100000e+01 | -- | Inf
149.75/149.86 c 149s| 10000 | 889 |376202 |6878k| 59 | - | 231 |3080 | 949 | 231 |2573 | 23 |1324 |2080 | 1.400000e+01 | -- | Inf
250.92/251.07 c 249s| 20000 | 1080 |703642 |7647k| 59 | 20 | 231 |3061 |1311 | 231 |2573 | 23 |3119 |2603 | 1.500000e+01 | -- | Inf
353.60/353.76 c 352s| 30000 | 1140 | 1039k|8087k| 59 | - | 231 |2958 |1337 | 231 |2573 | 23 |4100 |2976 | 1.500000e+01 | -- | Inf
450.96/451.18 c 448s| 40000 | 793 | 1337k|7452k| 59 | 28 | 231 |3158 | 979 | 231 |2573 | 23 |5394 |3499 | 1.600000e+01 | -- | Inf
511.75/511.94 c
511.75/511.94 c SCIP Status : problem is solved [infeasible]
511.75/511.94 c Solving Time (sec) : 508.88
511.75/511.94 c Solving Nodes : 47714
511.75/511.94 c Primal Bound : +1.00000000000000e+20 (0 solutions)
511.75/511.94 c Dual Bound : +1.00000000000000e+20
511.75/511.94 c Gap : 0.00 %
511.75/511.94 c NODE 47714
511.75/511.94 c DUAL BOUND 1e+20
511.75/511.94 c PRIMAL BOUND 1e+20
511.75/511.94 c GAP 0
511.75/511.94 s UNSATISFIABLE
511.75/511.94 c SCIP Status : problem is solved [infeasible]
511.75/511.94 c Solving Time : 508.88
511.75/511.94 c Original Problem :
511.75/511.94 c Problem name : HOME/instance-1868275-1245118840.opb
511.75/511.94 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
511.75/511.94 c Constraints : 2707 initial, 2707 maximal
511.75/511.94 c Presolved Problem :
511.75/511.94 c Problem name : t_HOME/instance-1868275-1245118840.opb
511.75/511.94 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
511.75/511.94 c Constraints : 2564 initial, 3511 maximal
511.75/511.94 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
511.75/511.94 c trivial : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c dualfix : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c boundshift : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c inttobinary : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c implics : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c probing : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c knapsack : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c setppc : 0.00 0 0 0 0 0 0 0 0
511.75/511.94 c linear : 0.03 0 0 0 0 0 143 0 0
511.75/511.94 c logicor : 0.01 0 0 0 0 0 0 0 0
511.75/511.94 c root node : - 1 - - 1 - - - -
511.75/511.94 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
511.75/511.94 c integral : 0 0 0 25027 0 283 1368 0 0 47926
511.75/511.94 c knapsack : 1 5 100423 0 0 477 158919 0 0 0
511.75/511.94 c setppc : 22 5 100138 0 0 1859 255759 0 0 0
511.75/511.94 c logicor : 2541+ 5 86460 0 0 542 289066 0 0 0
511.75/511.94 c countsols : 0 0 0 0 0 0 0 0 0 0
511.75/511.94 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
511.75/511.94 c integral : 74.37 0.00 0.00 74.37 0.00
511.75/511.94 c knapsack : 0.59 0.00 0.59 0.00 0.00
511.75/511.94 c setppc : 1.01 0.00 1.01 0.00 0.00
511.75/511.94 c logicor : 6.32 0.00 6.32 0.00 0.00
511.75/511.94 c countsols : 0.00 0.00 0.00 0.00 0.00
511.75/511.94 c Propagators : Time Calls Cutoffs DomReds
511.75/511.94 c rootredcost : 0.11 0 0 0
511.75/511.94 c pseudoobj : 1.32 100623 1 0
511.75/511.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
511.75/511.94 c propagation : 0.15 2878 2877 13494 14.7 23 15.3 -
511.75/511.94 c infeasible LP : 0.62 20801 0 0 0.0 0 0.0 0
511.75/511.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
511.75/511.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
511.75/511.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
511.75/511.94 c applied globally : - - - 6821 13.5 - - -
511.75/511.94 c applied locally : - - - 1 31.0 - - -
511.75/511.94 c Separators : Time Calls Cutoffs DomReds Cuts Conss
511.75/511.94 c cut pool : 0.00 4 - - 5 - (maximal pool size: 363)
511.75/511.94 c redcost : 0.51 24308 0 0 0 0
511.75/511.94 c impliedbounds : 0.00 5 0 0 0 0
511.75/511.94 c intobj : 0.00 0 0 0 0 0
511.75/511.94 c gomory : 0.59 5 0 0 2067 0
511.75/511.94 c strongcg : 0.35 5 0 0 2500 0
511.75/511.94 c cmir : 0.00 0 0 0 0 0
511.75/511.94 c flowcover : 0.00 0 0 0 0 0
511.75/511.94 c clique : 0.01 5 0 0 0 0
511.75/511.94 c zerohalf : 0.00 0 0 0 0 0
511.75/511.94 c mcf : 0.00 1 0 0 0 0
511.75/511.94 c Pricers : Time Calls Vars
511.75/511.94 c problem variables: 0.00 0 0
511.75/511.94 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
511.75/511.94 c relpscost : 74.27 25027 283 1368 0 0 47926
511.75/511.94 c pscost : 0.00 0 0 0 0 0 0
511.75/511.94 c inference : 0.00 0 0 0 0 0 0
511.75/511.94 c mostinf : 0.00 0 0 0 0 0 0
511.75/511.94 c leastinf : 0.00 0 0 0 0 0 0
511.75/511.94 c fullstrong : 0.00 0 0 0 0 0 0
511.75/511.94 c allfullstrong : 0.00 0 0 0 0 0 0
511.75/511.94 c random : 0.00 0 0 0 0 0 0
511.75/511.94 c Primal Heuristics : Time Calls Found
511.75/511.94 c LP solutions : 0.00 - 0
511.75/511.94 c pseudo solutions : 0.00 - 0
511.75/511.94 c simplerounding : 0.00 0 0
511.75/511.94 c rounding : 0.00 0 0
511.75/511.94 c shifting : 0.00 0 0
511.75/511.94 c intshifting : 0.00 0 0
511.75/511.94 c oneopt : 0.00 0 0
511.75/511.94 c fixandinfer : 0.00 0 0
511.75/511.94 c feaspump : 0.00 0 0
511.75/511.94 c coefdiving : 0.00 0 0
511.75/511.94 c pscostdiving : 0.00 0 0
511.75/511.94 c fracdiving : 0.00 0 0
511.75/511.94 c veclendiving : 0.00 0 0
511.75/511.94 c intdiving : 0.00 0 0
511.75/511.94 c actconsdiving : 0.00 0 0
511.75/511.94 c objpscostdiving : 0.00 0 0
511.75/511.94 c rootsoldiving : 0.00 0 0
511.75/511.94 c linesearchdiving : 0.00 0 0
511.75/511.94 c guideddiving : 0.00 0 0
511.75/511.94 c octane : 0.00 0 0
511.75/511.94 c rens : 0.00 0 0
511.75/511.94 c rins : 0.00 0 0
511.75/511.94 c localbranching : 0.00 0 0
511.75/511.94 c mutation : 0.00 0 0
511.75/511.94 c crossover : 0.00 0 0
511.75/511.94 c dins : 0.00 0 0
511.75/511.94 c LP : Time Calls Iterations Iter/call Iter/sec
511.75/511.94 c primal LP : 0.01 0 0 0.00 0.00
511.75/511.94 c dual LP : 398.99 45695 1501145 32.85 3762.36
511.75/511.94 c barrier LP : 0.00 0 0 0.00 -
511.75/511.94 c diving/probing LP: 0.00 0 0 0.00 -
511.75/511.94 c strong branching : 73.23 3798 292065 76.90 3988.32
511.75/511.94 c (at root node) : - 18 3143 174.61 -
511.75/511.94 c conflict analysis: 0.00 0 0 0.00 -
511.75/511.94 c B&B Tree :
511.75/511.94 c number of runs : 1
511.75/511.94 c nodes : 47714
511.75/511.94 c nodes (total) : 47714
511.75/511.94 c nodes left : 0
511.75/511.94 c max depth : 59
511.75/511.94 c max depth (total): 59
511.75/511.94 c backtracks : 5115 (10.7%)
511.75/511.94 c delayed cutoffs : 213
511.75/511.94 c repropagations : 6903 (19371 domain reductions, 212 cutoffs)
511.75/511.94 c avg switch length: 4.86
511.75/511.94 c switching time : 7.96
511.75/511.94 c Solution :
511.75/511.94 c Solutions found : 0 (0 improvements)
511.75/511.94 c Primal Bound : infeasible
511.75/511.94 c Dual Bound : -
511.75/511.94 c Gap : 0.00 %
511.75/511.94 c Root Dual Bound : +1.10000000000000e+01
511.75/511.95 c Time complete: 511.8.