0.39/0.43 c SCIP version 1.1.0.7
0.39/0.43 c LP-Solver Clp 1.8.2
0.39/0.43 c user parameter file <scip.set> not found - using default parameters
0.39/0.43 c read problem <HOME/instance-1884628-1245259773.opb>
0.39/0.43 c original problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 23747 constraints
0.49/0.52 c No objective function, only one solution is needed.
0.49/0.52 c start presolving problem
0.49/0.52 c presolving:
0.59/0.64 c (round 1) 68 del vars, 116 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1110 impls, 0 clqs
0.69/0.73 c (round 2) 68 del vars, 11636 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1110 impls, 0 clqs
1.79/1.88 c (round 3) 68 del vars, 16223 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.39/2.43 c (round 4) 68 del vars, 17569 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.49/2.51 c (round 5) 68 del vars, 17673 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.49/2.56 c (round 6) 68 del vars, 17713 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.49/2.60 c (round 7) 68 del vars, 17723 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.59/2.62 c (round 8) 68 del vars, 17725 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.69/2.74 c (round 9) 68 del vars, 18021 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.69/2.74 c presolving (10 rounds):
2.69/2.74 c 68 deleted vars, 18021 deleted constraints, 64 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.69/2.74 c 1110 implications, 0 cliques
2.69/2.74 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 5726 constraints
2.69/2.74 c 15 constraints of type <linear>
2.69/2.74 c 5711 constraints of type <logicor>
2.69/2.74 c transformed objective value is always integral (scale: 1)
2.69/2.74 c Presolving Time: 2.13
2.69/2.74 c SATUNSAT-LIN
2.69/2.74 c -----------------------------------------------------------------------------------------------
2.69/2.74 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 0]
2.69/2.74 c separating/flowcover/freq = c -1
2.69/2.74 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 0]
2.69/2.74 c separating/cmir/freq = c -1
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/veclendiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.74 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.69/2.74 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.74 c heuristics/veclendiving/freq = c -1
2.69/2.74 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 1]
2.69/2.74 c heuristics/simplerounding/freq = c -1
2.69/2.74 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.74 c heuristics/shifting/freq = c -1
2.69/2.74 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 1]
2.69/2.74 c heuristics/rounding/freq = c -1
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.69/2.74 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.69/2.74 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 20]
2.69/2.74 c heuristics/rootsoldiving/freq = c -1
2.69/2.74 c # number of nodes added to the contingent of the total nodes
2.69/2.74 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.69/2.74 c heuristics/rens/nodesofs = c 2000
2.69/2.74 c # minimum percentage of integer variables that have to be fixable
2.69/2.74 c # [type: real, range: [0,1], default: 0.5]
2.69/2.74 c heuristics/rens/minfixingrate = c 0.3
2.69/2.74 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 0]
2.69/2.74 c heuristics/rens/freq = c -1
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.74 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.69/2.74 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.74 c heuristics/pscostdiving/freq = c -1
2.69/2.74 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 1]
2.69/2.74 c heuristics/oneopt/freq = c -1
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to total iteration number
2.69/2.74 c # [type: real, range: [0,1], default: 0.01]
2.69/2.74 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.69/2.74 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 20]
2.69/2.74 c heuristics/objpscostdiving/freq = c -1
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.74 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.69/2.74 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.74 c heuristics/linesearchdiving/freq = c -1
2.69/2.74 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.74 c heuristics/intshifting/freq = c -1
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.74 c heuristics/intdiving/maxlpiterquot = c 0.075
2.69/2.74 c # additional number of allowed LP iterations
2.69/2.74 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.74 c heuristics/guideddiving/maxlpiterofs = c 1500
2.69/2.74 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.74 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.74 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.69/2.74 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.69/2.74 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.75 c heuristics/guideddiving/freq = c -1
2.69/2.75 c # additional number of allowed LP iterations
2.69/2.75 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.75 c heuristics/fracdiving/maxlpiterofs = c 1500
2.69/2.75 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.75 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.75 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.69/2.75 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.75 c heuristics/fracdiving/freq = c -1
2.69/2.75 c # additional number of allowed LP iterations
2.69/2.75 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.75 c heuristics/feaspump/maxlpiterofs = c 2000
2.69/2.75 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 20]
2.69/2.75 c heuristics/feaspump/freq = c -1
2.69/2.75 c # minimum percentage of integer variables that have to be fixed
2.69/2.75 c # [type: real, range: [0,1], default: 0.666]
2.69/2.75 c heuristics/crossover/minfixingrate = c 0.5
2.69/2.75 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.69/2.75 c # [type: real, range: [0,1], default: 0.1]
2.69/2.75 c heuristics/crossover/nodesquot = c 0.15
2.69/2.75 c # number of nodes without incumbent change that heuristic should wait
2.69/2.75 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.69/2.75 c heuristics/crossover/nwaitingnodes = c 100
2.69/2.75 c # number of nodes added to the contingent of the total nodes
2.69/2.75 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.69/2.75 c heuristics/crossover/nodesofs = c 750
2.69/2.75 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 30]
2.69/2.75 c heuristics/crossover/freq = c -1
2.69/2.75 c # additional number of allowed LP iterations
2.69/2.75 c # [type: int, range: [0,2147483647], default: 1000]
2.69/2.75 c heuristics/coefdiving/maxlpiterofs = c 1500
2.69/2.75 c # maximal fraction of diving LP iterations compared to node LP iterations
2.69/2.75 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.69/2.75 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.69/2.75 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 10]
2.69/2.75 c heuristics/coefdiving/freq = c -1
2.69/2.75 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: -1]
2.69/2.75 c presolving/probing/maxrounds = c 0
2.69/2.75 c # should presolving try to simplify knapsacks
2.69/2.75 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.69/2.75 c constraints/knapsack/simplifyinequalities = c TRUE
2.69/2.75 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.69/2.75 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.69/2.75 c constraints/knapsack/disaggregation = c FALSE
2.69/2.75 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: -1]
2.69/2.75 c constraints/knapsack/maxnumcardlift = c 0
2.69/2.75 c # should presolving try to simplify inequalities
2.69/2.75 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.69/2.75 c constraints/linear/simplifyinequalities = c TRUE
2.69/2.75 c # maximal number of separation rounds in the root node (-1: unlimited)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: -1]
2.69/2.75 c separating/maxroundsroot = c 5
2.69/2.75 c # maximal number of separation rounds per node (-1: unlimited)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 5]
2.69/2.75 c separating/maxrounds = c 1
2.69/2.75 c # solving stops, if the given number of solutions were found (-1: no limit)
2.69/2.75 c # [type: int, range: [-1,2147483647], default: -1]
2.69/2.75 c limits/solutions = c 1
2.69/2.75 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.69/2.75 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.69/2.75 c limits/memory = c 1620
2.69/2.75 c # maximal time in seconds to run
2.69/2.75 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.69/2.75 c limits/time = c 1791
2.69/2.75 c # frequency for displaying node information lines
2.69/2.75 c # [type: int, range: [-1,2147483647], default: 100]
2.69/2.75 c display/freq = c 10000
2.69/2.75 c -----------------------------------------------------------------------------------------------
2.69/2.75 c start solving problem
2.69/2.75 c
2.79/2.82 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.79/2.82 c 2.3s| 1 | 0 | 121 | 18M| 0 | 71 | 199 |5726 |5726 | 199 |5726 | 0 | 0 | 0 | 6.400000e+01 | -- | Inf
2.89/2.98 c 2.4s| 1 | 0 | 160 | 18M| 0 | 70 | 199 |5726 |5726 | 199 |5736 | 10 | 0 | 0 | 6.466667e+01 | -- | Inf
3.09/3.14 c 2.6s| 1 | 0 | 190 | 18M| 0 | 75 | 199 |5726 |5726 | 199 |5745 | 19 | 0 | 0 | 6.550000e+01 | -- | Inf
3.30/3.36 c 2.8s| 1 | 0 | 220 | 18M| 0 | 73 | 199 |5726 |5726 | 199 |5754 | 28 | 0 | 0 | 6.633333e+01 | -- | Inf
3.59/3.68 c 3.1s| 1 | 0 | 328 | 18M| 0 | 94 | 199 |5726 |5726 | 199 |5763 | 37 | 0 | 0 | 6.766667e+01 | -- | Inf
3.99/4.09 c 3.5s| 1 | 0 | 475 | 18M| 0 | 72 | 199 |5726 |5726 | 199 |5774 | 48 | 0 | 0 | 6.866667e+01 | -- | Inf
11.99/12.08 c 11.5s| 1 | 2 | 475 | 18M| 0 | 72 | 199 |5726 |5726 | 199 |5774 | 48 | 0 | 31 | 6.866667e+01 | -- | Inf
174.34/174.42 c 172s| 10000 | 3386 |146361 | 27M| 30 | 31 | 199 |9025 |2243 | 199 |5745 | 48 | 11k|1839 | 7.900000e+01 | -- | Inf
289.70/289.84 c
289.70/289.84 c SCIP Status : problem is solved [infeasible]
289.70/289.84 c Solving Time (sec) : 286.58
289.70/289.84 c Solving Nodes : 18668
289.70/289.84 c Primal Bound : +1.00000000000000e+20 (0 solutions)
289.70/289.84 c Dual Bound : +1.00000000000000e+20
289.70/289.84 c Gap : 0.00 %
289.70/289.84 c NODE 18668
289.70/289.84 c DUAL BOUND 1e+20
289.70/289.84 c PRIMAL BOUND 1e+20
289.70/289.84 c GAP 0
289.70/289.84 s UNSATISFIABLE
289.70/289.84 c SCIP Status : problem is solved [infeasible]
289.70/289.84 c Solving Time : 286.58
289.70/289.84 c Original Problem :
289.70/289.84 c Problem name : HOME/instance-1884628-1245259773.opb
289.70/289.84 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
289.70/289.84 c Constraints : 23747 initial, 23747 maximal
289.70/289.84 c Presolved Problem :
289.70/289.84 c Problem name : t_HOME/instance-1884628-1245259773.opb
289.70/289.84 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
289.70/289.84 c Constraints : 5726 initial, 10535 maximal
289.70/289.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
289.70/289.84 c trivial : 0.00 0 0 0 0 0 0 0 0
289.70/289.84 c dualfix : 0.00 4 0 0 0 0 0 0 0
289.70/289.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
289.70/289.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
289.70/289.84 c implics : 0.00 0 0 0 0 0 0 0 0
289.70/289.84 c probing : 0.00 0 0 0 0 0 0 0 0
289.70/289.84 c linear : 0.21 64 0 0 64 0 11891 0 0
289.70/289.84 c logicor : 1.88 0 0 0 0 0 6130 0 0
289.70/289.84 c root node : - 5 - - 5 - - - -
289.70/289.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
289.70/289.84 c integral : 0 0 0 13349 0 67 1037 0 0 24760
289.70/289.84 c linear : 15 5 88353 0 0 405 3018 0 0 0
289.70/289.84 c logicor : 5711+ 5 79345 0 0 9214 207925 0 0 0
289.70/289.84 c countsols : 0 0 0 0 0 0 0 0 0 0
289.70/289.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
289.70/289.84 c integral : 45.42 0.00 0.00 45.42 0.00
289.70/289.84 c linear : 0.46 0.00 0.46 0.00 0.00
289.70/289.84 c logicor : 19.42 0.00 19.42 0.00 0.00
289.70/289.84 c countsols : 0.00 0.00 0.00 0.00 0.00
289.70/289.84 c Propagators : Time Calls Cutoffs DomReds
289.70/289.84 c rootredcost : 0.04 0 0 0
289.70/289.84 c pseudoobj : 1.16 88430 0 0
289.70/289.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
289.70/289.84 c propagation : 0.81 9619 9598 55284 19.9 2624 7.8 -
289.70/289.84 c infeasible LP : 0.00 88 0 0 0.0 0 0.0 0
289.70/289.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
289.70/289.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
289.70/289.84 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
289.70/289.84 c applied globally : - - - 31114 14.6 - - -
289.70/289.84 c applied locally : - - - 0 0.0 - - -
289.70/289.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
289.70/289.84 c cut pool : 0.00 4 - - 15 - (maximal pool size: 404)
289.70/289.84 c redcost : 0.11 12483 0 0 0 0
289.70/289.84 c impliedbounds : 0.00 5 0 0 0 0
289.70/289.84 c intobj : 0.00 0 0 0 0 0
289.70/289.84 c gomory : 0.44 5 0 0 2500 0
289.70/289.84 c strongcg : 0.41 5 0 0 2500 0
289.70/289.84 c cmir : 0.00 0 0 0 0 0
289.70/289.84 c flowcover : 0.00 0 0 0 0 0
289.70/289.84 c clique : 0.01 5 0 0 31 0
289.70/289.84 c zerohalf : 0.00 0 0 0 0 0
289.70/289.84 c mcf : 0.01 1 0 0 0 0
289.70/289.84 c Pricers : Time Calls Vars
289.70/289.84 c problem variables: 0.00 0 0
289.70/289.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
289.70/289.84 c relpscost : 45.38 13349 67 1037 0 0 24760
289.70/289.84 c pscost : 0.00 0 0 0 0 0 0
289.70/289.84 c inference : 0.00 0 0 0 0 0 0
289.70/289.84 c mostinf : 0.00 0 0 0 0 0 0
289.70/289.84 c leastinf : 0.00 0 0 0 0 0 0
289.70/289.84 c fullstrong : 0.00 0 0 0 0 0 0
289.70/289.84 c allfullstrong : 0.00 0 0 0 0 0 0
289.70/289.84 c random : 0.00 0 0 0 0 0 0
289.70/289.84 c Primal Heuristics : Time Calls Found
289.70/289.84 c LP solutions : 0.00 - 0
289.70/289.84 c pseudo solutions : 0.00 - 0
289.70/289.84 c simplerounding : 0.00 0 0
289.70/289.84 c rounding : 0.00 0 0
289.70/289.84 c shifting : 0.00 0 0
289.70/289.84 c intshifting : 0.00 0 0
289.70/289.84 c oneopt : 0.00 0 0
289.70/289.84 c fixandinfer : 0.00 0 0
289.70/289.84 c feaspump : 0.00 0 0
289.70/289.84 c coefdiving : 0.00 0 0
289.70/289.84 c pscostdiving : 0.00 0 0
289.70/289.84 c fracdiving : 0.00 0 0
289.70/289.84 c veclendiving : 0.00 0 0
289.70/289.84 c intdiving : 0.00 0 0
289.70/289.84 c actconsdiving : 0.00 0 0
289.70/289.84 c objpscostdiving : 0.00 0 0
289.70/289.84 c rootsoldiving : 0.00 0 0
289.70/289.84 c linesearchdiving : 0.00 0 0
289.70/289.84 c guideddiving : 0.00 0 0
289.70/289.84 c octane : 0.00 0 0
289.70/289.84 c rens : 0.00 0 0
289.70/289.84 c rins : 0.00 0 0
289.70/289.84 c localbranching : 0.00 0 0
289.70/289.84 c mutation : 0.00 0 0
289.70/289.84 c crossover : 0.00 0 0
289.70/289.84 c dins : 0.00 0 0
289.70/289.84 c LP : Time Calls Iterations Iter/call Iter/sec
289.70/289.84 c primal LP : 0.02 0 0 0.00 0.00
289.70/289.84 c dual LP : 181.27 13441 239986 17.85 1323.91
289.70/289.84 c barrier LP : 0.00 0 0 0.00 -
289.70/289.84 c diving/probing LP: 0.00 0 0 0.00 -
289.70/289.84 c strong branching : 44.72 2483 54826 22.08 1225.98
289.70/289.84 c (at root node) : - 31 7678 247.68 -
289.70/289.84 c conflict analysis: 0.00 0 0 0.00 -
289.70/289.84 c B&B Tree :
289.70/289.84 c number of runs : 1
289.70/289.84 c nodes : 18668
289.70/289.84 c nodes (total) : 18668
289.70/289.84 c nodes left : 0
289.70/289.84 c max depth : 31
289.70/289.84 c max depth (total): 31
289.70/289.84 c backtracks : 6984 (37.4%)
289.70/289.84 c delayed cutoffs : 6093
289.70/289.84 c repropagations : 18681 (71334 domain reductions, 3486 cutoffs)
289.70/289.84 c avg switch length: 11.29
289.70/289.84 c switching time : 12.12
289.70/289.84 c Solution :
289.70/289.84 c Solutions found : 0 (0 improvements)
289.70/289.84 c Primal Bound : infeasible
289.70/289.84 c Dual Bound : -
289.70/289.84 c Gap : 0.00 %
289.70/289.84 c Root Dual Bound : +6.86666666666667e+01
289.80/289.90 c Time complete: 289.8.