0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver SoPlex 1.4.1
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1868268-1245118540.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.04/0.06 c No objective function, only one solution is needed.
0.04/0.06 c start presolving problem
0.04/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.15 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 0 | 77 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 103 |3670k| 0 | 39 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 126 |3881k| 0 | 39 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 0 | 141 |3950k| 0 | 41 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.21 c 1.1s| 1 | 0 | 164 |4019k| 0 | 43 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
1.49/1.58 c 1.5s| 1 | 0 | 178 |4036k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
3.99/4.07 c 4.0s| 1 | 2 | 178 |4037k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 33 | 1.100000e+01 | -- | Inf
164.65/164.70 c 163s| 10000 | 429 |278383 |7055k| 48 | 39 | 231 |6468 |1855 | 231 |2574 | 15 |6897 |2440 | 1.500000e+01 | -- | Inf
286.22/286.39 c 284s| 20000 | 225 |560827 |7613k| 49 | 35 | 231 |8313 |2904 | 231 |2574 | 15 | 14k|2701 | 1.600000e+01 | -- | Inf
308.61/308.77 c
308.61/308.77 c SCIP Status : problem is solved [infeasible]
308.61/308.77 c Solving Time (sec) : 305.94
308.61/308.77 c Solving Nodes : 21797
308.61/308.77 c Primal Bound : +1.00000000000000e+20 (0 solutions)
308.61/308.77 c Dual Bound : +1.00000000000000e+20
308.61/308.77 c Gap : 0.00 %
308.61/308.77 c NODE 21797
308.61/308.77 c DUAL BOUND 1e+20
308.61/308.77 c PRIMAL BOUND 1e+20
308.61/308.77 c GAP 0
308.61/308.77 s UNSATISFIABLE
308.61/308.77 c SCIP Status : problem is solved [infeasible]
308.61/308.77 c Solving Time : 305.94
308.61/308.77 c Original Problem :
308.61/308.77 c Problem name : HOME/instance-1868268-1245118540.opb
308.61/308.77 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
308.61/308.77 c Constraints : 2707 initial, 2707 maximal
308.61/308.77 c Presolved Problem :
308.61/308.77 c Problem name : t_HOME/instance-1868268-1245118540.opb
308.61/308.77 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
308.61/308.77 c Constraints : 2564 initial, 8728 maximal
308.61/308.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
308.61/308.77 c trivial : 0.01 0 0 0 0 0 0 0 0
308.61/308.77 c dualfix : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c implics : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c probing : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c knapsack : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c setppc : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c linear : 0.02 0 0 0 0 0 143 0 0
308.61/308.77 c logicor : 0.00 0 0 0 0 0 0 0 0
308.61/308.77 c root node : - 2 - - 2 - - - -
308.61/308.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
308.61/308.77 c integral : 0 0 0 11421 0 74 1011 0 0 21832
308.61/308.77 c knapsack : 1 5 88075 0 0 57 27554 0 0 0
308.61/308.77 c setppc : 22 5 88057 0 0 234 125315 0 0 0
308.61/308.77 c logicor : 2541+ 5 42354 0 0 96 118563 0 0 0
308.61/308.77 c countsols : 0 0 0 0 0 0 0 0 0 0
308.61/308.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
308.61/308.77 c integral : 58.34 0.00 0.00 58.34 0.00
308.61/308.77 c knapsack : 0.09 0.00 0.09 0.00 0.00
308.61/308.77 c setppc : 0.61 0.00 0.61 0.00 0.00
308.61/308.77 c logicor : 6.07 0.00 6.07 0.00 0.00
308.61/308.77 c countsols : 0.00 0.00 0.00 0.00 0.00
308.61/308.77 c Propagators : Time Calls Cutoffs DomReds
308.61/308.77 c rootredcost : 0.05 0 0 0
308.61/308.77 c pseudoobj : 1.11 88122 1 0
308.61/308.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
308.61/308.77 c propagation : 0.06 387 385 1753 17.9 19 18.7 -
308.61/308.77 c infeasible LP : 4.07 10451 10353 56436 29.0 159 23.2 0
308.61/308.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
308.61/308.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
308.61/308.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
308.61/308.77 c applied globally : - - - 15748 18.6 - - -
308.61/308.77 c applied locally : - - - 320 34.1 - - -
308.61/308.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
308.61/308.77 c cut pool : 0.00 4 - - 4 - (maximal pool size: 189)
308.61/308.77 c redcost : 0.12 11029 0 0 0 0
308.61/308.77 c impliedbounds : 0.00 5 0 0 0 0
308.61/308.77 c intobj : 0.00 0 0 0 0 0
308.61/308.77 c gomory : 0.79 5 0 0 732 0
308.61/308.77 c strongcg : 0.56 5 0 0 1233 0
308.61/308.77 c cmir : 0.00 0 0 0 0 0
308.61/308.77 c flowcover : 0.00 0 0 0 0 0
308.61/308.77 c clique : 0.00 5 0 0 0 0
308.61/308.77 c zerohalf : 0.00 0 0 0 0 0
308.61/308.77 c mcf : 0.00 1 0 0 0 0
308.61/308.77 c Pricers : Time Calls Vars
308.61/308.77 c problem variables: 0.00 0 0
308.61/308.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
308.61/308.77 c relpscost : 58.32 11421 74 1011 0 0 21832
308.61/308.77 c pscost : 0.00 0 0 0 0 0 0
308.61/308.77 c inference : 0.00 0 0 0 0 0 0
308.61/308.77 c mostinf : 0.00 0 0 0 0 0 0
308.61/308.77 c leastinf : 0.00 0 0 0 0 0 0
308.61/308.77 c fullstrong : 0.00 0 0 0 0 0 0
308.61/308.77 c allfullstrong : 0.00 0 0 0 0 0 0
308.61/308.77 c random : 0.00 0 0 0 0 0 0
308.61/308.77 c Primal Heuristics : Time Calls Found
308.61/308.77 c LP solutions : 0.00 - 0
308.61/308.77 c pseudo solutions : 0.00 - 0
308.61/308.77 c simplerounding : 0.00 0 0
308.61/308.77 c rounding : 0.00 0 0
308.61/308.77 c shifting : 0.00 0 0
308.61/308.77 c intshifting : 0.00 0 0
308.61/308.77 c oneopt : 0.00 0 0
308.61/308.77 c fixandinfer : 0.00 0 0
308.61/308.77 c feaspump : 0.00 0 0
308.61/308.77 c coefdiving : 0.00 0 0
308.61/308.77 c pscostdiving : 0.00 0 0
308.61/308.77 c fracdiving : 0.00 0 0
308.61/308.77 c veclendiving : 0.00 0 0
308.61/308.77 c intdiving : 0.00 0 0
308.61/308.77 c actconsdiving : 0.00 0 0
308.61/308.77 c objpscostdiving : 0.00 0 0
308.61/308.77 c rootsoldiving : 0.00 0 0
308.61/308.77 c linesearchdiving : 0.00 0 0
308.61/308.77 c guideddiving : 0.00 0 0
308.61/308.77 c octane : 0.00 0 0
308.61/308.77 c rens : 0.00 0 0
308.61/308.77 c rins : 0.00 0 0
308.61/308.77 c localbranching : 0.00 0 0
308.61/308.77 c mutation : 0.00 0 0
308.61/308.77 c crossover : 0.00 0 0
308.61/308.77 c dins : 0.00 0 0
308.61/308.77 c LP : Time Calls Iterations Iter/call Iter/sec
308.61/308.77 c primal LP : 0.00 0 0 0.00 -
308.61/308.77 c dual LP : 216.69 21853 605351 27.70 2793.63
308.61/308.77 c barrier LP : 0.00 0 0 0.00 -
308.61/308.77 c diving/probing LP: 0.00 0 0 0.00 -
308.61/308.77 c strong branching : 57.74 2850 151315 53.09 2620.63
308.61/308.77 c (at root node) : - 33 6148 186.30 -
308.61/308.77 c conflict analysis: 0.00 0 0 0.00 -
308.61/308.77 c B&B Tree :
308.61/308.77 c number of runs : 1
308.61/308.77 c nodes : 21797
308.61/308.77 c nodes (total) : 21797
308.61/308.77 c nodes left : 0
308.61/308.77 c max depth : 49
308.61/308.77 c max depth (total): 49
308.61/308.77 c backtracks : 2136 (9.8%)
308.61/308.77 c delayed cutoffs : 36
308.61/308.77 c repropagations : 38553 (36207 domain reductions, 33 cutoffs)
308.61/308.77 c avg switch length: 6.19
308.61/308.77 c switching time : 5.37
308.61/308.77 c Solution :
308.61/308.77 c Solutions found : 0 (0 improvements)
308.61/308.77 c Primal Bound : infeasible
308.61/308.77 c Dual Bound : -
308.61/308.77 c Gap : 0.00 %
308.61/308.77 c Root Dual Bound : +1.10000000000000e+01
308.61/308.79 c Time complete: 308.71.