0.19/0.26 c SCIP version 1.1.0.7
0.19/0.26 c LP-Solver SoPlex 1.4.1
0.19/0.26 c user parameter file <scip.set> not found - using default parameters
0.19/0.26 c read problem <HOME/instance-1868576-1245128575.opb>
0.19/0.26 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.29/0.34 c No objective function, only one solution is needed.
0.29/0.34 c start presolving problem
0.29/0.34 c presolving:
0.59/0.65 c (round 1) 1228 del vars, 2251 del conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 297846 impls, 0 clqs
0.59/0.69 c (round 2) 1256 del vars, 3394 del conss, 796 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 297952 impls, 0 clqs
0.69/0.70 c (round 3) 1259 del vars, 3403 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298044 impls, 0 clqs
0.69/0.72 c (round 4) 1260 del vars, 3410 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298224 impls, 0 clqs
0.69/0.73 c (round 5) 1260 del vars, 3412 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298224 impls, 0 clqs
0.79/0.88 c (round 6) 1260 del vars, 3467 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 13214 upgd conss, 298224 impls, 0 clqs
0.89/0.96 c (round 7) 1260 del vars, 3467 del conss, 797 chg bounds, 374 chg sides, 881 chg coeffs, 13217 upgd conss, 298224 impls, 0 clqs
0.89/0.99 c presolving (8 rounds):
0.89/0.99 c 1260 deleted vars, 3467 deleted constraints, 797 tightened bounds, 0 added holes, 374 changed sides, 881 changed coefficients
0.89/0.99 c 298224 implications, 0 cliques
0.89/0.99 c presolved problem has 4799 variables (4799 bin, 0 int, 0 impl, 0 cont) and 13217 constraints
0.89/0.99 c 716 constraints of type <knapsack>
0.89/0.99 c 12501 constraints of type <logicor>
0.89/0.99 c transformed objective value is always integral (scale: 1)
0.89/0.99 c Presolving Time: 0.58
0.89/0.99 c SATUNSAT-LIN
0.89/0.99 c -----------------------------------------------------------------------------------------------
0.89/0.99 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.99 c separating/flowcover/freq = c -1
0.89/0.99 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.99 c separating/cmir/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/veclendiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/veclendiving/freq = c -1
0.89/0.99 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.99 c heuristics/simplerounding/freq = c -1
0.89/0.99 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/shifting/freq = c -1
0.89/0.99 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.99 c heuristics/rounding/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.89/0.99 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.89/0.99 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.99 c heuristics/rootsoldiving/freq = c -1
0.89/0.99 c # number of nodes added to the contingent of the total nodes
0.89/0.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.99 c heuristics/rens/nodesofs = c 2000
0.89/0.99 c # minimum percentage of integer variables that have to be fixable
0.89/0.99 c # [type: real, range: [0,1], default: 0.5]
0.89/0.99 c heuristics/rens/minfixingrate = c 0.3
0.89/0.99 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.99 c heuristics/rens/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/pscostdiving/freq = c -1
0.89/0.99 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.99 c heuristics/oneopt/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to total iteration number
0.89/0.99 c # [type: real, range: [0,1], default: 0.01]
0.89/0.99 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.89/0.99 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.99 c heuristics/objpscostdiving/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/linesearchdiving/freq = c -1
0.89/0.99 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/intshifting/freq = c -1
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/intdiving/maxlpiterquot = c 0.075
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/guideddiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/guideddiving/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/fracdiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/fracdiving/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/feaspump/maxlpiterofs = c 2000
0.89/0.99 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.99 c heuristics/feaspump/freq = c -1
0.89/0.99 c # minimum percentage of integer variables that have to be fixed
0.89/0.99 c # [type: real, range: [0,1], default: 0.666]
0.89/0.99 c heuristics/crossover/minfixingrate = c 0.5
0.89/0.99 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.89/0.99 c # [type: real, range: [0,1], default: 0.1]
0.89/0.99 c heuristics/crossover/nodesquot = c 0.15
0.89/0.99 c # number of nodes without incumbent change that heuristic should wait
0.89/0.99 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.89/0.99 c heuristics/crossover/nwaitingnodes = c 100
0.89/0.99 c # number of nodes added to the contingent of the total nodes
0.89/0.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.99 c heuristics/crossover/nodesofs = c 750
0.89/0.99 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 30]
0.89/0.99 c heuristics/crossover/freq = c -1
0.89/0.99 c # additional number of allowed LP iterations
0.89/0.99 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.99 c heuristics/coefdiving/maxlpiterofs = c 1500
0.89/0.99 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.99 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.89/0.99 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.99 c heuristics/coefdiving/freq = c -1
0.89/0.99 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.99 c presolving/probing/maxrounds = c 0
0.89/0.99 c # should presolving try to simplify knapsacks
0.89/0.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.99 c constraints/knapsack/simplifyinequalities = c TRUE
0.89/0.99 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.89/0.99 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.89/0.99 c constraints/knapsack/disaggregation = c FALSE
0.89/0.99 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.99 c constraints/knapsack/maxnumcardlift = c 0
0.89/0.99 c # should presolving try to simplify inequalities
0.89/0.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.99 c constraints/linear/simplifyinequalities = c TRUE
0.89/0.99 c # maximal number of separation rounds in the root node (-1: unlimited)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.99 c separating/maxroundsroot = c 5
0.89/0.99 c # maximal number of separation rounds per node (-1: unlimited)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 5]
0.89/0.99 c separating/maxrounds = c 1
0.89/0.99 c # solving stops, if the given number of solutions were found (-1: no limit)
0.89/0.99 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.99 c limits/solutions = c 1
0.89/0.99 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.99 c limits/memory = c 1620
0.89/0.99 c # maximal time in seconds to run
0.89/0.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.99 c limits/time = c 1791
0.89/0.99 c # frequency for displaying node information lines
0.89/0.99 c # [type: int, range: [-1,2147483647], default: 100]
0.89/0.99 c display/freq = c 10000
0.89/0.99 c -----------------------------------------------------------------------------------------------
0.89/0.99 c start solving problem
0.89/0.99 c
1.79/1.88 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.88 c 1.5s| 1 | 0 | 1386 | 37M| 0 | 818 |4799 | 13k| 13k|4799 | 13k| 0 | 0 | 0 | 4.391653e+02 | -- | Inf
3.29/3.33 c 2.9s| 1 | 0 | 1927 | 37M| 0 | 850 |4799 | 13k| 13k|4799 | 13k| 86 | 0 | 0 | 5.085020e+02 | -- | Inf
4.29/4.32 c 3.9s| 1 | 0 | 2387 | 37M| 0 | 843 |4799 | 13k| 13k|4799 | 13k| 209 | 0 | 0 | 5.329210e+02 | -- | Inf
5.69/5.74 c 5.3s| 1 | 0 | 2989 | 38M| 0 | 894 |4799 | 13k| 13k|4799 | 13k| 357 | 0 | 0 | 5.581709e+02 | -- | Inf
7.39/7.44 c 7.0s| 1 | 0 | 3776 | 38M| 0 | 988 |4799 | 13k| 13k|4799 | 13k| 459 | 0 | 0 | 5.767873e+02 | -- | Inf
13.09/13.11 c 12.6s| 1 | 0 | 4783 | 39M| 0 | 948 |4799 | 13k| 13k|4799 | 13k| 619 | 0 | 0 | 6.226272e+02 | -- | Inf
28.68/28.70 c 28.2s| 1 | 2 | 4783 | 39M| 0 | 948 |4799 | 13k| 13k|4799 | 13k| 619 | 0 | 24 | 6.226272e+02 | -- | Inf
273.52/273.68 c
273.52/273.68 c SCIP Status : problem is solved [infeasible]
273.52/273.68 c Solving Time (sec) : 272.45
273.52/273.68 c Solving Nodes : 157
273.52/273.68 c Primal Bound : +1.00000000000000e+20 (0 solutions)
273.52/273.68 c Dual Bound : +1.00000000000000e+20
273.52/273.68 c Gap : 0.00 %
273.52/273.68 c NODE 157
273.52/273.68 c DUAL BOUND 1e+20
273.52/273.68 c PRIMAL BOUND 1e+20
273.52/273.68 c GAP 0
273.52/273.68 s UNSATISFIABLE
273.52/273.68 c SCIP Status : problem is solved [infeasible]
273.52/273.68 c Solving Time : 272.45
273.52/273.68 c Original Problem :
273.52/273.68 c Problem name : HOME/instance-1868576-1245128575.opb
273.52/273.68 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
273.52/273.68 c Constraints : 16684 initial, 16684 maximal
273.52/273.68 c Presolved Problem :
273.52/273.68 c Problem name : t_HOME/instance-1868576-1245128575.opb
273.52/273.68 c Variables : 4799 (4799 binary, 0 integer, 0 implicit integer, 0 continuous)
273.52/273.68 c Constraints : 13217 initial, 13346 maximal
273.52/273.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
273.52/273.68 c trivial : 0.01 3 0 0 0 0 0 0 0
273.52/273.68 c dualfix : 0.00 0 0 0 0 0 0 0 0
273.52/273.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
273.52/273.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
273.52/273.68 c implics : 0.05 0 456 0 0 0 0 0 0
273.52/273.68 c probing : 0.00 0 0 0 0 0 0 0 0
273.52/273.68 c knapsack : 0.05 0 0 0 0 0 0 0 0
273.52/273.68 c linear : 0.35 797 4 0 797 0 3467 374 881
273.52/273.68 c logicor : 0.09 0 0 0 0 0 0 0 0
273.52/273.68 c root node : - 391 - - 391 - - - -
273.52/273.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
273.52/273.68 c integral : 0 0 0 134 0 2 21 0 0 252
273.52/273.68 c knapsack : 716 5 3055 0 0 0 8 1000 0 0
273.52/273.68 c logicor : 12501+ 5 2981 0 0 56 37261 0 0 0
273.52/273.68 c countsols : 0 0 0 0 0 0 0 0 0 0
273.52/273.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
273.52/273.68 c integral : 212.99 0.00 0.00 212.99 0.00
273.52/273.68 c knapsack : 0.20 0.02 0.18 0.00 0.00
273.52/273.68 c logicor : 0.38 0.00 0.38 0.00 0.00
273.52/273.68 c countsols : 0.00 0.00 0.00 0.00 0.00
273.52/273.68 c Propagators : Time Calls Cutoffs DomReds
273.52/273.68 c rootredcost : 0.01 0 0 0
273.52/273.68 c pseudoobj : 1.28 3066 0 0
273.52/273.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
273.52/273.68 c propagation : 0.00 56 47 151 18.4 10 10.3 -
273.52/273.68 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
273.52/273.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
273.52/273.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
273.52/273.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
273.52/273.68 c applied globally : - - - 129 17.0 - - -
273.52/273.68 c applied locally : - - - 0 0.0 - - -
273.52/273.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
273.52/273.68 c cut pool : 0.00 4 - - 631 - (maximal pool size: 2350)
273.52/273.68 c redcost : 0.09 132 0 0 0 0
273.52/273.68 c impliedbounds : 0.03 5 0 0 0 0
273.52/273.68 c intobj : 0.00 0 0 0 0 0
273.52/273.68 c gomory : 3.13 5 0 0 2500 0
273.52/273.68 c strongcg : 2.52 5 0 0 2500 0
273.52/273.68 c cmir : 0.00 0 0 0 0 0
273.52/273.68 c flowcover : 0.00 0 0 0 0 0
273.52/273.68 c clique : 0.37 5 0 0 38 0
273.52/273.68 c zerohalf : 0.00 0 0 0 0 0
273.52/273.68 c mcf : 0.09 1 0 0 0 0
273.52/273.68 c Pricers : Time Calls Vars
273.52/273.68 c problem variables: 0.00 0 0
273.52/273.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
273.52/273.68 c relpscost : 212.99 134 2 21 0 0 252
273.52/273.68 c pscost : 0.00 0 0 0 0 0 0
273.52/273.68 c inference : 0.00 0 0 0 0 0 0
273.52/273.68 c mostinf : 0.00 0 0 0 0 0 0
273.52/273.68 c leastinf : 0.00 0 0 0 0 0 0
273.52/273.68 c fullstrong : 0.00 0 0 0 0 0 0
273.52/273.68 c allfullstrong : 0.00 0 0 0 0 0 0
273.52/273.68 c random : 0.00 0 0 0 0 0 0
273.52/273.68 c Primal Heuristics : Time Calls Found
273.52/273.68 c LP solutions : 0.00 - 0
273.52/273.68 c pseudo solutions : 0.00 - 0
273.52/273.68 c simplerounding : 0.00 0 0
273.52/273.68 c rounding : 0.00 0 0
273.52/273.68 c shifting : 0.00 0 0
273.52/273.68 c intshifting : 0.00 0 0
273.52/273.68 c oneopt : 0.00 0 0
273.52/273.68 c fixandinfer : 0.00 0 0
273.52/273.68 c feaspump : 0.00 0 0
273.52/273.68 c coefdiving : 0.00 0 0
273.52/273.68 c pscostdiving : 0.00 0 0
273.52/273.68 c fracdiving : 0.00 0 0
273.52/273.68 c veclendiving : 0.00 0 0
273.52/273.68 c intdiving : 0.00 0 0
273.52/273.68 c actconsdiving : 0.00 0 0
273.52/273.68 c objpscostdiving : 0.00 0 0
273.52/273.68 c rootsoldiving : 0.00 0 0
273.52/273.68 c linesearchdiving : 0.00 0 0
273.52/273.68 c guideddiving : 0.00 0 0
273.52/273.68 c octane : 0.00 0 0
273.52/273.68 c rens : 0.00 0 0
273.52/273.68 c rins : 0.00 0 0
273.52/273.68 c localbranching : 0.00 0 0
273.52/273.68 c mutation : 0.00 0 0
273.52/273.68 c crossover : 0.00 0 0
273.52/273.68 c dins : 0.00 0 0
273.52/273.68 c LP : Time Calls Iterations Iter/call Iter/sec
273.52/273.68 c primal LP : 0.01 0 0 0.00 0.00
273.52/273.68 c dual LP : 49.26 139 30943 222.61 628.16
273.52/273.68 c barrier LP : 0.00 0 0 0.00 -
273.52/273.68 c diving/probing LP: 0.00 0 0 0.00 -
273.52/273.68 c strong branching : 212.89 291 125192 430.21 588.06
273.52/273.68 c (at root node) : - 24 9034 376.42 -
273.52/273.68 c conflict analysis: 0.00 0 0 0.00 -
273.52/273.68 c B&B Tree :
273.52/273.68 c number of runs : 1
273.52/273.68 c nodes : 157
273.52/273.68 c nodes (total) : 157
273.52/273.68 c nodes left : 0
273.52/273.68 c max depth : 33
273.52/273.68 c max depth (total): 33
273.52/273.68 c backtracks : 32 (20.4%)
273.52/273.68 c delayed cutoffs : 96
273.52/273.68 c repropagations : 111 (9153 domain reductions, 27 cutoffs)
273.52/273.68 c avg switch length: 3.06
273.52/273.68 c switching time : 0.26
273.52/273.68 c Solution :
273.52/273.68 c Solutions found : 0 (0 improvements)
273.52/273.68 c Primal Bound : infeasible
273.52/273.68 c Dual Bound : -
273.52/273.68 c Gap : 0.00 %
273.52/273.68 c Root Dual Bound : +6.22627161973500e+02
273.62/273.79 c Time complete: 273.71.