0.03/0.05 c SCIP version 1.1.0.7
0.03/0.05 c LP-Solver Clp 1.8.2
0.03/0.05 c user parameter file <scip.set> not found - using default parameters
0.03/0.05 c read problem <HOME/instance-1868269-1245118570.opb>
0.03/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.03/0.06 c No objective function, only one solution is needed.
0.03/0.06 c start presolving problem
0.03/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.06
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 | 62 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 84 |3728k| 0 | 34 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 320 |4152k| 0 | 50 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 557 |4404k| 0 | 51 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
1.10/1.12 c 1.0s| 1 | 0 | 730 |4675k| 0 | 51 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 0 | 1.100000e+01 | -- | Inf
1.49/1.51 c 1.4s| 1 | 0 | 901 |4813k| 0 | 58 | 231 |2564 |2564 | 231 |2586 | 22 | 0 | 0 | 1.100000e+01 | -- | Inf
2.79/2.86 c 2.8s| 1 | 2 | 901 |4814k| 0 | 58 | 231 |2564 |2564 | 231 |2586 | 22 | 0 | 18 | 1.100000e+01 | -- | Inf
133.53/133.69 c 133s| 10000 | 690 |341787 |6834k| 64 | 22 | 231 |2817 |1572 | 231 |2566 | 22 | 616 |2633 | 1.400000e+01 | -- | Inf
226.21/226.36 c 225s| 20000 | 722 |643068 |7150k| 64 | - | 231 |2762 |1297 | 231 |2566 | 22 |1113 |3114 | 1.500000e+01 | -- | Inf
317.57/317.79 c 316s| 30000 | 512 |919300 |6827k| 64 | - | 231 |2816 |1241 | 231 |2566 | 22 |1573 |3856 | 1.600000e+01 | -- | Inf
363.76/363.96 c
363.76/363.96 c SCIP Status : problem is solved [infeasible]
363.76/363.96 c Solving Time (sec) : 361.52
363.76/363.96 c Solving Nodes : 35675
363.76/363.96 c Primal Bound : +1.00000000000000e+20 (0 solutions)
363.76/363.96 c Dual Bound : +1.00000000000000e+20
363.76/363.96 c Gap : 0.00 %
363.76/363.96 c NODE 35675
363.76/363.96 c DUAL BOUND 1e+20
363.76/363.96 c PRIMAL BOUND 1e+20
363.76/363.96 c GAP 0
363.76/363.96 s UNSATISFIABLE
363.76/363.96 c SCIP Status : problem is solved [infeasible]
363.76/363.96 c Solving Time : 361.52
363.76/363.96 c Original Problem :
363.76/363.96 c Problem name : HOME/instance-1868269-1245118570.opb
363.76/363.96 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
363.76/363.96 c Constraints : 2707 initial, 2707 maximal
363.76/363.96 c Presolved Problem :
363.76/363.96 c Problem name : t_HOME/instance-1868269-1245118570.opb
363.76/363.96 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
363.76/363.96 c Constraints : 2564 initial, 2839 maximal
363.76/363.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
363.76/363.96 c trivial : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c implics : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c probing : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c knapsack : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c setppc : 0.00 0 0 0 0 0 0 0 0
363.76/363.96 c linear : 0.03 0 0 0 0 0 143 0 0
363.76/363.96 c logicor : 0.03 0 0 0 0 0 0 0 0
363.76/363.96 c root node : - 1 - - 1 - - - -
363.76/363.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
363.76/363.96 c integral : 0 0 0 19227 0 233 1994 0 0 35712
363.76/363.96 c knapsack : 1 5 71780 0 0 84 66065 0 0 0
363.76/363.96 c setppc : 22 5 71743 0 0 513 193031 0 0 0
363.76/363.96 c logicor : 2541+ 5 64810 0 0 183 202291 0 0 0
363.76/363.96 c countsols : 0 0 0 0 0 0 0 0 0 0
363.76/363.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
363.76/363.96 c integral : 55.80 0.00 0.00 55.80 0.00
363.76/363.96 c knapsack : 0.30 0.00 0.30 0.00 0.00
363.76/363.96 c setppc : 0.87 0.00 0.87 0.00 0.00
363.76/363.96 c logicor : 4.47 0.00 4.47 0.00 0.00
363.76/363.96 c countsols : 0.00 0.00 0.00 0.00 0.00
363.76/363.96 c Propagators : Time Calls Cutoffs DomReds
363.76/363.96 c rootredcost : 0.05 0 0 0
363.76/363.96 c pseudoobj : 1.15 71836 1 0
363.76/363.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
363.76/363.96 c propagation : 0.05 780 780 3523 16.2 13 12.5 -
363.76/363.96 c infeasible LP : 0.62 16843 0 0 0.0 0 0.0 0
363.76/363.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
363.76/363.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
363.76/363.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
363.76/363.96 c applied globally : - - - 1846 14.9 - - -
363.76/363.96 c applied locally : - - - 4 34.0 - - -
363.76/363.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
363.76/363.96 c cut pool : 0.00 4 - - 4 - (maximal pool size: 478)
363.76/363.96 c redcost : 0.34 18149 0 0 0 0
363.76/363.96 c impliedbounds : 0.00 5 0 0 0 0
363.76/363.96 c intobj : 0.00 0 0 0 0 0
363.76/363.96 c gomory : 0.66 5 0 0 2066 0
363.76/363.96 c strongcg : 0.40 5 0 0 2500 0
363.76/363.96 c cmir : 0.00 0 0 0 0 0
363.76/363.96 c flowcover : 0.00 0 0 0 0 0
363.76/363.96 c clique : 0.00 5 0 0 0 0
363.76/363.96 c zerohalf : 0.00 0 0 0 0 0
363.76/363.96 c mcf : 0.00 1 0 0 0 0
363.76/363.96 c Pricers : Time Calls Vars
363.76/363.96 c problem variables: 0.00 0 0
363.76/363.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
363.76/363.96 c relpscost : 55.70 19227 233 1994 0 0 35712
363.76/363.96 c pscost : 0.00 0 0 0 0 0 0
363.76/363.96 c inference : 0.00 0 0 0 0 0 0
363.76/363.96 c mostinf : 0.00 0 0 0 0 0 0
363.76/363.96 c leastinf : 0.00 0 0 0 0 0 0
363.76/363.96 c fullstrong : 0.00 0 0 0 0 0 0
363.76/363.96 c allfullstrong : 0.00 0 0 0 0 0 0
363.76/363.96 c random : 0.00 0 0 0 0 0 0
363.76/363.96 c Primal Heuristics : Time Calls Found
363.76/363.96 c LP solutions : 0.00 - 0
363.76/363.96 c pseudo solutions : 0.00 - 0
363.76/363.96 c simplerounding : 0.00 0 0
363.76/363.96 c rounding : 0.00 0 0
363.76/363.96 c shifting : 0.00 0 0
363.76/363.96 c intshifting : 0.00 0 0
363.76/363.96 c oneopt : 0.00 0 0
363.76/363.96 c fixandinfer : 0.00 0 0
363.76/363.96 c feaspump : 0.00 0 0
363.76/363.96 c coefdiving : 0.00 0 0
363.76/363.96 c pscostdiving : 0.00 0 0
363.76/363.96 c fracdiving : 0.00 0 0
363.76/363.96 c veclendiving : 0.00 0 0
363.76/363.96 c intdiving : 0.00 0 0
363.76/363.96 c actconsdiving : 0.00 0 0
363.76/363.96 c objpscostdiving : 0.00 0 0
363.76/363.96 c rootsoldiving : 0.00 0 0
363.76/363.96 c linesearchdiving : 0.00 0 0
363.76/363.96 c guideddiving : 0.00 0 0
363.76/363.96 c octane : 0.00 0 0
363.76/363.96 c rens : 0.00 0 0
363.76/363.96 c rins : 0.00 0 0
363.76/363.96 c localbranching : 0.00 0 0
363.76/363.96 c mutation : 0.00 0 0
363.76/363.96 c crossover : 0.00 0 0
363.76/363.96 c dins : 0.00 0 0
363.76/363.96 c LP : Time Calls Iterations Iter/call Iter/sec
363.76/363.96 c primal LP : 0.01 0 0 0.00 0.00
363.76/363.96 c dual LP : 279.61 35987 1044510 29.02 3735.60
363.76/363.96 c barrier LP : 0.00 0 0 0.00 -
363.76/363.96 c diving/probing LP: 0.00 0 0 0.00 -
363.76/363.96 c strong branching : 54.87 4268 228511 53.54 4164.59
363.76/363.96 c (at root node) : - 18 3672 204.00 -
363.76/363.96 c conflict analysis: 0.00 0 0 0.00 -
363.76/363.96 c B&B Tree :
363.76/363.96 c number of runs : 1
363.76/363.96 c nodes : 35675
363.76/363.96 c nodes (total) : 35675
363.76/363.96 c nodes left : 0
363.76/363.96 c max depth : 64
363.76/363.96 c max depth (total): 64
363.76/363.96 c backtracks : 3720 (10.4%)
363.76/363.96 c delayed cutoffs : 38
363.76/363.96 c repropagations : 1716 (5058 domain reductions, 38 cutoffs)
363.76/363.96 c avg switch length: 4.50
363.76/363.96 c switching time : 5.00
363.76/363.96 c Solution :
363.76/363.96 c Solutions found : 0 (0 improvements)
363.76/363.96 c Primal Bound : infeasible
363.76/363.96 c Dual Bound : -
363.76/363.96 c Gap : 0.00 %
363.76/363.96 c Root Dual Bound : +1.10000000000000e+01
363.76/363.98 c Time complete: 363.84.