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