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