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-2685123-1278439839.opb>
0.89/0.99 c original problem has 17836 variables (17836 bin, 0 int, 0 impl, 0 cont) and 61428 constraints
0.89/0.99 c problem read
0.89/0.99 c No objective function, only one solution is needed.
0.89/0.99 c presolving settings loaded
1.19/1.28 c presolving:
3.89/3.90 c (round 1) 5966 del vars, 17283 del conss, 4657 chg bounds, 3 chg sides, 3 chg coeffs, 0 upgd conss, 3313636 impls, 0 clqs
4.89/4.95 c (round 2) 11541 del vars, 38887 del conss, 9863 chg bounds, 7 chg sides, 7 chg coeffs, 0 upgd conss, 3347439 impls, 0 clqs
4.99/5.09 c (round 3) 13344 del vars, 47830 del conss, 10988 chg bounds, 119 chg sides, 112 chg coeffs, 0 upgd conss, 3356848 impls, 0 clqs
5.09/5.15 c (round 4) 14157 del vars, 50851 del conss, 11542 chg bounds, 209 chg sides, 206 chg coeffs, 0 upgd conss, 3363702 impls, 0 clqs
5.19/5.20 c (round 5) 14687 del vars, 52745 del conss, 11889 chg bounds, 256 chg sides, 262 chg coeffs, 0 upgd conss, 3369059 impls, 0 clqs
5.19/5.22 c presolving (6 rounds):
5.19/5.22 c 14800 deleted vars, 53280 deleted constraints, 11950 tightened bounds, 0 added holes, 257 changed sides, 263 changed coefficients
5.19/5.22 c 3370393 implications, 0 cliques
5.19/5.22 c presolving detected infeasibility
5.19/5.22 c Presolving Time: 3.82
5.19/5.22 c - non default parameters ----------------------------------------------------------------------
5.19/5.22 c # SCIP version 1.2.1.2
5.19/5.22 c
5.19/5.22 c # frequency for displaying node information lines
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 100]
5.19/5.22 c display/freq = 10000
5.19/5.22 c
5.19/5.22 c # maximal time in seconds to run
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.19/5.22 c limits/time = 1799.01
5.19/5.22 c
5.19/5.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
5.19/5.22 c limits/memory = 1620
5.19/5.22 c
5.19/5.22 c # solving stops, if the given number of solutions were found (-1: no limit)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: -1]
5.19/5.22 c limits/solutions = 1
5.19/5.22 c
5.19/5.22 c # maximal number of separation rounds per node (-1: unlimited)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 5]
5.19/5.22 c separating/maxrounds = 1
5.19/5.22 c
5.19/5.22 c # maximal number of separation rounds in the root node (-1: unlimited)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: -1]
5.19/5.22 c separating/maxroundsroot = 5
5.19/5.22 c
5.19/5.22 c # should presolving try to simplify inequalities
5.19/5.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.19/5.22 c constraints/linear/simplifyinequalities = TRUE
5.19/5.22 c
5.19/5.22 c # should disaggregation of knapsack constraints be allowed in preprocessing?
5.19/5.22 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
5.19/5.22 c constraints/knapsack/disaggregation = FALSE
5.19/5.22 c
5.19/5.22 c # should presolving try to simplify knapsacks
5.19/5.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
5.19/5.22 c constraints/knapsack/simplifyinequalities = TRUE
5.19/5.22 c
5.19/5.22 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: -1]
5.19/5.22 c presolving/probing/maxrounds = 0
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/coefdiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/coefdiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/coefdiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 30]
5.19/5.22 c heuristics/crossover/freq = -1
5.19/5.22 c
5.19/5.22 c # number of nodes added to the contingent of the total nodes
5.19/5.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
5.19/5.22 c heuristics/crossover/nodesofs = 750
5.19/5.22 c
5.19/5.22 c # number of nodes without incumbent change that heuristic should wait
5.19/5.22 c # [type: longint, range: [0,9223372036854775807], default: 200]
5.19/5.22 c heuristics/crossover/nwaitingnodes = 100
5.19/5.22 c
5.19/5.22 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
5.19/5.22 c # [type: real, range: [0,1], default: 0.1]
5.19/5.22 c heuristics/crossover/nodesquot = 0.15
5.19/5.22 c
5.19/5.22 c # minimum percentage of integer variables that have to be fixed
5.19/5.22 c # [type: real, range: [0,1], default: 0.666]
5.19/5.22 c heuristics/crossover/minfixingrate = 0.5
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 20]
5.19/5.22 c heuristics/feaspump/freq = -1
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/feaspump/maxlpiterofs = 2000
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/fracdiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/fracdiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/fracdiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/guideddiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/guideddiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/guideddiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/intdiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/intshifting/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/linesearchdiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/linesearchdiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/linesearchdiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/nlp/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 20]
5.19/5.22 c heuristics/objpscostdiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to total iteration number
5.19/5.22 c # [type: real, range: [0,1], default: 0.01]
5.19/5.22 c heuristics/objpscostdiving/maxlpiterquot = 0.015
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/objpscostdiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/oneopt/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/pscostdiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/pscostdiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/pscostdiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 0]
5.19/5.22 c heuristics/rens/freq = -1
5.19/5.22 c
5.19/5.22 c # minimum percentage of integer variables that have to be fixable
5.19/5.22 c # [type: real, range: [0,1], default: 0.5]
5.19/5.22 c heuristics/rens/minfixingrate = 0.3
5.19/5.22 c
5.19/5.22 c # number of nodes added to the contingent of the total nodes
5.19/5.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
5.19/5.22 c heuristics/rens/nodesofs = 2000
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 20]
5.19/5.22 c heuristics/rootsoldiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
5.19/5.22 c heuristics/rootsoldiving/maxlpiterquot = 0.015
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/rootsoldiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/rounding/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/shifting/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/simplerounding/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 0]
5.19/5.22 c heuristics/trivial/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/trysol/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 10]
5.19/5.22 c heuristics/veclendiving/freq = -1
5.19/5.22 c
5.19/5.22 c # maximal fraction of diving LP iterations compared to node LP iterations
5.19/5.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
5.19/5.22 c heuristics/veclendiving/maxlpiterquot = 0.075
5.19/5.22 c
5.19/5.22 c # additional number of allowed LP iterations
5.19/5.22 c # [type: int, range: [0,2147483647], default: 1000]
5.19/5.22 c heuristics/veclendiving/maxlpiterofs = 1500
5.19/5.22 c
5.19/5.22 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 1]
5.19/5.22 c heuristics/zirounding/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 0]
5.19/5.22 c separating/cmir/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: 0]
5.19/5.22 c separating/flowcover/freq = -1
5.19/5.22 c
5.19/5.22 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
5.19/5.22 c # [type: int, range: [-1,2147483647], default: -1]
5.19/5.22 c separating/rapidlearning/freq = 0
5.19/5.22 c
5.19/5.22 c -----------------------------------------------------------------------------------------------
5.19/5.22 c start solving
5.19/5.22 c
5.19/5.22 c SCIP Status : problem is solved [infeasible]
5.19/5.22 c Solving Time (sec) : 3.96
5.19/5.22 c Solving Nodes : 0
5.19/5.22 c Primal Bound : +1.00000000000000e+20 (0 solutions)
5.19/5.22 c Dual Bound : -1.00000000000000e+20
5.19/5.22 c Gap : infinite
5.19/5.22 s UNSATISFIABLE
5.19/5.22 c SCIP Status : problem is solved [infeasible]
5.19/5.22 c Solving Time : 3.96
5.19/5.22 c Original Problem :
5.19/5.22 c Problem name : HOME/instance-2685123-1278439839.opb
5.19/5.22 c Variables : 17836 (17836 binary, 0 integer, 0 implicit integer, 0 continuous)
5.19/5.22 c Constraints : 61428 initial, 61428 maximal
5.19/5.22 c Presolved Problem :
5.19/5.22 c Problem name : t_HOME/instance-2685123-1278439839.opb
5.19/5.22 c Variables : 3036 (3036 binary, 0 integer, 0 implicit integer, 0 continuous)
5.19/5.22 c Constraints : 8148 initial, 8148 maximal
5.19/5.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.19/5.22 c trivial : 0.00 490 0 0 0 0 0 0 0
5.19/5.22 c dualfix : 0.03 89 0 0 0 0 0 0 0
5.19/5.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.19/5.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.19/5.22 c implics : 0.04 0 0 0 0 0 0 0 0
5.19/5.22 c probing : 0.00 0 0 0 0 0 0 0 0
5.19/5.22 c linear : 3.57 11458 2763 0 11950 0 53280 257 263
5.19/5.22 c root node : - 0 - - 0 - - - -
5.19/5.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.19/5.22 c integral : 0 0 0 0 0 0 0 0 0 0
5.19/5.22 c linear : 8148 0 0 0 0 0 0 0 0 0
5.19/5.22 c countsols : 0 0 0 0 0 0 0 0 0 0
5.19/5.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.19/5.22 c integral : 0.00 0.00 0.00 0.00 0.00
5.19/5.22 c linear : 0.00 0.00 0.00 0.00 0.00
5.19/5.22 c countsols : 0.00 0.00 0.00 0.00 0.00
5.19/5.22 c Propagators : Time Calls Cutoffs DomReds
5.19/5.22 c pseudoobj : 0.00 0 0 0
5.19/5.22 c rootredcost : 0.00 0 0 0
5.19/5.22 c vbounds : 0.00 0 0 0
5.19/5.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.19/5.22 c propagation : 0.00 0 0 0 0.0 0 0.0 -
5.19/5.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.19/5.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.19/5.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.19/5.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.19/5.22 c applied globally : - - - 0 0.0 - - -
5.19/5.22 c applied locally : - - - 0 0.0 - - -
5.19/5.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.19/5.22 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.19/5.22 c redcost : 0.00 0 0 0 0 0
5.19/5.22 c impliedbounds : 0.00 0 0 0 0 0
5.19/5.22 c intobj : 0.00 0 0 0 0 0
5.19/5.22 c cgmip : 0.00 0 0 0 0 0
5.19/5.22 c gomory : 0.00 0 0 0 0 0
5.19/5.22 c strongcg : 0.00 0 0 0 0 0
5.19/5.22 c cmir : 0.00 0 0 0 0 0
5.19/5.22 c flowcover : 0.00 0 0 0 0 0
5.19/5.22 c clique : 0.00 0 0 0 0 0
5.19/5.22 c zerohalf : 0.00 0 0 0 0 0
5.19/5.22 c mcf : 0.00 0 0 0 0 0
5.19/5.22 c rapidlearning : 0.00 0 0 0 0 0
5.19/5.22 c Pricers : Time Calls Vars
5.19/5.22 c problem variables: 0.00 0 0
5.19/5.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.19/5.22 c pscost : 0.00 0 0 0 0 0 0
5.19/5.22 c inference : 0.00 0 0 0 0 0 0
5.19/5.22 c mostinf : 0.00 0 0 0 0 0 0
5.19/5.22 c leastinf : 0.00 0 0 0 0 0 0
5.19/5.22 c fullstrong : 0.00 0 0 0 0 0 0
5.19/5.22 c allfullstrong : 0.00 0 0 0 0 0 0
5.19/5.22 c random : 0.00 0 0 0 0 0 0
5.19/5.22 c relpscost : 0.00 0 0 0 0 0 0
5.19/5.22 c Primal Heuristics : Time Calls Found
5.19/5.22 c LP solutions : 0.00 - 0
5.19/5.22 c pseudo solutions : 0.00 - 0
5.19/5.22 c trivial : 0.04 1 0
5.19/5.22 c simplerounding : 0.00 0 0
5.19/5.22 c zirounding : 0.00 0 0
5.19/5.22 c rounding : 0.00 0 0
5.19/5.22 c shifting : 0.00 0 0
5.19/5.22 c intshifting : 0.00 0 0
5.19/5.22 c oneopt : 0.00 0 0
5.19/5.22 c twoopt : 0.00 0 0
5.19/5.22 c fixandinfer : 0.00 0 0
5.19/5.22 c feaspump : 0.00 0 0
5.19/5.22 c coefdiving : 0.00 0 0
5.19/5.22 c pscostdiving : 0.00 0 0
5.19/5.22 c fracdiving : 0.00 0 0
5.19/5.22 c veclendiving : 0.00 0 0
5.19/5.22 c intdiving : 0.00 0 0
5.19/5.22 c actconsdiving : 0.00 0 0
5.19/5.22 c objpscostdiving : 0.00 0 0
5.19/5.22 c rootsoldiving : 0.00 0 0
5.19/5.22 c linesearchdiving : 0.00 0 0
5.19/5.22 c guideddiving : 0.00 0 0
5.19/5.22 c octane : 0.00 0 0
5.19/5.22 c rens : 0.00 0 0
5.19/5.22 c rins : 0.00 0 0
5.19/5.22 c localbranching : 0.00 0 0
5.19/5.22 c mutation : 0.00 0 0
5.19/5.22 c crossover : 0.00 0 0
5.19/5.23 c dins : 0.00 0 0
5.19/5.23 c undercover : 0.00 0 0
5.19/5.23 c nlp : 0.00 0 0
5.19/5.23 c trysol : 0.00 0 0
5.19/5.23 c LP : Time Calls Iterations Iter/call Iter/sec
5.19/5.23 c primal LP : 0.00 0 0 0.00 -
5.19/5.23 c dual LP : 0.00 0 0 0.00 -
5.19/5.23 c lex dual LP : 0.00 0 0 0.00 -
5.19/5.23 c barrier LP : 0.00 0 0 0.00 -
5.19/5.23 c diving/probing LP: 0.00 0 0 0.00 -
5.19/5.23 c strong branching : 0.00 0 0 0.00 -
5.19/5.23 c (at root node) : - 0 0 0.00 -
5.19/5.23 c conflict analysis: 0.00 0 0 0.00 -
5.19/5.23 c B&B Tree :
5.19/5.23 c number of runs : 1
5.19/5.23 c nodes : 0
5.19/5.23 c nodes (total) : 0
5.19/5.23 c nodes left : 1
5.19/5.23 c max depth : -1
5.19/5.23 c max depth (total): -1
5.19/5.23 c backtracks : 0 (0.0%)
5.19/5.23 c delayed cutoffs : 0
5.19/5.23 c repropagations : 0 (0 domain reductions, 0 cutoffs)
5.19/5.23 c avg switch length: 0.00
5.19/5.23 c switching time : 0.00
5.19/5.23 c Solution :
5.19/5.23 c Solutions found : 0 (0 improvements)
5.19/5.23 c Primal Bound : infeasible
5.19/5.23 c Dual Bound : -
5.19/5.23 c Gap : infinite
5.19/5.23 c Root Dual Bound : -
5.19/5.23 c Root Iterations : 0
5.29/5.35 c Time complete: 5.35.