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-2666324-1276680244.opb>
0.02/0.03 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.02/0.03 c problem read
0.02/0.03 c No objective function, only one solution is needed.
0.02/0.03 c presolving settings loaded
0.02/0.04 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 11812 implications, 100 cliques
0.39/0.42 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 100 constraints of type <setppc>
0.39/0.42 c 1464 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 50 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.19
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.59/0.68 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.68 c 0.4s| 1 | 0 | 667 | - |7165k| 0 | 341 |1564 |1616 |1564 |3080 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.39/2.48 c 2.0s| 1 | 0 | 837 | - |8709k| 0 | 350 |1564 |1857 |1564 |3102 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
3.89/3.99 c 3.5s| 1 | 0 | 958 | - |9150k| 0 | 337 |1564 |1857 |1564 |3114 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
5.39/5.48 c 5.0s| 1 | 0 | 1029 | - |9829k| 0 | 307 |1564 |1857 |1564 |3120 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
6.88/6.91 c 6.4s| 1 | 0 | 1113 | - | 10M| 0 | 329 |1564 |1857 |1564 |3125 | 45 | 0 | 0 | 0.000000e+00 | -- | Inf
8.38/8.48 c 7.9s| 1 | 0 | 1229 | - | 10M| 0 | 310 |1564 |1857 |1564 |3131 | 51 | 0 | 0 | 0.000000e+00 | -- | Inf
13.48/13.56 c 13.0s| 1 | 2 | 1229 | - | 10M| 0 | 310 |1564 |1857 |1564 |3131 | 51 | 0 | 9 | 0.000000e+00 | -- | Inf
101.25/101.35 c
101.25/101.35 c SCIP Status : problem is solved [infeasible]
101.25/101.35 c Solving Time (sec) : 99.78
101.25/101.35 c Solving Nodes : 303
101.25/101.35 c Primal Bound : +1.00000000000000e+20 (0 solutions)
101.25/101.35 c Dual Bound : +1.00000000000000e+20
101.25/101.35 c Gap : 0.00 %
101.25/101.35 s UNSATISFIABLE
101.25/101.35 c SCIP Status : problem is solved [infeasible]
101.25/101.35 c Solving Time : 99.78
101.25/101.35 c Original Problem :
101.25/101.35 c Problem name : HOME/instance-2666324-1276680244.opb
101.25/101.35 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
101.25/101.35 c Constraints : 1616 initial, 1616 maximal
101.25/101.35 c Presolved Problem :
101.25/101.35 c Problem name : t_HOME/instance-2666324-1276680244.opb
101.25/101.35 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
101.25/101.35 c Constraints : 1616 initial, 1963 maximal
101.25/101.35 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
101.25/101.35 c trivial : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c dualfix : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c boundshift : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c inttobinary : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c implics : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c probing : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c knapsack : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c setppc : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c and : 0.17 0 0 0 0 0 0 0 0
101.25/101.35 c linear : 0.01 0 0 0 0 0 0 0 0
101.25/101.35 c logicor : 0.00 0 0 0 0 0 0 0 0
101.25/101.35 c root node : - 27 - - 27 - - - -
101.25/101.35 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
101.25/101.35 c integral : 0 0 0 204 0 5 127 0 0 308
101.25/101.35 c knapsack : 1 5 1369 0 0 7 0 0 0 0
101.25/101.35 c setppc : 100 5 1362 0 0 0 1044 0 0 0
101.25/101.35 c and : 1464 259 1362 0 0 0 26309 34939 0 0
101.25/101.35 c linear : 1+ 6 1362 0 0 0 23 0 0 0
101.25/101.35 c logicor : 50+ 5 333 0 0 0 280 0 0 0
101.25/101.35 c countsols : 0 0 0 0 0 0 0 0 0 0
101.25/101.35 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
101.25/101.35 c integral : 52.20 0.00 0.00 52.20 0.00
101.25/101.35 c knapsack : 0.01 0.00 0.01 0.00 0.00
101.25/101.35 c setppc : 0.01 0.00 0.01 0.00 0.00
101.25/101.35 c and : 0.48 0.35 0.13 0.00 0.00
101.25/101.35 c linear : 0.08 0.00 0.08 0.00 0.00
101.25/101.35 c logicor : 0.02 0.00 0.02 0.00 0.00
101.25/101.35 c countsols : 0.00 0.00 0.00 0.00 0.00
101.25/101.35 c Propagators : Time Calls Cutoffs DomReds
101.25/101.35 c vbounds : 0.00 1 0 0
101.25/101.35 c rootredcost : 0.00 0 0 0
101.25/101.35 c pseudoobj : 0.00 0 0 0
101.25/101.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
101.25/101.35 c propagation : 0.00 7 7 20 13.1 0 0.0 -
101.25/101.35 c infeasible LP : 0.11 137 133 462 14.4 0 0.0 0
101.25/101.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
101.25/101.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
101.25/101.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
101.25/101.35 c applied globally : - - - 226 10.7 - - -
101.25/101.35 c applied locally : - - - 0 0.0 - - -
101.25/101.35 c Separators : Time Calls Cutoffs DomReds Cuts Conss
101.25/101.35 c cut pool : 0.00 4 - - 3 - (maximal pool size: 503)
101.25/101.35 c redcost : 0.02 259 0 0 0 0
101.25/101.35 c impliedbounds : 0.01 5 0 0 40 0
101.25/101.35 c intobj : 0.00 0 0 0 0 0
101.25/101.35 c cgmip : 0.00 0 0 0 0 0
101.25/101.35 c gomory : 4.62 5 0 0 0 0
101.25/101.35 c strongcg : 1.93 5 0 0 2500 0
101.25/101.35 c cmir : 0.00 0 0 0 0 0
101.25/101.35 c flowcover : 0.00 0 0 0 0 0
101.25/101.35 c clique : 0.05 5 0 0 31 0
101.25/101.35 c zerohalf : 0.00 0 0 0 0 0
101.25/101.35 c mcf : 0.09 4 0 0 24 0
101.25/101.35 c rapidlearning : 0.38 1 0 0 0 241
101.25/101.35 c Pricers : Time Calls Vars
101.25/101.35 c problem variables: 0.00 0 0
101.25/101.35 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
101.25/101.35 c relpscost : 52.20 204 5 127 0 0 308
101.25/101.35 c pscost : 0.00 0 0 0 0 0 0
101.25/101.35 c inference : 0.00 0 0 0 0 0 0
101.25/101.35 c mostinf : 0.00 0 0 0 0 0 0
101.25/101.35 c leastinf : 0.00 0 0 0 0 0 0
101.25/101.35 c fullstrong : 0.00 0 0 0 0 0 0
101.25/101.35 c allfullstrong : 0.00 0 0 0 0 0 0
101.25/101.35 c random : 0.00 0 0 0 0 0 0
101.25/101.35 c Primal Heuristics : Time Calls Found
101.25/101.35 c LP solutions : 0.00 - 0
101.25/101.35 c pseudo solutions : 0.00 - 0
101.25/101.35 c trivial : 0.01 1 0
101.25/101.35 c simplerounding : 0.00 0 0
101.25/101.35 c zirounding : 0.00 0 0
101.25/101.35 c rounding : 0.00 0 0
101.25/101.35 c shifting : 0.00 0 0
101.25/101.35 c intshifting : 0.00 0 0
101.25/101.35 c oneopt : 0.00 0 0
101.25/101.35 c twoopt : 0.00 0 0
101.25/101.35 c fixandinfer : 0.00 0 0
101.25/101.35 c feaspump : 0.00 0 0
101.25/101.35 c coefdiving : 0.00 0 0
101.25/101.35 c pscostdiving : 0.00 0 0
101.25/101.35 c fracdiving : 0.00 0 0
101.25/101.35 c veclendiving : 0.00 0 0
101.25/101.35 c intdiving : 0.00 0 0
101.25/101.35 c actconsdiving : 0.00 0 0
101.25/101.35 c objpscostdiving : 0.00 0 0
101.25/101.35 c rootsoldiving : 0.00 0 0
101.25/101.35 c linesearchdiving : 0.00 0 0
101.25/101.35 c guideddiving : 0.00 0 0
101.25/101.35 c octane : 0.00 0 0
101.25/101.35 c rens : 0.00 0 0
101.25/101.35 c rins : 0.00 0 0
101.25/101.35 c localbranching : 0.00 0 0
101.25/101.35 c mutation : 0.00 0 0
101.25/101.35 c crossover : 0.00 0 0
101.25/101.35 c dins : 0.00 0 0
101.25/101.35 c undercover : 0.00 0 0
101.25/101.35 c nlp : 0.00 0 0
101.25/101.35 c trysol : 0.00 0 0
101.25/101.35 c LP : Time Calls Iterations Iter/call Iter/sec
101.25/101.35 c primal LP : 0.18 0 0 0.00 0.00
101.25/101.35 c dual LP : 38.47 592 115176 194.55 2993.92
101.25/101.35 c lex dual LP : 0.00 0 0 0.00 -
101.25/101.35 c barrier LP : 0.00 0 0 0.00 -
101.25/101.35 c diving/probing LP: 0.00 0 0 0.00 -
101.25/101.35 c strong branching : 52.16 919 163753 178.19 3139.44
101.25/101.35 c (at root node) : - 9 6103 678.11 -
101.25/101.35 c conflict analysis: 0.00 0 0 0.00 -
101.25/101.35 c B&B Tree :
101.25/101.35 c number of runs : 1
101.25/101.35 c nodes : 303
101.25/101.35 c nodes (total) : 303
101.25/101.35 c nodes left : 0
101.25/101.35 c max depth : 41
101.25/101.35 c max depth (total): 41
101.25/101.35 c backtracks : 56 (18.5%)
101.25/101.35 c delayed cutoffs : 6
101.25/101.35 c repropagations : 450 (3546 domain reductions, 0 cutoffs)
101.25/101.35 c avg switch length: 4.31
101.25/101.35 c switching time : 0.29
101.25/101.35 c Solution :
101.25/101.35 c Solutions found : 0 (0 improvements)
101.25/101.35 c Primal Bound : infeasible
101.25/101.35 c Dual Bound : -
101.25/101.35 c Gap : 0.00 %
101.25/101.35 c Root Dual Bound : +0.00000000000000e+00
101.25/101.35 c Root Iterations : 1229
101.25/101.38 c Time complete: 101.34.