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-2665974-1276332710.opb>
0.04/0.09 c original problem has 1804 variables (1804 bin, 0 int, 0 impl, 0 cont) and 4931 constraints
0.04/0.09 c problem read
0.04/0.09 c No objective function, only one solution is needed.
0.04/0.09 c presolving settings loaded
0.09/0.12 c presolving:
0.19/0.21 c (round 1) 282 del vars, 295 del conss, 112 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99792 impls, 0 clqs
0.19/0.23 c (round 2) 290 del vars, 714 del conss, 120 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99812 impls, 0 clqs
0.19/0.23 c (round 3) 298 del vars, 727 del conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99866 impls, 0 clqs
0.19/0.24 c (round 4) 300 del vars, 743 del conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.19/0.25 c (round 5) 300 del vars, 747 del conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 0 upgd conss, 99930 impls, 0 clqs
0.29/0.31 c (round 6) 300 del vars, 756 del conss, 124 chg bounds, 112 chg sides, 290 chg coeffs, 4175 upgd conss, 99930 impls, 0 clqs
0.29/0.33 c presolving (7 rounds):
0.29/0.33 c 300 deleted vars, 756 deleted constraints, 124 tightened bounds, 0 added holes, 112 changed sides, 290 changed coefficients
0.29/0.33 c 99930 implications, 0 cliques
0.29/0.33 c presolved problem has 1504 variables (1504 bin, 0 int, 0 impl, 0 cont) and 4175 constraints
0.29/0.33 c 224 constraints of type <knapsack>
0.29/0.33 c 3951 constraints of type <logicor>
0.29/0.33 c transformed objective value is always integral (scale: 1)
0.29/0.33 c Presolving Time: 0.19
0.29/0.33 c - non default parameters ----------------------------------------------------------------------
0.29/0.33 c # SCIP version 1.2.1.2
0.29/0.33 c
0.29/0.33 c # frequency for displaying node information lines
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.33 c display/freq = 10000
0.29/0.33 c
0.29/0.33 c # maximal time in seconds to run
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/time = 1799.91
0.29/0.33 c
0.29/0.33 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/memory = 1620
0.29/0.33 c
0.29/0.33 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c limits/solutions = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.33 c separating/maxrounds = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/maxroundsroot = 5
0.29/0.33 c
0.29/0.33 c # should presolving try to simplify inequalities
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.33 c constraints/linear/simplifyinequalities = TRUE
0.29/0.33 c
0.29/0.33 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.33 c constraints/knapsack/disaggregation = FALSE
0.29/0.33 c
0.29/0.33 c # should presolving try to simplify knapsacks
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.33 c constraints/knapsack/simplifyinequalities = TRUE
0.29/0.33 c
0.29/0.33 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c presolving/probing/maxrounds = 0
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/coefdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.33 c heuristics/crossover/freq = -1
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/crossover/nodesofs = 750
0.29/0.33 c
0.29/0.33 c # number of nodes without incumbent change that heuristic should wait
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.33 c heuristics/crossover/nwaitingnodes = 100
0.29/0.33 c
0.29/0.33 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.33 c # [type: real, range: [0,1], default: 0.1]
0.29/0.33 c heuristics/crossover/nodesquot = 0.15
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixed
0.29/0.33 c # [type: real, range: [0,1], default: 0.666]
0.29/0.33 c heuristics/crossover/minfixingrate = 0.5
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/feaspump/freq = -1
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/fracdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/guideddiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/intshifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/linesearchdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/nlp/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/objpscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.33 c # [type: real, range: [0,1], default: 0.01]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/oneopt/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/pscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/rens/freq = -1
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixable
0.29/0.33 c # [type: real, range: [0,1], default: 0.5]
0.29/0.33 c heuristics/rens/minfixingrate = 0.3
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/rens/nodesofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/rootsoldiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/rounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/shifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/simplerounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/trivial/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/trysol/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/veclendiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/zirounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/cmir/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/flowcover/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/rapidlearning/freq = 0
0.29/0.33 c
0.29/0.33 c -----------------------------------------------------------------------------------------------
0.29/0.33 c start solving
0.29/0.34 c
0.39/0.41 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.41 c 0.3s| 1 | 0 | 590 | - | 11M| 0 | 512 |1504 |4175 |1504 |4175 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.08 c 0.9s| 1 | 0 | 591 | - | 10M| 0 | - |1504 |4422 |1504 |4175 | 0 | 0 | 0 | -- | -- | 0.00%
1.00/1.08 c 0.9s| 1 | 0 | 591 | - | 10M| 0 | - |1504 |4422 |1504 |4175 | 0 | 0 | 0 | -- | -- | 0.00%
1.00/1.08 c
1.00/1.08 c SCIP Status : problem is solved [infeasible]
1.00/1.08 c Solving Time (sec) : 0.87
1.00/1.08 c Solving Nodes : 1
1.00/1.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.00/1.08 c Dual Bound : +1.00000000000000e+20
1.00/1.08 c Gap : 0.00 %
1.00/1.08 s UNSATISFIABLE
1.00/1.08 c SCIP Status : problem is solved [infeasible]
1.00/1.08 c Solving Time : 0.87
1.00/1.08 c Original Problem :
1.00/1.08 c Problem name : HOME/instance-2665974-1276332710.opb
1.00/1.08 c Variables : 1804 (1804 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.08 c Constraints : 4931 initial, 4931 maximal
1.00/1.08 c Presolved Problem :
1.00/1.08 c Problem name : t_HOME/instance-2665974-1276332710.opb
1.00/1.08 c Variables : 1504 (1504 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.08 c Constraints : 4175 initial, 4422 maximal
1.00/1.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.08 c trivial : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c implics : 0.03 0 171 0 0 0 0 0 0
1.00/1.08 c probing : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.00/1.08 c linear : 0.12 124 5 0 124 0 756 112 290
1.00/1.08 c logicor : 0.02 0 0 0 0 0 0 0 0
1.00/1.08 c root node : - 1050 - - 1050 - - - -
1.00/1.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.08 c integral : 0 0 0 0 0 0 0 0 0 0
1.00/1.08 c knapsack : 224 1 1 0 0 0 0 200 0 0
1.00/1.08 c linear : 0+ 0 0 0 0 0 0 0 0 0
1.00/1.08 c logicor : 3951 1 1 0 0 0 0 0 0 0
1.00/1.08 c countsols : 0 0 0 0 0 0 0 0 0 0
1.00/1.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.08 c integral : 0.00 0.00 0.00 0.00 0.00
1.00/1.08 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.00/1.08 c linear : 0.00 0.00 0.00 0.00 0.00
1.00/1.08 c logicor : 0.00 0.00 0.00 0.00 0.00
1.00/1.08 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.08 c Propagators : Time Calls Cutoffs DomReds
1.00/1.08 c vbounds : 0.00 1 0 0
1.00/1.08 c rootredcost : 0.00 0 0 0
1.00/1.08 c pseudoobj : 0.00 0 0 0
1.00/1.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.08 c applied globally : - - - 0 0.0 - - -
1.00/1.08 c applied locally : - - - 0 0.0 - - -
1.00/1.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 284)
1.00/1.08 c redcost : 0.00 1 0 0 0 0
1.00/1.08 c impliedbounds : 0.01 1 0 0 0 0
1.00/1.08 c intobj : 0.00 0 0 0 0 0
1.00/1.08 c cgmip : 0.00 0 0 0 0 0
1.00/1.08 c gomory : 0.03 1 0 0 500 0
1.00/1.08 c strongcg : 0.03 1 0 0 500 0
1.00/1.08 c cmir : 0.00 0 0 0 0 0
1.00/1.08 c flowcover : 0.00 0 0 0 0 0
1.00/1.08 c clique : 0.09 1 0 0 8 0
1.00/1.08 c zerohalf : 0.00 0 0 0 0 0
1.00/1.08 c mcf : 0.01 1 0 0 0 0
1.00/1.08 c rapidlearning : 0.43 1 0 1050 0 247
1.00/1.08 c Pricers : Time Calls Vars
1.00/1.08 c problem variables: 0.00 0 0
1.00/1.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.08 c pscost : 0.00 0 0 0 0 0 0
1.00/1.08 c inference : 0.00 0 0 0 0 0 0
1.00/1.08 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.08 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.08 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.08 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.08 c random : 0.00 0 0 0 0 0 0
1.00/1.08 c relpscost : 0.00 0 0 0 0 0 0
1.00/1.08 c Primal Heuristics : Time Calls Found
1.00/1.08 c LP solutions : 0.00 - 0
1.00/1.08 c pseudo solutions : 0.00 - 0
1.00/1.08 c trivial : 0.00 1 0
1.00/1.08 c simplerounding : 0.00 0 0
1.00/1.08 c zirounding : 0.00 0 0
1.00/1.08 c rounding : 0.00 0 0
1.00/1.08 c shifting : 0.00 0 0
1.00/1.08 c intshifting : 0.00 0 0
1.00/1.08 c oneopt : 0.00 0 0
1.00/1.08 c twoopt : 0.00 0 0
1.00/1.08 c fixandinfer : 0.00 0 0
1.00/1.08 c feaspump : 0.00 0 0
1.00/1.08 c coefdiving : 0.00 0 0
1.00/1.08 c pscostdiving : 0.00 0 0
1.00/1.08 c fracdiving : 0.00 0 0
1.00/1.08 c veclendiving : 0.00 0 0
1.00/1.08 c intdiving : 0.00 0 0
1.00/1.08 c actconsdiving : 0.00 0 0
1.00/1.08 c objpscostdiving : 0.00 0 0
1.00/1.08 c rootsoldiving : 0.00 0 0
1.00/1.08 c linesearchdiving : 0.00 0 0
1.00/1.08 c guideddiving : 0.00 0 0
1.00/1.09 c octane : 0.00 0 0
1.00/1.09 c rens : 0.00 0 0
1.00/1.09 c rins : 0.00 0 0
1.00/1.09 c localbranching : 0.00 0 0
1.00/1.09 c mutation : 0.00 0 0
1.00/1.09 c crossover : 0.00 0 0
1.00/1.09 c dins : 0.00 0 0
1.00/1.09 c undercover : 0.00 0 0
1.00/1.09 c nlp : 0.00 0 0
1.00/1.09 c trysol : 0.00 0 0
1.00/1.09 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.09 c primal LP : 0.00 0 0 0.00 -
1.00/1.09 c dual LP : 0.06 2 591 295.50 9850.00
1.00/1.09 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.09 c barrier LP : 0.00 0 0 0.00 -
1.00/1.09 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.09 c strong branching : 0.00 0 0 0.00 -
1.00/1.09 c (at root node) : - 0 0 0.00 -
1.00/1.09 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.09 c B&B Tree :
1.00/1.09 c number of runs : 1
1.00/1.09 c nodes : 1
1.00/1.09 c nodes (total) : 1
1.00/1.09 c nodes left : 0
1.00/1.09 c max depth : 0
1.00/1.09 c max depth (total): 0
1.00/1.09 c backtracks : 0 (0.0%)
1.00/1.09 c delayed cutoffs : 0
1.00/1.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.00/1.09 c avg switch length: 2.00
1.00/1.09 c switching time : 0.00
1.00/1.09 c Solution :
1.00/1.09 c Solutions found : 0 (0 improvements)
1.00/1.09 c Primal Bound : infeasible
1.00/1.09 c Dual Bound : -
1.00/1.09 c Gap : 0.00 %
1.00/1.09 c Root Dual Bound : -
1.00/1.09 c Root Iterations : 591
1.10/1.11 c Time complete: 1.11.