0.00/0.00 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.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2684563-1278432549.opb>
0.19/0.20 c original problem has 3844 variables (3844 bin, 0 int, 0 impl, 0 cont) and 11854 constraints
0.19/0.20 c problem read
0.19/0.20 c No objective function, only one solution is needed.
0.19/0.20 c presolving settings loaded
0.19/0.27 c presolving:
0.69/0.71 c (round 1) 937 del vars, 2421 del conss, 585 chg bounds, 52 chg sides, 55 chg coeffs, 0 upgd conss, 596428 impls, 0 clqs
0.89/0.92 c (round 2) 2577 del vars, 7222 del conss, 2072 chg bounds, 54 chg sides, 56 chg coeffs, 0 upgd conss, 607582 impls, 0 clqs
0.89/0.95 c (round 3) 2972 del vars, 9496 del conss, 2234 chg bounds, 140 chg sides, 117 chg coeffs, 0 upgd conss, 610979 impls, 0 clqs
0.89/0.97 c (round 4) 3139 del vars, 10010 del conss, 2338 chg bounds, 159 chg sides, 134 chg coeffs, 0 upgd conss, 612583 impls, 0 clqs
0.89/0.97 c presolving (5 rounds):
0.89/0.97 c 3171 deleted vars, 10156 deleted constraints, 2364 tightened bounds, 0 added holes, 175 changed sides, 145 changed coefficients
0.89/0.97 c 612725 implications, 0 cliques
0.89/0.97 c presolving detected infeasibility
0.89/0.97 c Presolving Time: 0.68
0.89/0.97 c - non default parameters ----------------------------------------------------------------------
0.89/0.97 c # SCIP version 1.2.1.2
0.89/0.97 c
0.89/0.97 c # frequency for displaying node information lines
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 100]
0.89/0.97 c display/freq = 10000
0.89/0.97 c
0.89/0.97 c # maximal time in seconds to run
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.97 c limits/time = 1799.8
0.89/0.97 c
0.89/0.97 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.97 c limits/memory = 1620
0.89/0.97 c
0.89/0.97 c # solving stops, if the given number of solutions were found (-1: no limit)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.97 c limits/solutions = 1
0.89/0.97 c
0.89/0.97 c # maximal number of separation rounds per node (-1: unlimited)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 5]
0.89/0.97 c separating/maxrounds = 1
0.89/0.97 c
0.89/0.97 c # maximal number of separation rounds in the root node (-1: unlimited)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.97 c separating/maxroundsroot = 5
0.89/0.97 c
0.89/0.97 c # should presolving try to simplify inequalities
0.89/0.97 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.97 c constraints/linear/simplifyinequalities = TRUE
0.89/0.97 c
0.89/0.97 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.89/0.97 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.89/0.97 c constraints/knapsack/disaggregation = FALSE
0.89/0.97 c
0.89/0.97 c # should presolving try to simplify knapsacks
0.89/0.97 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.97 c constraints/knapsack/simplifyinequalities = TRUE
0.89/0.97 c
0.89/0.97 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.97 c presolving/probing/maxrounds = 0
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/coefdiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.97 c heuristics/coefdiving/maxlpiterquot = 0.075
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/coefdiving/maxlpiterofs = 1500
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 30]
0.89/0.97 c heuristics/crossover/freq = -1
0.89/0.97 c
0.89/0.97 c # number of nodes added to the contingent of the total nodes
0.89/0.97 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.97 c heuristics/crossover/nodesofs = 750
0.89/0.97 c
0.89/0.97 c # number of nodes without incumbent change that heuristic should wait
0.89/0.97 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.89/0.97 c heuristics/crossover/nwaitingnodes = 100
0.89/0.97 c
0.89/0.97 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.89/0.97 c # [type: real, range: [0,1], default: 0.1]
0.89/0.97 c heuristics/crossover/nodesquot = 0.15
0.89/0.97 c
0.89/0.97 c # minimum percentage of integer variables that have to be fixed
0.89/0.97 c # [type: real, range: [0,1], default: 0.666]
0.89/0.97 c heuristics/crossover/minfixingrate = 0.5
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.97 c heuristics/feaspump/freq = -1
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/feaspump/maxlpiterofs = 2000
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/fracdiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.97 c heuristics/fracdiving/maxlpiterquot = 0.075
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/fracdiving/maxlpiterofs = 1500
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/guideddiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.97 c heuristics/guideddiving/maxlpiterquot = 0.075
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/guideddiving/maxlpiterofs = 1500
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.97 c heuristics/intdiving/maxlpiterquot = 0.075
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/intshifting/freq = -1
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/linesearchdiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.97 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.97 c heuristics/nlp/freq = -1
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.97 c heuristics/objpscostdiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to total iteration number
0.89/0.97 c # [type: real, range: [0,1], default: 0.01]
0.89/0.97 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.89/0.97 c
0.89/0.97 c # additional number of allowed LP iterations
0.89/0.97 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.97 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.97 c heuristics/oneopt/freq = -1
0.89/0.97 c
0.89/0.97 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.97 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.97 c heuristics/pscostdiving/freq = -1
0.89/0.97 c
0.89/0.97 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.97 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.98 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.89/0.98 c
0.89/0.98 c # additional number of allowed LP iterations
0.89/0.98 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.98 c heuristics/pscostdiving/maxlpiterofs = 1500
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.98 c heuristics/rens/freq = -1
0.89/0.98 c
0.89/0.98 c # minimum percentage of integer variables that have to be fixable
0.89/0.98 c # [type: real, range: [0,1], default: 0.5]
0.89/0.98 c heuristics/rens/minfixingrate = 0.3
0.89/0.98 c
0.89/0.98 c # number of nodes added to the contingent of the total nodes
0.89/0.98 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.98 c heuristics/rens/nodesofs = 2000
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.98 c heuristics/rootsoldiving/freq = -1
0.89/0.98 c
0.89/0.98 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.89/0.98 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.89/0.98 c
0.89/0.98 c # additional number of allowed LP iterations
0.89/0.98 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.98 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.98 c heuristics/rounding/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.98 c heuristics/shifting/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.98 c heuristics/simplerounding/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.98 c heuristics/trivial/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.98 c heuristics/trysol/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.98 c heuristics/veclendiving/freq = -1
0.89/0.98 c
0.89/0.98 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.98 c heuristics/veclendiving/maxlpiterquot = 0.075
0.89/0.98 c
0.89/0.98 c # additional number of allowed LP iterations
0.89/0.98 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.98 c heuristics/veclendiving/maxlpiterofs = 1500
0.89/0.98 c
0.89/0.98 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.98 c heuristics/zirounding/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.98 c separating/cmir/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.98 c separating/flowcover/freq = -1
0.89/0.98 c
0.89/0.98 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.89/0.98 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.98 c separating/rapidlearning/freq = 0
0.89/0.98 c
0.89/0.98 c -----------------------------------------------------------------------------------------------
0.89/0.98 c start solving
0.89/0.98 c
0.89/0.98 c SCIP Status : problem is solved [infeasible]
0.89/0.98 c Solving Time (sec) : 0.71
0.89/0.98 c Solving Nodes : 0
0.89/0.98 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.89/0.98 c Dual Bound : -1.00000000000000e+20
0.89/0.98 c Gap : infinite
0.89/0.98 s UNSATISFIABLE
0.89/0.98 c SCIP Status : problem is solved [infeasible]
0.89/0.98 c Solving Time : 0.71
0.89/0.98 c Original Problem :
0.89/0.98 c Problem name : HOME/instance-2684563-1278432549.opb
0.89/0.98 c Variables : 3844 (3844 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.98 c Constraints : 11854 initial, 11854 maximal
0.89/0.98 c Presolved Problem :
0.89/0.98 c Problem name : t_HOME/instance-2684563-1278432549.opb
0.89/0.98 c Variables : 673 (673 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.98 c Constraints : 1698 initial, 1698 maximal
0.89/0.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.98 c trivial : 0.00 159 0 0 0 0 0 0 0
0.89/0.98 c dualfix : 0.01 27 0 0 0 0 0 0 0
0.89/0.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.98 c implics : 0.02 0 12 0 0 0 0 0 0
0.89/0.98 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.98 c linear : 0.63 2211 762 0 2364 0 10156 175 145
0.89/0.98 c root node : - 0 - - 0 - - - -
0.89/0.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.98 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.98 c linear : 1698 0 0 0 0 0 0 0 0 0
0.89/0.98 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.98 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.98 c linear : 0.00 0.00 0.00 0.00 0.00
0.89/0.98 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.98 c Propagators : Time Calls Cutoffs DomReds
0.89/0.98 c pseudoobj : 0.00 0 0 0
0.89/0.98 c rootredcost : 0.00 0 0 0
0.89/0.98 c vbounds : 0.00 0 0 0
0.89/0.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.98 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.98 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.98 c applied globally : - - - 0 0.0 - - -
0.89/0.98 c applied locally : - - - 0 0.0 - - -
0.89/0.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.98 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/0.98 c redcost : 0.00 0 0 0 0 0
0.89/0.98 c impliedbounds : 0.00 0 0 0 0 0
0.89/0.98 c intobj : 0.00 0 0 0 0 0
0.89/0.98 c cgmip : 0.00 0 0 0 0 0
0.89/0.98 c gomory : 0.00 0 0 0 0 0
0.89/0.98 c strongcg : 0.00 0 0 0 0 0
0.89/0.98 c cmir : 0.00 0 0 0 0 0
0.89/0.98 c flowcover : 0.00 0 0 0 0 0
0.89/0.98 c clique : 0.00 0 0 0 0 0
0.89/0.98 c zerohalf : 0.00 0 0 0 0 0
0.89/0.98 c mcf : 0.00 0 0 0 0 0
0.89/0.98 c rapidlearning : 0.00 0 0 0 0 0
0.89/0.98 c Pricers : Time Calls Vars
0.89/0.98 c problem variables: 0.00 0 0
0.89/0.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.98 c pscost : 0.00 0 0 0 0 0 0
0.89/0.98 c inference : 0.00 0 0 0 0 0 0
0.89/0.98 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.98 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.98 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.98 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.98 c random : 0.00 0 0 0 0 0 0
0.89/0.98 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.98 c Primal Heuristics : Time Calls Found
0.89/0.98 c LP solutions : 0.00 - 0
0.89/0.98 c pseudo solutions : 0.00 - 0
0.89/0.98 c trivial : 0.00 1 0
0.89/0.98 c simplerounding : 0.00 0 0
0.89/0.98 c zirounding : 0.00 0 0
0.89/0.98 c rounding : 0.00 0 0
0.89/0.98 c shifting : 0.00 0 0
0.89/0.98 c intshifting : 0.00 0 0
0.89/0.98 c oneopt : 0.00 0 0
0.89/0.98 c twoopt : 0.00 0 0
0.89/0.98 c fixandinfer : 0.00 0 0
0.89/0.98 c feaspump : 0.00 0 0
0.89/0.98 c coefdiving : 0.00 0 0
0.89/0.98 c pscostdiving : 0.00 0 0
0.89/0.98 c fracdiving : 0.00 0 0
0.89/0.98 c veclendiving : 0.00 0 0
0.89/0.98 c intdiving : 0.00 0 0
0.89/0.98 c actconsdiving : 0.00 0 0
0.89/0.98 c objpscostdiving : 0.00 0 0
0.89/0.98 c rootsoldiving : 0.00 0 0
0.89/0.98 c linesearchdiving : 0.00 0 0
0.89/0.98 c guideddiving : 0.00 0 0
0.89/0.98 c octane : 0.00 0 0
0.89/0.98 c rens : 0.00 0 0
0.89/0.98 c rins : 0.00 0 0
0.89/0.98 c localbranching : 0.00 0 0
0.89/0.98 c mutation : 0.00 0 0
0.89/0.98 c crossover : 0.00 0 0
0.89/0.98 c dins : 0.00 0 0
0.89/0.98 c undercover : 0.00 0 0
0.89/0.98 c nlp : 0.00 0 0
0.89/0.98 c trysol : 0.00 0 0
0.89/0.98 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.98 c primal LP : 0.00 0 0 0.00 -
0.89/0.98 c dual LP : 0.00 0 0 0.00 -
0.89/0.98 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.98 c barrier LP : 0.00 0 0 0.00 -
0.89/0.98 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.98 c strong branching : 0.00 0 0 0.00 -
0.89/0.98 c (at root node) : - 0 0 0.00 -
0.89/0.98 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.98 c B&B Tree :
0.89/0.98 c number of runs : 1
0.89/0.98 c nodes : 0
0.89/0.98 c nodes (total) : 0
0.89/0.98 c nodes left : 1
0.89/0.98 c max depth : -1
0.89/0.98 c max depth (total): -1
0.89/0.98 c backtracks : 0 (0.0%)
0.89/0.98 c delayed cutoffs : 0
0.89/0.98 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.98 c avg switch length: 0.00
0.89/0.98 c switching time : 0.00
0.89/0.98 c Solution :
0.89/0.98 c Solutions found : 0 (0 improvements)
0.89/0.98 c Primal Bound : infeasible
0.89/0.98 c Dual Bound : -
0.89/0.98 c Gap : infinite
0.89/0.98 c Root Dual Bound : -
0.89/0.98 c Root Iterations : 0
0.99/1.01 c Time complete: 1.