0.09/0.17 c SCIP version 1.1.0.7
0.09/0.17 c LP-Solver Clp 1.8.2
0.09/0.17 c user parameter file <scip.set> not found - using default parameters
0.09/0.17 c read problem <HOME/instance-1868605-1245129098.opb>
0.09/0.17 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.19/0.22 c No objective function, only one solution is needed.
0.19/0.22 c start presolving problem
0.19/0.22 c presolving:
0.39/0.40 c (round 1) 519 del vars, 651 del conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.43 c (round 2) 520 del vars, 1331 del conss, 222 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.44 c (round 3) 542 del vars, 1384 del conss, 244 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.44 c (round 4) 546 del vars, 1390 del conss, 248 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.45 c (round 5) 552 del vars, 1401 del conss, 254 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.39/0.46 c (round 6) 556 del vars, 1415 del conss, 258 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.39/0.47 c (round 7) 560 del vars, 1425 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.39/0.48 c (round 8) 560 del vars, 1433 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.48/0.59 c (round 9) 560 del vars, 1439 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 8973 upgd conss, 171264 impls, 0 clqs
0.59/0.65 c presolving (10 rounds):
0.59/0.65 c 560 deleted vars, 1439 deleted constraints, 262 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.59/0.65 c 171264 implications, 0 cliques
0.59/0.65 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.59/0.65 c 672 constraints of type <knapsack>
0.59/0.65 c 8301 constraints of type <logicor>
0.59/0.65 c transformed objective value is always integral (scale: 1)
0.59/0.65 c Presolving Time: 0.37
0.59/0.65 c SATUNSAT-LIN
0.59/0.65 c -----------------------------------------------------------------------------------------------
0.59/0.65 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.65 c separating/flowcover/freq = c -1
0.59/0.65 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.65 c separating/cmir/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/veclendiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/veclendiving/freq = c -1
0.59/0.65 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.65 c heuristics/simplerounding/freq = c -1
0.59/0.65 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/shifting/freq = c -1
0.59/0.65 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.65 c heuristics/rounding/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.65 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.59/0.65 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.65 c heuristics/rootsoldiving/freq = c -1
0.59/0.65 c # number of nodes added to the contingent of the total nodes
0.59/0.65 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.65 c heuristics/rens/nodesofs = c 2000
0.59/0.65 c # minimum percentage of integer variables that have to be fixable
0.59/0.65 c # [type: real, range: [0,1], default: 0.5]
0.59/0.65 c heuristics/rens/minfixingrate = c 0.3
0.59/0.65 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.65 c heuristics/rens/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/pscostdiving/freq = c -1
0.59/0.65 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.65 c heuristics/oneopt/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.65 c # [type: real, range: [0,1], default: 0.01]
0.59/0.65 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.59/0.65 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.65 c heuristics/objpscostdiving/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/linesearchdiving/freq = c -1
0.59/0.65 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/intshifting/freq = c -1
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/intdiving/maxlpiterquot = c 0.075
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/guideddiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/guideddiving/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/fracdiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/fracdiving/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/feaspump/maxlpiterofs = c 2000
0.59/0.65 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.65 c heuristics/feaspump/freq = c -1
0.59/0.65 c # minimum percentage of integer variables that have to be fixed
0.59/0.65 c # [type: real, range: [0,1], default: 0.666]
0.59/0.65 c heuristics/crossover/minfixingrate = c 0.5
0.59/0.65 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.65 c # [type: real, range: [0,1], default: 0.1]
0.59/0.65 c heuristics/crossover/nodesquot = c 0.15
0.59/0.65 c # number of nodes without incumbent change that heuristic should wait
0.59/0.65 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.65 c heuristics/crossover/nwaitingnodes = c 100
0.59/0.65 c # number of nodes added to the contingent of the total nodes
0.59/0.65 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.65 c heuristics/crossover/nodesofs = c 750
0.59/0.65 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.65 c heuristics/crossover/freq = c -1
0.59/0.65 c # additional number of allowed LP iterations
0.59/0.65 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.65 c heuristics/coefdiving/maxlpiterofs = c 1500
0.59/0.65 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.65 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.59/0.65 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.65 c heuristics/coefdiving/freq = c -1
0.59/0.65 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.65 c presolving/probing/maxrounds = c 0
0.59/0.65 c # should presolving try to simplify knapsacks
0.59/0.65 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.65 c constraints/knapsack/simplifyinequalities = c TRUE
0.59/0.65 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.65 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.65 c constraints/knapsack/disaggregation = c FALSE
0.59/0.65 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.65 c constraints/knapsack/maxnumcardlift = c 0
0.59/0.65 c # should presolving try to simplify inequalities
0.59/0.65 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.65 c constraints/linear/simplifyinequalities = c TRUE
0.59/0.65 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.65 c separating/maxroundsroot = c 5
0.59/0.65 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.65 c separating/maxrounds = c 1
0.59/0.65 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.65 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.65 c limits/solutions = c 1
0.59/0.65 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.65 c limits/memory = c 1620
0.59/0.65 c # maximal time in seconds to run
0.59/0.65 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.65 c limits/time = c 1791
0.59/0.65 c # frequency for displaying node information lines
0.59/0.65 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.65 c display/freq = c 10000
0.59/0.65 c -----------------------------------------------------------------------------------------------
0.59/0.65 c start solving problem
0.59/0.65 c
0.79/0.85 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.85 c 0.6s| 1 | 0 | 831 | 24M| 0 | 513 |3379 |8973 |8973 |3379 |8973 | 0 | 0 | 0 | 2.893511e+02 | -- | Inf
1.39/1.45 c 1.1s| 1 | 0 | 1195 | 24M| 0 | 548 |3379 |8973 |8973 |3379 |9086 | 113 | 0 | 0 | 3.534509e+02 | -- | Inf
1.89/1.99 c 1.7s| 1 | 0 | 1619 | 25M| 0 | 580 |3379 |8973 |8973 |3379 |9196 | 223 | 0 | 0 | 3.773964e+02 | -- | Inf
2.99/3.01 c 2.7s| 1 | 0 | 2097 | 25M| 0 | 620 |3379 |8973 |8973 |3379 |9307 | 334 | 0 | 0 | 3.857667e+02 | -- | Inf
3.79/3.85 c 3.5s| 1 | 0 | 2680 | 25M| 0 | 662 |3379 |8973 |8973 |3379 |9421 | 448 | 0 | 0 | 3.946139e+02 | -- | Inf
4.59/4.65 c 4.3s| 1 | 0 | 3275 | 26M| 0 | 575 |3379 |8973 |8973 |3379 |9536 | 563 | 0 | 0 | 4.110967e+02 | -- | Inf
9.58/9.69 c 9.3s| 1 | 0 | 3397 | 26M| 0 | 623 |3379 |8930 |8930 |3379 |9536 | 563 | 0 | 18 | 4.124493e+02 | -- | Inf
15.08/15.16 c 14.8s| 1 | 2 | 3397 | 26M| 0 | 623 |3379 |8930 |8930 |3379 |9536 | 563 | 0 | 46 | 4.124493e+02 | -- | Inf
191.73/191.85 c
191.73/191.85 c SCIP Status : problem is solved [infeasible]
191.73/191.85 c Solving Time (sec) : 189.96
191.73/191.85 c Solving Nodes : 1568
191.73/191.85 c Primal Bound : +1.00000000000000e+20 (0 solutions)
191.73/191.85 c Dual Bound : +1.00000000000000e+20
191.73/191.85 c Gap : 0.00 %
191.73/191.85 c NODE 1568
191.73/191.85 c DUAL BOUND 1e+20
191.73/191.85 c PRIMAL BOUND 1e+20
191.73/191.85 c GAP 0
191.73/191.85 s UNSATISFIABLE
191.73/191.85 c SCIP Status : problem is solved [infeasible]
191.73/191.85 c Solving Time : 189.96
191.73/191.85 c Original Problem :
191.73/191.85 c Problem name : HOME/instance-1868605-1245129098.opb
191.73/191.85 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
191.73/191.85 c Constraints : 10412 initial, 10412 maximal
191.73/191.85 c Presolved Problem :
191.73/191.85 c Problem name : t_HOME/instance-1868605-1245129098.opb
191.73/191.85 c Variables : 3379 (3379 binary, 0 integer, 0 implicit integer, 0 continuous)
191.73/191.85 c Constraints : 8973 initial, 9881 maximal
191.73/191.85 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
191.73/191.85 c trivial : 0.00 0 0 0 0 0 0 0 0
191.73/191.85 c dualfix : 0.00 0 0 0 0 0 0 0 0
191.73/191.85 c boundshift : 0.00 0 0 0 0 0 0 0 0
191.73/191.85 c inttobinary : 0.00 0 0 0 0 0 0 0 0
191.73/191.85 c implics : 0.04 0 294 0 0 0 0 0 0
191.73/191.85 c probing : 0.00 0 0 0 0 0 0 0 0
191.73/191.85 c knapsack : 0.03 0 0 0 0 0 0 0 0
191.73/191.85 c linear : 0.24 262 4 0 262 0 1439 336 724
191.73/191.85 c logicor : 0.04 0 0 0 0 0 0 0 0
191.73/191.85 c root node : - 1232 - - 1232 - - - -
191.73/191.85 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
191.73/191.85 c integral : 0 0 0 1116 0 9 87 0 0 2166
191.73/191.85 c knapsack : 672 5 26711 0 0 13 928 1000 0 0
191.73/191.85 c logicor : 8301+ 5 26083 0 0 673 138823 0 0 0
191.73/191.85 c countsols : 0 0 0 0 0 0 0 0 0 0
191.73/191.85 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
191.73/191.85 c integral : 100.22 0.00 0.00 100.22 0.00
191.73/191.85 c knapsack : 0.73 0.02 0.71 0.00 0.00
191.73/191.85 c logicor : 1.59 0.01 1.58 0.00 0.00
191.73/191.85 c countsols : 0.00 0.00 0.00 0.00 0.00
191.73/191.85 c Propagators : Time Calls Cutoffs DomReds
191.73/191.85 c rootredcost : 0.01 0 0 0
191.73/191.85 c pseudoobj : 5.33 26757 0 0
191.73/191.85 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
191.73/191.85 c propagation : 0.20 686 685 3944 32.9 208 12.8 -
191.73/191.85 c infeasible LP : 0.15 113 0 0 0.0 0 0.0 0
191.73/191.85 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
191.73/191.85 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
191.73/191.85 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
191.73/191.85 c applied globally : - - - 1804 20.5 - - -
191.73/191.85 c applied locally : - - - 0 0.0 - - -
191.73/191.85 c Separators : Time Calls Cutoffs DomReds Cuts Conss
191.73/191.85 c cut pool : 0.00 4 - - 507 - (maximal pool size: 2076)
191.73/191.85 c redcost : 0.41 1099 0 0 0 0
191.73/191.85 c impliedbounds : 0.00 5 0 0 0 0
191.73/191.85 c intobj : 0.00 0 0 0 0 0
191.73/191.85 c gomory : 1.30 5 0 0 2500 0
191.73/191.85 c strongcg : 0.94 5 0 0 2500 0
191.73/191.85 c cmir : 0.00 0 0 0 0 0
191.73/191.85 c flowcover : 0.00 0 0 0 0 0
191.73/191.85 c clique : 0.19 5 0 0 34 0
191.73/191.85 c zerohalf : 0.00 0 0 0 0 0
191.73/191.85 c mcf : 0.03 1 0 0 0 0
191.73/191.85 c Pricers : Time Calls Vars
191.73/191.85 c problem variables: 0.00 0 0
191.73/191.85 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
191.73/191.85 c relpscost : 100.21 1116 9 87 0 0 2166
191.73/191.85 c pscost : 0.00 0 0 0 0 0 0
191.73/191.85 c inference : 0.00 0 0 0 0 0 0
191.73/191.85 c mostinf : 0.00 0 0 0 0 0 0
191.73/191.85 c leastinf : 0.00 0 0 0 0 0 0
191.73/191.85 c fullstrong : 0.00 0 0 0 0 0 0
191.73/191.85 c allfullstrong : 0.00 0 0 0 0 0 0
191.73/191.85 c random : 0.00 0 0 0 0 0 0
191.73/191.85 c Primal Heuristics : Time Calls Found
191.73/191.85 c LP solutions : 0.00 - 0
191.73/191.85 c pseudo solutions : 0.00 - 0
191.73/191.85 c simplerounding : 0.00 0 0
191.73/191.85 c rounding : 0.00 0 0
191.73/191.85 c shifting : 0.00 0 0
191.73/191.85 c intshifting : 0.00 0 0
191.73/191.85 c oneopt : 0.00 0 0
191.73/191.85 c fixandinfer : 0.00 0 0
191.73/191.85 c feaspump : 0.00 0 0
191.73/191.85 c coefdiving : 0.00 0 0
191.73/191.85 c pscostdiving : 0.00 0 0
191.73/191.85 c fracdiving : 0.00 0 0
191.73/191.85 c veclendiving : 0.00 0 0
191.73/191.85 c intdiving : 0.00 0 0
191.73/191.85 c actconsdiving : 0.00 0 0
191.73/191.85 c objpscostdiving : 0.00 0 0
191.73/191.85 c rootsoldiving : 0.00 0 0
191.73/191.85 c linesearchdiving : 0.00 0 0
191.73/191.85 c guideddiving : 0.00 0 0
191.73/191.85 c octane : 0.00 0 0
191.73/191.85 c rens : 0.00 0 0
191.73/191.85 c rins : 0.00 0 0
191.73/191.85 c localbranching : 0.00 0 0
191.73/191.85 c mutation : 0.00 0 0
191.73/191.85 c crossover : 0.00 0 0
191.73/191.85 c dins : 0.00 0 0
191.73/191.85 c LP : Time Calls Iterations Iter/call Iter/sec
191.73/191.85 c primal LP : 0.07 0 0 0.00 0.00
191.73/191.85 c dual LP : 72.77 1233 142239 115.36 1954.64
191.73/191.85 c barrier LP : 0.00 0 0 0.00 -
191.73/191.85 c diving/probing LP: 0.00 0 0 0.00 -
191.73/191.85 c strong branching : 99.74 938 187402 199.79 1878.91
191.73/191.85 c (at root node) : - 46 15500 336.96 -
191.73/191.85 c conflict analysis: 0.00 0 0 0.00 -
191.73/191.85 c B&B Tree :
191.73/191.85 c number of runs : 1
191.73/191.85 c nodes : 1568
191.73/191.85 c nodes (total) : 1568
191.73/191.85 c nodes left : 0
191.73/191.85 c max depth : 57
191.73/191.85 c max depth (total): 57
191.73/191.85 c backtracks : 451 (28.8%)
191.73/191.85 c delayed cutoffs : 599
191.73/191.85 c repropagations : 1390 (46299 domain reductions, 323 cutoffs)
191.73/191.85 c avg switch length: 4.54
191.73/191.85 c switching time : 0.94
191.73/191.85 c Solution :
191.73/191.85 c Solutions found : 0 (0 improvements)
191.73/191.85 c Primal Bound : infeasible
191.73/191.85 c Dual Bound : -
191.73/191.85 c Gap : 0.00 %
191.73/191.85 c Root Dual Bound : +4.12449320538599e+02
191.83/191.92 c Time complete: 191.85.