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-1868237-1245117440.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.00/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 | 58 |3513k| 0 | 32 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 84 |3693k| 0 | 35 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.41 c 0.3s| 1 | 0 | 168 |4007k| 0 | 44 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 351 |4358k| 0 | 46 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
0.89/0.90 c 0.8s| 1 | 0 | 617 |4727k| 0 | 34 | 231 |2564 |2564 | 231 |2588 | 24 | 0 | 0 | 1.100000e+01 | -- | Inf
1.10/1.16 c 1.1s| 1 | 0 | 854 |5093k| 0 | 35 | 231 |2564 |2564 | 231 |2591 | 27 | 0 | 0 | 1.100000e+01 | -- | Inf
2.09/2.16 c 2.1s| 1 | 2 | 854 |5094k| 0 | 35 | 231 |2564 |2564 | 231 |2591 | 27 | 0 | 22 | 1.100000e+01 | -- | Inf
134.64/134.77 c 134s| 10000 | 697 |362521 |7151k| 52 | 19 | 231 |2888 |1224 | 231 |2570 | 27 | 851 |2620 | 1.400000e+01 | -- | Inf
226.40/226.54 c 225s| 20000 | 592 |670756 |7161k| 52 | 33 | 231 |2759 |1434 | 231 |2570 | 27 |1511 |2897 | 1.500000e+01 | -- | Inf
296.03/296.24 c
296.03/296.24 c SCIP Status : problem is solved [infeasible]
296.03/296.24 c Solving Time (sec) : 293.92
296.03/296.24 c Solving Nodes : 27520
296.03/296.24 c Primal Bound : +1.00000000000000e+20 (0 solutions)
296.03/296.24 c Dual Bound : +1.00000000000000e+20
296.03/296.24 c Gap : 0.00 %
296.03/296.24 c NODE 27520
296.03/296.24 c DUAL BOUND 1e+20
296.03/296.24 c PRIMAL BOUND 1e+20
296.03/296.24 c GAP 0
296.03/296.24 s UNSATISFIABLE
296.03/296.24 c SCIP Status : problem is solved [infeasible]
296.03/296.24 c Solving Time : 293.92
296.03/296.24 c Original Problem :
296.03/296.24 c Problem name : HOME/instance-1868237-1245117440.opb
296.03/296.24 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
296.03/296.24 c Constraints : 2707 initial, 2707 maximal
296.03/296.24 c Presolved Problem :
296.03/296.24 c Problem name : t_HOME/instance-1868237-1245117440.opb
296.03/296.24 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
296.03/296.24 c Constraints : 2564 initial, 2951 maximal
296.03/296.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
296.03/296.24 c trivial : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c implics : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c probing : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c knapsack : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c setppc : 0.00 0 0 0 0 0 0 0 0
296.03/296.24 c linear : 0.02 0 0 0 0 0 143 0 0
296.03/296.24 c logicor : 0.03 0 0 0 0 0 0 0 0
296.03/296.24 c root node : - 2 - - 2 - - - -
296.03/296.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
296.03/296.24 c integral : 0 0 0 14713 0 188 1418 0 0 27566
296.03/296.24 c knapsack : 1 5 57814 0 0 124 59721 0 0 0
296.03/296.24 c setppc : 22 5 57796 0 0 577 150156 0 0 0
296.03/296.24 c logicor : 2541+ 5 50272 0 0 124 152324 0 0 0
296.03/296.24 c countsols : 0 0 0 0 0 0 0 0 0 0
296.03/296.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
296.03/296.24 c integral : 47.52 0.00 0.00 47.52 0.00
296.03/296.24 c knapsack : 0.26 0.00 0.26 0.00 0.00
296.03/296.24 c setppc : 0.65 0.01 0.64 0.00 0.00
296.03/296.24 c logicor : 3.44 0.00 3.44 0.00 0.00
296.03/296.24 c countsols : 0.00 0.00 0.00 0.00 0.00
296.03/296.24 c Propagators : Time Calls Cutoffs DomReds
296.03/296.24 c rootredcost : 0.03 0 0 0
296.03/296.24 c pseudoobj : 0.80 57929 1 0
296.03/296.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
296.03/296.24 c propagation : 0.08 825 825 3576 15.1 7 14.3 -
296.03/296.24 c infeasible LP : 0.60 12770 0 0 0.0 0 0.0 0
296.03/296.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
296.03/296.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
296.03/296.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
296.03/296.24 c applied globally : - - - 1937 14.1 - - -
296.03/296.24 c applied locally : - - - 0 0.0 - - -
296.03/296.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
296.03/296.24 c cut pool : 0.00 4 - - 2 - (maximal pool size: 553)
296.03/296.24 c redcost : 0.22 14011 0 0 0 0
296.03/296.24 c impliedbounds : 0.00 5 0 0 0 0
296.03/296.24 c intobj : 0.00 0 0 0 0 0
296.03/296.24 c gomory : 0.36 5 0 0 2500 0
296.03/296.24 c strongcg : 0.34 5 0 0 2500 0
296.03/296.24 c cmir : 0.00 0 0 0 0 0
296.03/296.24 c flowcover : 0.00 0 0 0 0 0
296.03/296.24 c clique : 0.00 5 0 0 0 0
296.03/296.24 c zerohalf : 0.00 0 0 0 0 0
296.03/296.24 c mcf : 0.00 1 0 0 0 0
296.03/296.24 c Pricers : Time Calls Vars
296.03/296.24 c problem variables: 0.00 0 0
296.03/296.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
296.03/296.24 c relpscost : 47.51 14713 188 1418 0 0 27566
296.03/296.24 c pscost : 0.00 0 0 0 0 0 0
296.03/296.24 c inference : 0.00 0 0 0 0 0 0
296.03/296.24 c mostinf : 0.00 0 0 0 0 0 0
296.03/296.24 c leastinf : 0.00 0 0 0 0 0 0
296.03/296.24 c fullstrong : 0.00 0 0 0 0 0 0
296.03/296.24 c allfullstrong : 0.00 0 0 0 0 0 0
296.03/296.24 c random : 0.00 0 0 0 0 0 0
296.03/296.24 c Primal Heuristics : Time Calls Found
296.03/296.24 c LP solutions : 0.00 - 0
296.03/296.24 c pseudo solutions : 0.00 - 0
296.03/296.24 c simplerounding : 0.00 0 0
296.03/296.24 c rounding : 0.00 0 0
296.03/296.24 c shifting : 0.00 0 0
296.03/296.24 c intshifting : 0.00 0 0
296.03/296.24 c oneopt : 0.00 0 0
296.03/296.24 c fixandinfer : 0.00 0 0
296.03/296.24 c feaspump : 0.00 0 0
296.03/296.24 c coefdiving : 0.00 0 0
296.03/296.24 c pscostdiving : 0.00 0 0
296.03/296.24 c fracdiving : 0.00 0 0
296.03/296.24 c veclendiving : 0.00 0 0
296.03/296.24 c intdiving : 0.00 0 0
296.03/296.24 c actconsdiving : 0.00 0 0
296.03/296.24 c objpscostdiving : 0.00 0 0
296.03/296.24 c rootsoldiving : 0.00 0 0
296.03/296.24 c linesearchdiving : 0.00 0 0
296.03/296.24 c guideddiving : 0.00 0 0
296.03/296.24 c octane : 0.00 0 0
296.03/296.24 c rens : 0.00 0 0
296.03/296.24 c rins : 0.00 0 0
296.03/296.24 c localbranching : 0.00 0 0
296.03/296.24 c mutation : 0.00 0 0
296.03/296.24 c crossover : 0.00 0 0
296.03/296.24 c dins : 0.00 0 0
296.03/296.24 c LP : Time Calls Iterations Iter/call Iter/sec
296.03/296.24 c primal LP : 0.01 0 0 0.00 0.00
296.03/296.24 c dual LP : 226.87 27426 870865 31.75 3838.61
296.03/296.24 c barrier LP : 0.00 0 0 0.00 -
296.03/296.24 c diving/probing LP: 0.00 0 0 0.00 -
296.03/296.24 c strong branching : 46.95 3595 200138 55.67 4262.79
296.03/296.24 c (at root node) : - 22 3514 159.73 -
296.03/296.24 c conflict analysis: 0.00 0 0 0.00 -
296.03/296.24 c B&B Tree :
296.03/296.24 c number of runs : 1
296.03/296.24 c nodes : 27520
296.03/296.24 c nodes (total) : 27520
296.03/296.24 c nodes left : 0
296.03/296.24 c max depth : 52
296.03/296.24 c max depth (total): 52
296.03/296.24 c backtracks : 2822 (10.3%)
296.03/296.24 c delayed cutoffs : 47
296.03/296.24 c repropagations : 1802 (4931 domain reductions, 47 cutoffs)
296.03/296.24 c avg switch length: 4.23
296.03/296.24 c switching time : 3.85
296.03/296.24 c Solution :
296.03/296.24 c Solutions found : 0 (0 improvements)
296.03/296.24 c Primal Bound : infeasible
296.03/296.24 c Dual Bound : -
296.03/296.24 c Gap : 0.00 %
296.03/296.24 c Root Dual Bound : +1.10000000000000e+01
296.03/296.26 c Time complete: 296.09.