0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667421-1276335600.opb>
0.19/0.20 c original problem has 3736 variables (3736 bin, 0 int, 0 impl, 0 cont) and 10457 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.26 c presolving:
0.39/0.47 c (round 1) 474 del vars, 472 del conss, 175 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206361 impls, 0 clqs
0.49/0.50 c (round 2) 484 del vars, 1192 del conss, 185 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206395 impls, 0 clqs
0.49/0.51 c (round 3) 498 del vars, 1216 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206515 impls, 0 clqs
0.49/0.52 c (round 4) 499 del vars, 1238 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.49/0.53 c (round 5) 499 del vars, 1240 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206589 impls, 0 clqs
0.59/0.66 c (round 6) 499 del vars, 1251 del conss, 191 chg bounds, 184 chg sides, 460 chg coeffs, 9206 upgd conss, 206589 impls, 0 clqs
0.59/0.70 c presolving (7 rounds):
0.59/0.70 c 499 deleted vars, 1251 deleted constraints, 191 tightened bounds, 0 added holes, 184 changed sides, 460 changed coefficients
0.59/0.70 c 206589 implications, 0 cliques
0.59/0.70 c presolved problem has 3237 variables (3237 bin, 0 int, 0 impl, 0 cont) and 9206 constraints
0.59/0.70 c 368 constraints of type <knapsack>
0.59/0.70 c 8838 constraints of type <logicor>
0.59/0.70 c transformed objective value is always integral (scale: 1)
0.59/0.70 c Presolving Time: 0.38
0.59/0.70 c - non default parameters ----------------------------------------------------------------------
0.59/0.70 c # SCIP version 1.2.1.2
0.59/0.70 c
0.59/0.70 c # frequency for displaying node information lines
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.70 c display/freq = 10000
0.59/0.70 c
0.59/0.70 c # maximal time in seconds to run
0.59/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.70 c limits/time = 1799.81
0.59/0.70 c
0.59/0.70 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.70 c limits/memory = 1620
0.59/0.70 c
0.59/0.70 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.70 c limits/solutions = 1
0.59/0.70 c
0.59/0.70 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.70 c separating/maxrounds = 1
0.59/0.70 c
0.59/0.70 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.70 c separating/maxroundsroot = 5
0.59/0.70 c
0.59/0.70 c # should presolving try to simplify inequalities
0.59/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.70 c constraints/linear/simplifyinequalities = TRUE
0.59/0.70 c
0.59/0.70 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.70 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.70 c constraints/knapsack/disaggregation = FALSE
0.59/0.70 c
0.59/0.70 c # should presolving try to simplify knapsacks
0.59/0.70 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.70 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.70 c
0.59/0.70 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.70 c presolving/probing/maxrounds = 0
0.59/0.70 c
0.59/0.70 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.70 c heuristics/coefdiving/freq = -1
0.59/0.70 c
0.59/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.70 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.70 c
0.59/0.70 c # additional number of allowed LP iterations
0.59/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.70 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.70 c
0.59/0.70 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.70 c heuristics/crossover/freq = -1
0.59/0.70 c
0.59/0.70 c # number of nodes added to the contingent of the total nodes
0.59/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.70 c heuristics/crossover/nodesofs = 750
0.59/0.70 c
0.59/0.70 c # number of nodes without incumbent change that heuristic should wait
0.59/0.70 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.70 c heuristics/crossover/nwaitingnodes = 100
0.59/0.70 c
0.59/0.70 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.70 c # [type: real, range: [0,1], default: 0.1]
0.59/0.70 c heuristics/crossover/nodesquot = 0.15
0.59/0.70 c
0.59/0.70 c # minimum percentage of integer variables that have to be fixed
0.59/0.70 c # [type: real, range: [0,1], default: 0.666]
0.59/0.70 c heuristics/crossover/minfixingrate = 0.5
0.59/0.70 c
0.59/0.70 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.70 c heuristics/feaspump/freq = -1
0.59/0.70 c
0.59/0.70 c # additional number of allowed LP iterations
0.59/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.70 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.70 c
0.59/0.70 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.70 c heuristics/fracdiving/freq = -1
0.59/0.70 c
0.59/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/fracdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/fracdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/guideddiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/guideddiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/guideddiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/intdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/intshifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/linesearchdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/nlp/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/objpscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to total iteration number
0.69/0.70 c # [type: real, range: [0,1], default: 0.01]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/oneopt/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/pscostdiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/pscostdiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/rens/freq = -1
0.69/0.70 c
0.69/0.70 c # minimum percentage of integer variables that have to be fixable
0.69/0.70 c # [type: real, range: [0,1], default: 0.5]
0.69/0.70 c heuristics/rens/minfixingrate = 0.3
0.69/0.70 c
0.69/0.70 c # number of nodes added to the contingent of the total nodes
0.69/0.70 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.69/0.70 c heuristics/rens/nodesofs = 2000
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 20]
0.69/0.70 c heuristics/rootsoldiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/rounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/shifting/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/simplerounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c heuristics/trivial/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/trysol/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 10]
0.69/0.70 c heuristics/veclendiving/freq = -1
0.69/0.70 c
0.69/0.70 c # maximal fraction of diving LP iterations compared to node LP iterations
0.69/0.70 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.69/0.70 c heuristics/veclendiving/maxlpiterquot = 0.075
0.69/0.70 c
0.69/0.70 c # additional number of allowed LP iterations
0.69/0.70 c # [type: int, range: [0,2147483647], default: 1000]
0.69/0.70 c heuristics/veclendiving/maxlpiterofs = 1500
0.69/0.70 c
0.69/0.70 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.70 c heuristics/zirounding/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/cmir/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.70 c separating/flowcover/freq = -1
0.69/0.70 c
0.69/0.70 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.70 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.70 c separating/rapidlearning/freq = 0
0.69/0.70 c
0.69/0.70 c -----------------------------------------------------------------------------------------------
0.69/0.70 c start solving
0.69/0.70 c
1.39/1.41 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.41 c 1.1s| 1 | 0 | 2144 | - | 24M| 0 |1506 |3237 |9206 |3237 |9206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.91 c 4.4s| 1 | 0 | 2166 | - | 21M| 0 | - |3237 |9812 |3237 |9206 | 0 | 0 | 0 | -- | -- | 0.00%
4.89/4.91 c 4.4s| 1 | 0 | 2166 | - | 21M| 0 | - |3237 |9812 |3237 |9206 | 0 | 0 | 0 | -- | -- | 0.00%
4.89/4.91 c
4.89/4.91 c SCIP Status : problem is solved [infeasible]
4.89/4.91 c Solving Time (sec) : 4.38
4.89/4.91 c Solving Nodes : 1
4.89/4.91 c Primal Bound : +1.00000000000000e+20 (0 solutions)
4.89/4.91 c Dual Bound : +1.00000000000000e+20
4.89/4.91 c Gap : 0.00 %
4.89/4.91 s UNSATISFIABLE
4.89/4.91 c SCIP Status : problem is solved [infeasible]
4.89/4.91 c Solving Time : 4.38
4.89/4.91 c Original Problem :
4.89/4.91 c Problem name : HOME/instance-2667421-1276335600.opb
4.89/4.91 c Variables : 3736 (3736 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.91 c Constraints : 10457 initial, 10457 maximal
4.89/4.91 c Presolved Problem :
4.89/4.91 c Problem name : t_HOME/instance-2667421-1276335600.opb
4.89/4.91 c Variables : 3237 (3237 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.91 c Constraints : 9206 initial, 9812 maximal
4.89/4.91 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.89/4.91 c trivial : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c implics : 0.04 0 304 0 0 0 0 0 0
4.89/4.91 c probing : 0.00 0 0 0 0 0 0 0 0
4.89/4.91 c knapsack : 0.01 0 0 0 0 0 0 0 0
4.89/4.91 c linear : 0.25 191 4 0 191 0 1251 184 460
4.89/4.91 c logicor : 0.04 0 0 0 0 0 0 0 0
4.89/4.91 c root node : - 2417 - - 2417 - - - -
4.89/4.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.89/4.91 c integral : 0 0 0 0 0 0 0 0 0 0
4.89/4.91 c knapsack : 368 1 1 0 0 0 0 200 0 0
4.89/4.91 c linear : 0+ 0 0 0 0 0 0 0 0 0
4.89/4.91 c logicor : 8838 1 1 0 0 0 0 0 0 0
4.89/4.91 c countsols : 0 0 0 0 0 0 0 0 0 0
4.89/4.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.89/4.91 c integral : 0.00 0.00 0.00 0.00 0.00
4.89/4.91 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.89/4.91 c linear : 0.00 0.00 0.00 0.00 0.00
4.89/4.91 c logicor : 0.01 0.01 0.00 0.00 0.00
4.89/4.91 c countsols : 0.00 0.00 0.00 0.00 0.00
4.89/4.91 c Propagators : Time Calls Cutoffs DomReds
4.89/4.91 c vbounds : 0.00 1 0 0
4.89/4.91 c rootredcost : 0.00 0 0 0
4.89/4.91 c pseudoobj : 0.00 0 0 0
4.89/4.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.91 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.91 c applied globally : - - - 0 0.0 - - -
4.89/4.91 c applied locally : - - - 0 0.0 - - -
4.89/4.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.91 c cut pool : 0.00 0 - - 0 - (maximal pool size: 344)
4.89/4.91 c redcost : 0.00 1 0 0 0 0
4.89/4.91 c impliedbounds : 0.00 1 0 0 0 0
4.89/4.91 c intobj : 0.00 0 0 0 0 0
4.89/4.91 c cgmip : 0.00 0 0 0 0 0
4.89/4.91 c gomory : 0.16 1 0 0 500 0
4.89/4.91 c strongcg : 0.16 1 0 0 500 0
4.89/4.91 c cmir : 0.00 0 0 0 0 0
4.89/4.91 c flowcover : 0.00 0 0 0 0 0
4.89/4.91 c clique : 0.22 1 0 0 8 0
4.89/4.91 c zerohalf : 0.00 0 0 0 0 0
4.89/4.91 c mcf : 0.04 1 0 0 0 0
4.89/4.91 c rapidlearning : 2.66 1 0 2417 0 606
4.89/4.91 c Pricers : Time Calls Vars
4.89/4.91 c problem variables: 0.00 0 0
4.89/4.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.91 c pscost : 0.00 0 0 0 0 0 0
4.89/4.91 c inference : 0.00 0 0 0 0 0 0
4.89/4.91 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.91 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.91 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.91 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.91 c random : 0.00 0 0 0 0 0 0
4.89/4.91 c relpscost : 0.00 0 0 0 0 0 0
4.89/4.91 c Primal Heuristics : Time Calls Found
4.89/4.91 c LP solutions : 0.00 - 0
4.89/4.91 c pseudo solutions : 0.00 - 0
4.89/4.91 c trivial : 0.01 1 0
4.89/4.91 c simplerounding : 0.00 0 0
4.89/4.91 c zirounding : 0.00 0 0
4.89/4.91 c rounding : 0.00 0 0
4.89/4.91 c shifting : 0.00 0 0
4.89/4.91 c intshifting : 0.00 0 0
4.89/4.91 c oneopt : 0.00 0 0
4.89/4.91 c twoopt : 0.00 0 0
4.89/4.91 c fixandinfer : 0.00 0 0
4.89/4.91 c feaspump : 0.00 0 0
4.89/4.91 c coefdiving : 0.00 0 0
4.89/4.91 c pscostdiving : 0.00 0 0
4.89/4.91 c fracdiving : 0.00 0 0
4.89/4.91 c veclendiving : 0.00 0 0
4.89/4.91 c intdiving : 0.00 0 0
4.89/4.91 c actconsdiving : 0.00 0 0
4.89/4.91 c objpscostdiving : 0.00 0 0
4.89/4.91 c rootsoldiving : 0.00 0 0
4.89/4.91 c linesearchdiving : 0.00 0 0
4.89/4.91 c guideddiving : 0.00 0 0
4.89/4.91 c octane : 0.00 0 0
4.89/4.91 c rens : 0.00 0 0
4.89/4.91 c rins : 0.00 0 0
4.89/4.91 c localbranching : 0.00 0 0
4.89/4.91 c mutation : 0.00 0 0
4.89/4.91 c crossover : 0.00 0 0
4.89/4.91 c dins : 0.00 0 0
4.89/4.91 c undercover : 0.00 0 0
4.89/4.91 c nlp : 0.00 0 0
4.89/4.91 c trysol : 0.00 0 0
4.89/4.91 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.91 c primal LP : 0.00 0 0 0.00 -
4.89/4.91 c dual LP : 0.67 2 2166 1083.00 3232.84
4.89/4.91 c lex dual LP : 0.00 0 0 0.00 -
4.89/4.91 c barrier LP : 0.00 0 0 0.00 -
4.89/4.91 c diving/probing LP: 0.00 0 0 0.00 -
4.89/4.91 c strong branching : 0.00 0 0 0.00 -
4.89/4.91 c (at root node) : - 0 0 0.00 -
4.89/4.91 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.91 c B&B Tree :
4.89/4.91 c number of runs : 1
4.89/4.91 c nodes : 1
4.89/4.91 c nodes (total) : 1
4.89/4.91 c nodes left : 0
4.89/4.91 c max depth : 0
4.89/4.91 c max depth (total): 0
4.89/4.91 c backtracks : 0 (0.0%)
4.89/4.91 c delayed cutoffs : 0
4.89/4.91 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.89/4.91 c avg switch length: 2.00
4.89/4.91 c switching time : 0.00
4.89/4.91 c Solution :
4.89/4.91 c Solutions found : 0 (0 improvements)
4.89/4.91 c Primal Bound : infeasible
4.89/4.91 c Dual Bound : -
4.89/4.91 c Gap : 0.00 %
4.89/4.91 c Root Dual Bound : -
4.89/4.91 c Root Iterations : 2166
4.89/4.98 c Time complete: 4.97.