0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2685319-1278440562.opb>
0.89/0.93 c original problem has 16744 variables (16744 bin, 0 int, 0 impl, 0 cont) and 52975 constraints
0.89/0.93 c problem read
0.89/0.93 c No objective function, only one solution is needed.
0.89/0.93 c presolving settings loaded
1.20/1.22 c presolving:
2.99/3.07 c presolving (1 rounds):
2.99/3.07 c 1274 deleted vars, 5275 deleted constraints, 1274 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.99/3.07 c 2268560 implications, 0 cliques
2.99/3.09 c presolving detected infeasibility
2.99/3.09 c Presolving Time: 1.85
2.99/3.09 c - non default parameters ----------------------------------------------------------------------
2.99/3.09 c # SCIP version 1.2.1.2
2.99/3.09 c
2.99/3.09 c # frequency for displaying node information lines
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 100]
2.99/3.09 c display/freq = 10000
2.99/3.09 c
2.99/3.09 c # maximal time in seconds to run
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.09 c limits/time = 1799.08
2.99/3.09 c
2.99/3.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.09 c limits/memory = 1620
2.99/3.09 c
2.99/3.09 c # solving stops, if the given number of solutions were found (-1: no limit)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c limits/solutions = 1
2.99/3.09 c
2.99/3.09 c # maximal number of separation rounds per node (-1: unlimited)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 5]
2.99/3.09 c separating/maxrounds = 1
2.99/3.09 c
2.99/3.09 c # maximal number of separation rounds in the root node (-1: unlimited)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c separating/maxroundsroot = 5
2.99/3.09 c
2.99/3.09 c # should presolving try to simplify inequalities
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.09 c constraints/linear/simplifyinequalities = TRUE
2.99/3.09 c
2.99/3.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.99/3.09 c constraints/knapsack/disaggregation = FALSE
2.99/3.09 c
2.99/3.09 c # should presolving try to simplify knapsacks
2.99/3.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.09 c constraints/knapsack/simplifyinequalities = TRUE
2.99/3.09 c
2.99/3.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c presolving/probing/maxrounds = 0
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/coefdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/coefdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/coefdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 30]
2.99/3.09 c heuristics/crossover/freq = -1
2.99/3.09 c
2.99/3.09 c # number of nodes added to the contingent of the total nodes
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.09 c heuristics/crossover/nodesofs = 750
2.99/3.09 c
2.99/3.09 c # number of nodes without incumbent change that heuristic should wait
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.99/3.09 c heuristics/crossover/nwaitingnodes = 100
2.99/3.09 c
2.99/3.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.99/3.09 c # [type: real, range: [0,1], default: 0.1]
2.99/3.09 c heuristics/crossover/nodesquot = 0.15
2.99/3.09 c
2.99/3.09 c # minimum percentage of integer variables that have to be fixed
2.99/3.09 c # [type: real, range: [0,1], default: 0.666]
2.99/3.09 c heuristics/crossover/minfixingrate = 0.5
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/feaspump/freq = -1
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/feaspump/maxlpiterofs = 2000
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/fracdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/fracdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/fracdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/guideddiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/guideddiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/guideddiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/intdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/intshifting/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/linesearchdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/nlp/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/objpscostdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to total iteration number
2.99/3.09 c # [type: real, range: [0,1], default: 0.01]
2.99/3.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/oneopt/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/pscostdiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/pscostdiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c heuristics/rens/freq = -1
2.99/3.09 c
2.99/3.09 c # minimum percentage of integer variables that have to be fixable
2.99/3.09 c # [type: real, range: [0,1], default: 0.5]
2.99/3.09 c heuristics/rens/minfixingrate = 0.3
2.99/3.09 c
2.99/3.09 c # number of nodes added to the contingent of the total nodes
2.99/3.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.09 c heuristics/rens/nodesofs = 2000
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.09 c heuristics/rootsoldiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.99/3.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/rounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/shifting/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/simplerounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c heuristics/trivial/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/trysol/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.09 c heuristics/veclendiving/freq = -1
2.99/3.09 c
2.99/3.09 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.09 c heuristics/veclendiving/maxlpiterquot = 0.075
2.99/3.09 c
2.99/3.09 c # additional number of allowed LP iterations
2.99/3.09 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.09 c heuristics/veclendiving/maxlpiterofs = 1500
2.99/3.09 c
2.99/3.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.09 c heuristics/zirounding/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c separating/cmir/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.09 c separating/flowcover/freq = -1
2.99/3.09 c
2.99/3.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.99/3.09 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.09 c separating/rapidlearning/freq = 0
2.99/3.09 c
2.99/3.09 c -----------------------------------------------------------------------------------------------
2.99/3.09 c start solving
2.99/3.09 c
2.99/3.09 c SCIP Status : problem is solved [infeasible]
2.99/3.09 c Solving Time (sec) : 2.03
2.99/3.09 c Solving Nodes : 0
2.99/3.09 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.99/3.09 c Dual Bound : -1.00000000000000e+20
2.99/3.09 c Gap : infinite
2.99/3.09 s UNSATISFIABLE
2.99/3.09 c SCIP Status : problem is solved [infeasible]
2.99/3.09 c Solving Time : 2.03
2.99/3.09 c Original Problem :
2.99/3.09 c Problem name : HOME/instance-2685319-1278440562.opb
2.99/3.09 c Variables : 16744 (16744 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.09 c Constraints : 52975 initial, 52975 maximal
2.99/3.09 c Presolved Problem :
2.99/3.09 c Problem name : t_HOME/instance-2685319-1278440562.opb
2.99/3.09 c Variables : 15470 (15470 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.09 c Constraints : 47700 initial, 47700 maximal
2.99/3.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.09 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c probing : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c linear : 1.72 1274 0 0 1274 0 5275 0 0
2.99/3.09 c root node : - 0 - - 0 - - - -
2.99/3.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.09 c integral : 0 0 0 0 0 0 0 0 0 0
2.99/3.09 c linear : 47700 0 0 0 0 0 0 0 0 0
2.99/3.09 c countsols : 0 0 0 0 0 0 0 0 0 0
2.99/3.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.09 c integral : 0.00 0.00 0.00 0.00 0.00
2.99/3.09 c linear : 0.00 0.00 0.00 0.00 0.00
2.99/3.09 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.09 c Propagators : Time Calls Cutoffs DomReds
2.99/3.09 c pseudoobj : 0.00 0 0 0
2.99/3.09 c rootredcost : 0.00 0 0 0
2.99/3.09 c vbounds : 0.00 0 0 0
2.99/3.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.09 c applied globally : - - - 0 0.0 - - -
2.99/3.09 c applied locally : - - - 0 0.0 - - -
2.99/3.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.99/3.09 c redcost : 0.00 0 0 0 0 0
2.99/3.09 c impliedbounds : 0.00 0 0 0 0 0
2.99/3.09 c intobj : 0.00 0 0 0 0 0
2.99/3.09 c cgmip : 0.00 0 0 0 0 0
2.99/3.09 c gomory : 0.00 0 0 0 0 0
2.99/3.09 c strongcg : 0.00 0 0 0 0 0
2.99/3.09 c cmir : 0.00 0 0 0 0 0
2.99/3.09 c flowcover : 0.00 0 0 0 0 0
2.99/3.09 c clique : 0.00 0 0 0 0 0
2.99/3.09 c zerohalf : 0.00 0 0 0 0 0
2.99/3.09 c mcf : 0.00 0 0 0 0 0
2.99/3.09 c rapidlearning : 0.00 0 0 0 0 0
2.99/3.09 c Pricers : Time Calls Vars
2.99/3.09 c problem variables: 0.00 0 0
2.99/3.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.09 c pscost : 0.00 0 0 0 0 0 0
2.99/3.09 c inference : 0.00 0 0 0 0 0 0
2.99/3.09 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.09 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.09 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.09 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.09 c random : 0.00 0 0 0 0 0 0
2.99/3.09 c relpscost : 0.00 0 0 0 0 0 0
2.99/3.09 c Primal Heuristics : Time Calls Found
2.99/3.09 c LP solutions : 0.00 - 0
2.99/3.09 c pseudo solutions : 0.00 - 0
2.99/3.09 c trivial : 0.03 1 0
2.99/3.09 c simplerounding : 0.00 0 0
2.99/3.09 c zirounding : 0.00 0 0
2.99/3.09 c rounding : 0.00 0 0
2.99/3.09 c shifting : 0.00 0 0
2.99/3.09 c intshifting : 0.00 0 0
2.99/3.09 c oneopt : 0.00 0 0
2.99/3.09 c twoopt : 0.00 0 0
2.99/3.09 c fixandinfer : 0.00 0 0
2.99/3.09 c feaspump : 0.00 0 0
2.99/3.09 c coefdiving : 0.00 0 0
2.99/3.09 c pscostdiving : 0.00 0 0
2.99/3.09 c fracdiving : 0.00 0 0
2.99/3.09 c veclendiving : 0.00 0 0
2.99/3.09 c intdiving : 0.00 0 0
2.99/3.09 c actconsdiving : 0.00 0 0
2.99/3.09 c objpscostdiving : 0.00 0 0
2.99/3.09 c rootsoldiving : 0.00 0 0
2.99/3.09 c linesearchdiving : 0.00 0 0
2.99/3.09 c guideddiving : 0.00 0 0
2.99/3.09 c octane : 0.00 0 0
2.99/3.09 c rens : 0.00 0 0
2.99/3.09 c rins : 0.00 0 0
2.99/3.09 c localbranching : 0.00 0 0
2.99/3.09 c mutation : 0.00 0 0
2.99/3.09 c crossover : 0.00 0 0
2.99/3.09 c dins : 0.00 0 0
2.99/3.09 c undercover : 0.00 0 0
2.99/3.09 c nlp : 0.00 0 0
2.99/3.09 c trysol : 0.00 0 0
2.99/3.09 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.09 c primal LP : 0.00 0 0 0.00 -
2.99/3.09 c dual LP : 0.00 0 0 0.00 -
2.99/3.09 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.09 c barrier LP : 0.00 0 0 0.00 -
2.99/3.09 c diving/probing LP: 0.00 0 0 0.00 -
2.99/3.09 c strong branching : 0.00 0 0 0.00 -
2.99/3.09 c (at root node) : - 0 0 0.00 -
2.99/3.09 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.09 c B&B Tree :
2.99/3.09 c number of runs : 1
2.99/3.09 c nodes : 0
2.99/3.09 c nodes (total) : 0
2.99/3.09 c nodes left : 1
2.99/3.09 c max depth : -1
2.99/3.09 c max depth (total): -1
2.99/3.09 c backtracks : 0 (0.0%)
2.99/3.09 c delayed cutoffs : 0
2.99/3.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.99/3.09 c avg switch length: 0.00
2.99/3.09 c switching time : 0.00
2.99/3.09 c Solution :
2.99/3.09 c Solutions found : 0 (0 improvements)
2.99/3.09 c Primal Bound : infeasible
2.99/3.09 c Dual Bound : -
2.99/3.09 c Gap : infinite
2.99/3.09 c Root Dual Bound : -
2.99/3.09 c Root Iterations : 0
3.19/3.30 c Time complete: 3.29.