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-1868283-1245119120.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.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 | 54 |3513k| 0 | 37 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 140 |3651k| 0 | 60 | 231 |2564 |2564 | 231 |2568 | 4 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.48 c 0.4s| 1 | 0 | 345 |3837k| 0 | 51 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.88 c 0.8s| 1 | 0 | 573 |3908k| 0 | 50 | 231 |2564 |2564 | 231 |2576 | 12 | 0 | 0 | 1.100000e+01 | -- | Inf
1.29/1.33 c 1.2s| 1 | 0 | 686 |3997k| 0 | 51 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
1.68/1.73 c 1.6s| 1 | 0 | 807 |4105k| 0 | 51 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
2.59/2.68 c 2.6s| 1 | 2 | 807 |4105k| 0 | 51 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 19 | 1.100000e+01 | -- | Inf
148.64/148.72 c 148s| 10000 | 672 |401831 |6179k| 53 | - | 231 |2969 | 950 | 231 |2569 | 14 |1019 |2293 | 1.500000e+01 | -- | Inf
254.71/254.87 c 253s| 20000 | 549 |769631 |6144k| 53 | - | 231 |2779 |1521 | 231 |2569 | 14 |1671 |2584 | 1.500000e+01 | -- | Inf
344.49/344.68 c
344.49/344.68 c SCIP Status : problem is solved [infeasible]
344.49/344.68 c Solving Time (sec) : 342.43
344.49/344.68 c Solving Nodes : 28978
344.49/344.68 c Primal Bound : +1.00000000000000e+20 (0 solutions)
344.49/344.68 c Dual Bound : +1.00000000000000e+20
344.49/344.68 c Gap : 0.00 %
344.49/344.68 c NODE 28978
344.49/344.68 c DUAL BOUND 1e+20
344.49/344.68 c PRIMAL BOUND 1e+20
344.49/344.68 c GAP 0
344.49/344.68 s UNSATISFIABLE
344.49/344.68 c SCIP Status : problem is solved [infeasible]
344.49/344.68 c Solving Time : 342.43
344.49/344.68 c Original Problem :
344.49/344.68 c Problem name : HOME/instance-1868283-1245119120.opb
344.49/344.68 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
344.49/344.68 c Constraints : 2707 initial, 2707 maximal
344.49/344.68 c Presolved Problem :
344.49/344.68 c Problem name : t_HOME/instance-1868283-1245119120.opb
344.49/344.68 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
344.49/344.68 c Constraints : 2564 initial, 3015 maximal
344.49/344.68 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
344.49/344.68 c trivial : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c dualfix : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c boundshift : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c inttobinary : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c implics : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c probing : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c knapsack : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c setppc : 0.00 0 0 0 0 0 0 0 0
344.49/344.68 c linear : 0.02 0 0 0 0 0 143 0 0
344.49/344.68 c logicor : 0.03 0 0 0 0 0 0 0 0
344.49/344.68 c root node : - 1 - - 1 - - - -
344.49/344.68 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
344.49/344.68 c integral : 0 0 0 15271 0 124 1191 0 0 29056
344.49/344.68 c knapsack : 1 5 61313 0 0 152 70965 0 0 0
344.49/344.68 c setppc : 22 5 61325 0 0 777 158838 0 0 0
344.49/344.68 c logicor : 2541+ 5 52949 0 0 145 161350 0 0 0
344.49/344.68 c countsols : 0 0 0 0 0 0 0 0 0 0
344.49/344.68 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
344.49/344.68 c integral : 55.97 0.00 0.00 55.97 0.00
344.49/344.68 c knapsack : 0.24 0.00 0.24 0.00 0.00
344.49/344.68 c setppc : 0.77 0.00 0.77 0.00 0.00
344.49/344.68 c logicor : 3.66 0.00 3.66 0.00 0.00
344.49/344.68 c countsols : 0.00 0.00 0.00 0.00 0.00
344.49/344.68 c Propagators : Time Calls Cutoffs DomReds
344.49/344.68 c rootredcost : 0.03 0 0 0
344.49/344.68 c pseudoobj : 0.98 61485 1 0
344.49/344.68 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
344.49/344.68 c propagation : 0.09 1074 1073 4754 15.8 16 13.3 -
344.49/344.68 c infeasible LP : 0.46 13330 0 0 0.0 0 0.0 0
344.49/344.68 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
344.49/344.68 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
344.49/344.68 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
344.49/344.68 c applied globally : - - - 2456 14.4 - - -
344.49/344.68 c applied locally : - - - 0 0.0 - - -
344.49/344.68 c Separators : Time Calls Cutoffs DomReds Cuts Conss
344.49/344.68 c cut pool : 0.00 4 - - 4 - (maximal pool size: 241)
344.49/344.68 c redcost : 0.25 14698 0 0 0 0
344.49/344.68 c impliedbounds : 0.00 5 0 0 0 0
344.49/344.68 c intobj : 0.00 0 0 0 0 0
344.49/344.68 c gomory : 0.73 5 0 0 1526 0
344.49/344.68 c strongcg : 0.60 5 0 0 2064 0
344.49/344.68 c cmir : 0.00 0 0 0 0 0
344.49/344.68 c flowcover : 0.00 0 0 0 0 0
344.49/344.68 c clique : 0.00 5 0 0 0 0
344.49/344.68 c zerohalf : 0.00 0 0 0 0 0
344.49/344.68 c mcf : 0.00 1 0 0 0 0
344.49/344.68 c Pricers : Time Calls Vars
344.49/344.68 c problem variables: 0.00 0 0
344.49/344.68 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
344.49/344.68 c relpscost : 55.95 15271 124 1191 0 0 29056
344.49/344.68 c pscost : 0.00 0 0 0 0 0 0
344.49/344.68 c inference : 0.00 0 0 0 0 0 0
344.49/344.68 c mostinf : 0.00 0 0 0 0 0 0
344.49/344.68 c leastinf : 0.00 0 0 0 0 0 0
344.49/344.68 c fullstrong : 0.00 0 0 0 0 0 0
344.49/344.68 c allfullstrong : 0.00 0 0 0 0 0 0
344.49/344.68 c random : 0.00 0 0 0 0 0 0
344.49/344.68 c Primal Heuristics : Time Calls Found
344.49/344.68 c LP solutions : 0.00 - 0
344.49/344.68 c pseudo solutions : 0.00 - 0
344.49/344.68 c simplerounding : 0.00 0 0
344.49/344.68 c rounding : 0.00 0 0
344.49/344.68 c shifting : 0.00 0 0
344.49/344.68 c intshifting : 0.00 0 0
344.49/344.68 c oneopt : 0.00 0 0
344.49/344.68 c fixandinfer : 0.00 0 0
344.49/344.68 c feaspump : 0.00 0 0
344.49/344.68 c coefdiving : 0.00 0 0
344.49/344.68 c pscostdiving : 0.00 0 0
344.49/344.68 c fracdiving : 0.00 0 0
344.49/344.68 c veclendiving : 0.00 0 0
344.49/344.68 c intdiving : 0.00 0 0
344.49/344.68 c actconsdiving : 0.00 0 0
344.49/344.68 c objpscostdiving : 0.00 0 0
344.49/344.68 c rootsoldiving : 0.00 0 0
344.49/344.68 c linesearchdiving : 0.00 0 0
344.49/344.68 c guideddiving : 0.00 0 0
344.49/344.68 c octane : 0.00 0 0
344.49/344.68 c rens : 0.00 0 0
344.49/344.68 c rins : 0.00 0 0
344.49/344.68 c localbranching : 0.00 0 0
344.49/344.68 c mutation : 0.00 0 0
344.49/344.68 c crossover : 0.00 0 0
344.49/344.68 c dins : 0.00 0 0
344.49/344.68 c LP : Time Calls Iterations Iter/call Iter/sec
344.49/344.68 c primal LP : 0.01 0 0 0.00 0.00
344.49/344.68 c dual LP : 264.71 28520 1043880 36.60 3943.49
344.49/344.68 c barrier LP : 0.00 0 0 0.00 -
344.49/344.68 c diving/probing LP: 0.00 0 0 0.00 -
344.49/344.68 c strong branching : 55.32 3163 228435 72.22 4129.34
344.49/344.68 c (at root node) : - 19 3175 167.11 -
344.49/344.68 c conflict analysis: 0.00 0 0 0.00 -
344.49/344.68 c B&B Tree :
344.49/344.68 c number of runs : 1
344.49/344.68 c nodes : 28978
344.49/344.68 c nodes (total) : 28978
344.49/344.68 c nodes left : 0
344.49/344.68 c max depth : 53
344.49/344.68 c max depth (total): 53
344.49/344.68 c backtracks : 3038 (10.5%)
344.49/344.68 c delayed cutoffs : 79
344.49/344.68 c repropagations : 2548 (7255 domain reductions, 79 cutoffs)
344.49/344.68 c avg switch length: 4.16
344.49/344.68 c switching time : 4.25
344.49/344.68 c Solution :
344.49/344.68 c Solutions found : 0 (0 improvements)
344.49/344.68 c Primal Bound : infeasible
344.49/344.68 c Dual Bound : -
344.49/344.68 c Gap : 0.00 %
344.49/344.68 c Root Dual Bound : +1.10000000000000e+01
344.59/344.70 c Time complete: 344.59.