0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868109-1245115727.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = c 1620
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = c 1791
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 57 | 593k| 0 | 42 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.03/0.05 c 0.0s| 1 | 0 | 76 | 820k| 0 | 42 | 169 | 73 | 73 | 169 | 91 | 18 | 0 | 0 | 1.300000e+01 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 157 |1118k| 0 | 61 | 169 | 73 | 73 | 169 | 99 | 26 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 232 |1403k| 0 | 55 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 339 |1709k| 0 | 59 | 169 | 73 | 73 | 169 | 112 | 39 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 432 |2002k| 0 | 67 | 169 | 73 | 73 | 169 | 117 | 44 | 0 | 0 | 1.300000e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 2 | 432 |2003k| 0 | 67 | 169 | 73 | 73 | 169 | 117 | 44 | 0 | 33 | 1.300000e+01 | -- | Inf
2.19/2.20 c
2.19/2.20 c SCIP Status : problem is solved [infeasible]
2.19/2.20 c Solving Time (sec) : 2.16
2.19/2.20 c Solving Nodes : 17
2.19/2.20 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.19/2.20 c Dual Bound : +1.00000000000000e+20
2.19/2.20 c Gap : 0.00 %
2.19/2.20 c NODE 17
2.19/2.20 c DUAL BOUND 1e+20
2.19/2.20 c PRIMAL BOUND 1e+20
2.19/2.20 c GAP 0
2.19/2.20 s UNSATISFIABLE
2.19/2.20 c SCIP Status : problem is solved [infeasible]
2.19/2.20 c Solving Time : 2.16
2.19/2.20 c Original Problem :
2.19/2.20 c Problem name : HOME/instance-1868109-1245115727.opb
2.19/2.20 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.20 c Constraints : 101 initial, 101 maximal
2.19/2.20 c Presolved Problem :
2.19/2.20 c Problem name : t_HOME/instance-1868109-1245115727.opb
2.19/2.20 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.20 c Constraints : 73 initial, 73 maximal
2.19/2.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.19/2.20 c trivial : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c implics : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c probing : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c setppc : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c linear : 0.01 0 0 0 0 0 28 0 0
2.19/2.20 c logicor : 0.00 0 0 0 0 0 0 0 0
2.19/2.20 c root node : - 87 - - 87 - - - -
2.19/2.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.19/2.20 c integral : 0 0 0 39 0 7 72 0 0 16
2.19/2.20 c knapsack : 1 5 53 0 0 0 0 0 0 0
2.19/2.20 c setppc : 68 5 53 0 0 0 340 0 0 0
2.19/2.20 c logicor : 4 5 5 0 0 0 0 0 0 0
2.19/2.20 c countsols : 0 0 0 0 0 0 0 0 0 0
2.19/2.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.19/2.20 c integral : 1.92 0.00 0.00 1.92 0.00
2.19/2.20 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.19/2.20 c setppc : 0.00 0.00 0.00 0.00 0.00
2.19/2.20 c logicor : 0.00 0.00 0.00 0.00 0.00
2.19/2.20 c countsols : 0.00 0.00 0.00 0.00 0.00
2.19/2.20 c Propagators : Time Calls Cutoffs DomReds
2.19/2.20 c rootredcost : 0.00 0 0 0
2.19/2.20 c pseudoobj : 0.00 54 0 0
2.19/2.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.19/2.20 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.20 c infeasible LP : 0.00 2 0 0 0.0 0 0.0 0
2.19/2.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.20 c applied globally : - - - 0 0.0 - - -
2.19/2.20 c applied locally : - - - 0 0.0 - - -
2.19/2.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.19/2.20 c cut pool : 0.00 4 - - 3 - (maximal pool size: 341)
2.19/2.20 c redcost : 0.00 21 0 0 0 0
2.19/2.20 c impliedbounds : 0.00 5 0 0 0 0
2.19/2.20 c intobj : 0.00 0 0 0 0 0
2.19/2.20 c gomory : 0.05 5 0 0 2 0
2.19/2.20 c strongcg : 0.05 5 0 0 333 0
2.19/2.20 c cmir : 0.00 0 0 0 0 0
2.19/2.20 c flowcover : 0.00 0 0 0 0 0
2.19/2.20 c clique : 0.00 5 0 0 26 0
2.19/2.20 c zerohalf : 0.00 0 0 0 0 0
2.19/2.20 c mcf : 0.00 1 0 0 0 0
2.19/2.20 c Pricers : Time Calls Vars
2.19/2.20 c problem variables: 0.00 0 0
2.19/2.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.19/2.20 c relpscost : 1.92 39 7 72 0 0 16
2.19/2.20 c pscost : 0.00 0 0 0 0 0 0
2.19/2.20 c inference : 0.00 0 0 0 0 0 0
2.19/2.20 c mostinf : 0.00 0 0 0 0 0 0
2.19/2.20 c leastinf : 0.00 0 0 0 0 0 0
2.19/2.20 c fullstrong : 0.00 0 0 0 0 0 0
2.19/2.20 c allfullstrong : 0.00 0 0 0 0 0 0
2.19/2.20 c random : 0.00 0 0 0 0 0 0
2.19/2.20 c Primal Heuristics : Time Calls Found
2.19/2.20 c LP solutions : 0.00 - 0
2.19/2.20 c pseudo solutions : 0.00 - 0
2.19/2.20 c simplerounding : 0.00 0 0
2.19/2.20 c rounding : 0.00 0 0
2.19/2.20 c shifting : 0.00 0 0
2.19/2.20 c intshifting : 0.00 0 0
2.19/2.20 c oneopt : 0.00 0 0
2.19/2.20 c fixandinfer : 0.00 0 0
2.19/2.20 c feaspump : 0.00 0 0
2.19/2.20 c coefdiving : 0.00 0 0
2.19/2.20 c pscostdiving : 0.00 0 0
2.19/2.20 c fracdiving : 0.00 0 0
2.19/2.20 c veclendiving : 0.00 0 0
2.19/2.20 c intdiving : 0.00 0 0
2.19/2.20 c actconsdiving : 0.00 0 0
2.19/2.20 c objpscostdiving : 0.00 0 0
2.19/2.20 c rootsoldiving : 0.00 0 0
2.19/2.20 c linesearchdiving : 0.00 0 0
2.19/2.20 c guideddiving : 0.00 0 0
2.19/2.20 c octane : 0.00 0 0
2.19/2.20 c rens : 0.00 0 0
2.19/2.20 c rins : 0.00 0 0
2.19/2.20 c localbranching : 0.00 0 0
2.19/2.20 c mutation : 0.00 0 0
2.19/2.20 c crossover : 0.00 0 0
2.19/2.20 c dins : 0.00 0 0
2.19/2.20 c LP : Time Calls Iterations Iter/call Iter/sec
2.19/2.20 c primal LP : 0.00 0 0 0.00 -
2.19/2.20 c dual LP : 0.12 46 1847 40.15 15391.67
2.19/2.20 c barrier LP : 0.00 0 0 0.00 -
2.19/2.20 c diving/probing LP: 0.00 0 0 0.00 -
2.19/2.20 c strong branching : 1.92 381 32404 85.05 16877.08
2.19/2.20 c (at root node) : - 33 4852 147.03 -
2.19/2.21 c conflict analysis: 0.00 0 0 0.00 -
2.19/2.21 c B&B Tree :
2.19/2.21 c number of runs : 1
2.19/2.21 c nodes : 17
2.19/2.21 c nodes (total) : 17
2.19/2.21 c nodes left : 0
2.19/2.21 c max depth : 5
2.19/2.21 c max depth (total): 5
2.19/2.21 c backtracks : 2 (11.8%)
2.19/2.21 c delayed cutoffs : 0
2.19/2.21 c repropagations : 1 (0 domain reductions, 0 cutoffs)
2.19/2.21 c avg switch length: 2.24
2.19/2.21 c switching time : 0.00
2.19/2.21 c Solution :
2.19/2.21 c Solutions found : 0 (0 improvements)
2.19/2.21 c Primal Bound : infeasible
2.19/2.21 c Dual Bound : -
2.19/2.21 c Gap : 0.00 %
2.19/2.21 c Root Dual Bound : +1.30000000000000e+01
2.19/2.21 c Time complete: 2.2.