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-1868053-1245115532.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.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-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/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 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 | 60 | 593k| 0 | 44 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 85 | 862k| 0 | 59 | 169 | 73 | 73 | 169 | 97 | 24 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.08 c 0.1s| 1 | 0 | 162 | 897k| 0 | 68 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 221 | 907k| 0 | 76 | 169 | 73 | 73 | 169 | 115 | 42 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 307 | 912k| 0 | 79 | 169 | 73 | 73 | 169 | 120 | 47 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 469 | 918k| 0 | 71 | 169 | 73 | 73 | 169 | 123 | 50 | 0 | 0 | 1.300000e+01 | -- | Inf
0.59/0.62 c 0.6s| 1 | 2 | 469 | 919k| 0 | 71 | 169 | 73 | 73 | 169 | 123 | 50 | 0 | 33 | 1.300000e+01 | -- | Inf
1.79/1.89 c
1.79/1.89 c SCIP Status : problem is solved [infeasible]
1.79/1.89 c Solving Time (sec) : 1.86
1.79/1.89 c Solving Nodes : 9
1.79/1.89 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.79/1.89 c Dual Bound : +1.00000000000000e+20
1.79/1.89 c Gap : 0.00 %
1.79/1.89 c NODE 9
1.79/1.89 c DUAL BOUND 1e+20
1.79/1.89 c PRIMAL BOUND 1e+20
1.79/1.89 c GAP 0
1.79/1.89 s UNSATISFIABLE
1.79/1.89 c SCIP Status : problem is solved [infeasible]
1.79/1.89 c Solving Time : 1.86
1.79/1.89 c Original Problem :
1.79/1.89 c Problem name : HOME/instance-1868053-1245115532.opb
1.79/1.89 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.89 c Constraints : 101 initial, 101 maximal
1.79/1.89 c Presolved Problem :
1.79/1.89 c Problem name : t_HOME/instance-1868053-1245115532.opb
1.79/1.89 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.89 c Constraints : 73 initial, 73 maximal
1.79/1.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.89 c trivial : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c probing : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c setppc : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c linear : 0.01 0 0 0 0 0 28 0 0
1.79/1.89 c logicor : 0.00 0 0 0 0 0 0 0 0
1.79/1.89 c root node : - 28 - - 28 - - - -
1.79/1.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.89 c integral : 0 0 0 21 0 1 60 0 0 8
1.79/1.89 c knapsack : 1 5 30 0 0 0 0 0 0 0
1.79/1.89 c setppc : 68 5 30 0 0 0 163 0 0 0
1.79/1.89 c logicor : 4 5 5 0 0 0 0 0 0 0
1.79/1.89 c countsols : 0 0 0 0 0 0 0 0 0 0
1.79/1.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.89 c integral : 1.62 0.00 0.00 1.62 0.00
1.79/1.89 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.79/1.89 c setppc : 0.00 0.00 0.00 0.00 0.00
1.79/1.89 c logicor : 0.00 0.00 0.00 0.00 0.00
1.79/1.89 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.89 c Propagators : Time Calls Cutoffs DomReds
1.79/1.89 c rootredcost : 0.00 0 0 0
1.79/1.89 c pseudoobj : 0.00 32 1 0
1.79/1.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.89 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.89 c infeasible LP : 0.00 3 0 0 0.0 0 0.0 0
1.79/1.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.89 c applied globally : - - - 0 0.0 - - -
1.79/1.89 c applied locally : - - - 0 0.0 - - -
1.79/1.89 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.89 c cut pool : 0.00 4 - - 22 - (maximal pool size: 92)
1.79/1.89 c redcost : 0.00 13 0 0 0 0
1.79/1.89 c impliedbounds : 0.00 5 0 0 0 0
1.79/1.89 c intobj : 0.00 0 0 0 0 0
1.79/1.89 c gomory : 0.04 5 0 0 23 0
1.79/1.89 c strongcg : 0.04 5 0 0 62 0
1.79/1.89 c cmir : 0.00 0 0 0 0 0
1.79/1.89 c flowcover : 0.00 0 0 0 0 0
1.79/1.89 c clique : 0.01 5 0 0 17 0
1.79/1.89 c zerohalf : 0.00 0 0 0 0 0
1.79/1.89 c mcf : 0.00 1 0 0 0 0
1.79/1.89 c Pricers : Time Calls Vars
1.79/1.89 c problem variables: 0.00 0 0
1.79/1.89 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.89 c relpscost : 1.62 21 1 60 0 0 8
1.79/1.89 c pscost : 0.00 0 0 0 0 0 0
1.79/1.89 c inference : 0.00 0 0 0 0 0 0
1.79/1.89 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.89 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.89 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.89 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.89 c random : 0.00 0 0 0 0 0 0
1.79/1.89 c Primal Heuristics : Time Calls Found
1.79/1.89 c LP solutions : 0.00 - 0
1.79/1.89 c pseudo solutions : 0.00 - 0
1.79/1.89 c simplerounding : 0.00 0 0
1.79/1.89 c rounding : 0.00 0 0
1.79/1.89 c shifting : 0.00 0 0
1.79/1.89 c intshifting : 0.00 0 0
1.79/1.89 c oneopt : 0.00 0 0
1.79/1.89 c fixandinfer : 0.00 0 0
1.79/1.89 c feaspump : 0.00 0 0
1.79/1.89 c coefdiving : 0.00 0 0
1.79/1.89 c pscostdiving : 0.00 0 0
1.79/1.89 c fracdiving : 0.00 0 0
1.79/1.89 c veclendiving : 0.00 0 0
1.79/1.89 c intdiving : 0.00 0 0
1.79/1.89 c actconsdiving : 0.00 0 0
1.79/1.89 c objpscostdiving : 0.00 0 0
1.79/1.89 c rootsoldiving : 0.00 0 0
1.79/1.89 c linesearchdiving : 0.00 0 0
1.79/1.89 c guideddiving : 0.00 0 0
1.79/1.89 c octane : 0.00 0 0
1.79/1.89 c rens : 0.00 0 0
1.79/1.89 c rins : 0.00 0 0
1.79/1.89 c localbranching : 0.00 0 0
1.79/1.89 c mutation : 0.00 0 0
1.79/1.89 c crossover : 0.00 0 0
1.79/1.89 c dins : 0.00 0 0
1.79/1.89 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.89 c primal LP : 0.01 0 0 0.00 0.00
1.79/1.89 c dual LP : 0.13 30 1510 50.33 11615.38
1.79/1.89 c barrier LP : 0.00 0 0 0.00 -
1.79/1.89 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.89 c strong branching : 1.62 256 24149 94.33 14906.79
1.79/1.89 c (at root node) : - 33 4943 149.79 -
1.79/1.89 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.89 c B&B Tree :
1.79/1.89 c number of runs : 1
1.79/1.89 c nodes : 9
1.79/1.89 c nodes (total) : 9
1.79/1.89 c nodes left : 0
1.79/1.89 c max depth : 4
1.79/1.89 c max depth (total): 4
1.79/1.89 c backtracks : 1 (11.1%)
1.79/1.89 c delayed cutoffs : 0
1.79/1.89 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.79/1.89 c avg switch length: 2.00
1.79/1.89 c switching time : 0.01
1.79/1.89 c Solution :
1.79/1.89 c Solutions found : 0 (0 improvements)
1.79/1.89 c Primal Bound : infeasible
1.79/1.89 c Dual Bound : -
1.79/1.89 c Gap : 0.00 %
1.79/1.89 c Root Dual Bound : +1.30000000000000e+01
1.79/1.90 c Time complete: 1.89.