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-2664915-1276682991.opb>
0.00/0.02 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11908 impls, 100 clqs
0.39/0.41 c presolving (2 rounds):
0.39/0.41 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.41 c 11908 implications, 100 cliques
0.39/0.41 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.39/0.41 c 1 constraints of type <knapsack>
0.39/0.41 c 100 constraints of type <setppc>
0.39/0.41 c 1476 constraints of type <and>
0.39/0.41 c 1 constraints of type <linear>
0.39/0.41 c 50 constraints of type <logicor>
0.39/0.41 c transformed objective value is always integral (scale: 1)
0.39/0.41 c Presolving Time: 0.20
0.39/0.41 c - non default parameters ----------------------------------------------------------------------
0.39/0.41 c # SCIP version 1.2.1.2
0.39/0.41 c
0.39/0.41 c # frequency for displaying node information lines
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.41 c display/freq = 10000
0.39/0.41 c
0.39/0.41 c # maximal time in seconds to run
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/time = 1799.99
0.39/0.41 c
0.39/0.41 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/memory = 1620
0.39/0.41 c
0.39/0.41 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c limits/solutions = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.41 c separating/maxrounds = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c separating/maxroundsroot = 5
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify inequalities
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/linear/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.41 c constraints/knapsack/disaggregation = FALSE
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify knapsacks
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c presolving/probing/maxrounds = 0
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/coefdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.41 c heuristics/crossover/freq = -1
0.39/0.41 c
0.39/0.41 c # number of nodes added to the contingent of the total nodes
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41 c heuristics/crossover/nodesofs = 750
0.39/0.41 c
0.39/0.41 c # number of nodes without incumbent change that heuristic should wait
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.41 c heuristics/crossover/nwaitingnodes = 100
0.39/0.41 c
0.39/0.41 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.41 c # [type: real, range: [0,1], default: 0.1]
0.39/0.41 c heuristics/crossover/nodesquot = 0.15
0.39/0.41 c
0.39/0.41 c # minimum percentage of integer variables that have to be fixed
0.39/0.41 c # [type: real, range: [0,1], default: 0.666]
0.39/0.41 c heuristics/crossover/minfixingrate = 0.5
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/feaspump/freq = -1
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/fracdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/guideddiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/intshifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/linesearchdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/nlp/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/objpscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.41 c # [type: real, range: [0,1], default: 0.01]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/oneopt/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/pscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/rens/freq = -1
0.39/0.41 c
0.39/0.41 c # minimum percentage of integer variables that have to be fixable
0.39/0.41 c # [type: real, range: [0,1], default: 0.5]
0.39/0.41 c heuristics/rens/minfixingrate = 0.3
0.39/0.41 c
0.39/0.41 c # number of nodes added to the contingent of the total nodes
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41 c heuristics/rens/nodesofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/rootsoldiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/rounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/shifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/simplerounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/trivial/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/trysol/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/veclendiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/zirounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c separating/cmir/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c separating/flowcover/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c separating/rapidlearning/freq = 0
0.39/0.41 c
0.39/0.41 c -----------------------------------------------------------------------------------------------
0.39/0.41 c start solving
0.39/0.42 c
0.60/0.67 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.60/0.67 c 0.5s| 1 | 0 | 574 | - |7218k| 0 | 401 |1576 |1628 |1576 |3104 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.79 c 2.3s| 1 | 0 | 712 | - |8804k| 0 | 458 |1576 |1828 |1576 |3115 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
4.79/4.81 c 4.4s| 1 | 0 | 794 | - |9296k| 0 | 459 |1576 |1828 |1576 |3124 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
6.89/6.97 c 6.5s| 1 | 0 | 943 | - | 10M| 0 | 435 |1576 |1828 |1576 |3134 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
8.49/8.59 c 8.1s| 1 | 0 | 1044 | - | 11M| 0 | 457 |1576 |1828 |1576 |3143 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
10.08/10.12 c 9.7s| 1 | 0 | 1127 | - | 12M| 0 | 438 |1576 |1828 |1576 |3148 | 44 | 0 | 0 | 0.000000e+00 | -- | Inf
10.08/10.16 c 9.7s| 1 | 0 | 1131 | - | 12M| 0 | 439 |1576 |1828 |1576 |3150 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
17.09/17.17 c 16.6s| 1 | 2 | 1131 | - | 12M| 0 | 439 |1576 |1828 |1576 |3150 | 46 | 0 | 9 | 0.000000e+00 | -- | Inf
138.15/138.23 c
138.15/138.23 c SCIP Status : problem is solved [infeasible]
138.15/138.23 c Solving Time (sec) : 137.16
138.15/138.23 c Solving Nodes : 503
138.15/138.23 c Primal Bound : +1.00000000000000e+20 (0 solutions)
138.15/138.23 c Dual Bound : +1.00000000000000e+20
138.15/138.23 c Gap : 0.00 %
138.15/138.23 s UNSATISFIABLE
138.15/138.23 c SCIP Status : problem is solved [infeasible]
138.15/138.23 c Solving Time : 137.16
138.15/138.23 c Original Problem :
138.15/138.23 c Problem name : HOME/instance-2664915-1276682991.opb
138.15/138.23 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
138.15/138.23 c Constraints : 1628 initial, 1628 maximal
138.15/138.23 c Presolved Problem :
138.15/138.23 c Problem name : t_HOME/instance-2664915-1276682991.opb
138.15/138.23 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
138.15/138.23 c Constraints : 1628 initial, 1870 maximal
138.15/138.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
138.15/138.23 c trivial : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c implics : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c probing : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c knapsack : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c setppc : 0.01 0 0 0 0 0 0 0 0
138.15/138.23 c and : 0.16 0 0 0 0 0 0 0 0
138.15/138.23 c linear : 0.01 0 0 0 0 0 0 0 0
138.15/138.23 c logicor : 0.00 0 0 0 0 0 0 0 0
138.15/138.23 c root node : - 29 - - 29 - - - -
138.15/138.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
138.15/138.23 c integral : 0 0 0 282 0 0 83 0 0 502
138.15/138.23 c knapsack : 1 5 1437 0 0 8 26 0 0 0
138.15/138.23 c setppc : 100 5 1432 0 0 1 1962 0 0 0
138.15/138.23 c and : 1476 447 1431 0 0 0 47217 67388 0 0
138.15/138.23 c linear : 1+ 6 1431 0 0 1 95 0 0 0
138.15/138.23 c logicor : 50+ 5 494 0 0 0 275 0 0 0
138.15/138.23 c countsols : 0 0 0 0 0 0 0 0 0 0
138.15/138.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
138.15/138.23 c integral : 54.85 0.00 0.00 54.85 0.00
138.15/138.23 c knapsack : 0.00 0.00 0.00 0.00 0.00
138.15/138.23 c setppc : 0.00 0.00 0.00 0.00 0.00
138.15/138.23 c and : 0.82 0.56 0.26 0.00 0.00
138.15/138.23 c linear : 0.10 0.00 0.10 0.00 0.00
138.15/138.23 c logicor : 0.01 0.00 0.01 0.00 0.00
138.15/138.23 c countsols : 0.00 0.00 0.00 0.00 0.00
138.15/138.23 c Propagators : Time Calls Cutoffs DomReds
138.15/138.23 c vbounds : 0.00 1 0 0
138.15/138.23 c rootredcost : 0.00 0 0 0
138.15/138.23 c pseudoobj : 0.00 0 0 0
138.15/138.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
138.15/138.23 c propagation : 0.00 10 10 13 10.2 0 0.0 -
138.15/138.23 c infeasible LP : 0.23 242 40 111 18.3 0 0.0 0
138.15/138.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
138.15/138.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
138.15/138.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
138.15/138.23 c applied globally : - - - 76 21.8 - - -
138.15/138.23 c applied locally : - - - 0 0.0 - - -
138.15/138.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
138.15/138.23 c cut pool : 0.00 4 - - 2 - (maximal pool size: 621)
138.15/138.23 c redcost : 0.03 447 0 0 0 0
138.15/138.23 c impliedbounds : 0.02 5 0 0 13 0
138.15/138.23 c intobj : 0.00 0 0 0 0 0
138.15/138.23 c cgmip : 0.00 0 0 0 0 0
138.15/138.23 c gomory : 3.87 5 0 0 0 0
138.15/138.23 c strongcg : 4.36 5 0 0 1315 0
138.15/138.23 c cmir : 0.00 0 0 0 0 0
138.15/138.23 c flowcover : 0.00 0 0 0 0 0
138.15/138.23 c clique : 0.05 5 0 0 34 0
138.15/138.23 c zerohalf : 0.00 0 0 0 0 0
138.15/138.23 c mcf : 0.05 2 0 0 9 0
138.15/138.23 c rapidlearning : 0.38 1 0 0 0 200
138.15/138.23 c Pricers : Time Calls Vars
138.15/138.23 c problem variables: 0.00 0 0
138.15/138.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
138.15/138.23 c relpscost : 54.85 282 0 83 0 0 502
138.15/138.23 c pscost : 0.00 0 0 0 0 0 0
138.15/138.23 c inference : 0.00 0 0 0 0 0 0
138.15/138.23 c mostinf : 0.00 0 0 0 0 0 0
138.15/138.23 c leastinf : 0.00 0 0 0 0 0 0
138.15/138.23 c fullstrong : 0.00 0 0 0 0 0 0
138.15/138.23 c allfullstrong : 0.00 0 0 0 0 0 0
138.15/138.23 c random : 0.00 0 0 0 0 0 0
138.15/138.23 c Primal Heuristics : Time Calls Found
138.15/138.23 c LP solutions : 0.00 - 0
138.15/138.23 c pseudo solutions : 0.00 - 0
138.15/138.23 c trivial : 0.01 1 0
138.15/138.23 c simplerounding : 0.00 0 0
138.15/138.23 c zirounding : 0.00 0 0
138.15/138.23 c rounding : 0.00 0 0
138.15/138.23 c shifting : 0.00 0 0
138.15/138.23 c intshifting : 0.00 0 0
138.15/138.23 c oneopt : 0.00 0 0
138.15/138.23 c twoopt : 0.00 0 0
138.15/138.23 c fixandinfer : 0.00 0 0
138.15/138.23 c feaspump : 0.00 0 0
138.15/138.23 c coefdiving : 0.00 0 0
138.15/138.23 c pscostdiving : 0.00 0 0
138.15/138.23 c fracdiving : 0.00 0 0
138.15/138.23 c veclendiving : 0.00 0 0
138.15/138.23 c intdiving : 0.00 0 0
138.15/138.23 c actconsdiving : 0.00 0 0
138.15/138.23 c objpscostdiving : 0.00 0 0
138.15/138.23 c rootsoldiving : 0.00 0 0
138.15/138.23 c linesearchdiving : 0.00 0 0
138.15/138.23 c guideddiving : 0.00 0 0
138.15/138.23 c octane : 0.00 0 0
138.15/138.23 c rens : 0.00 0 0
138.15/138.23 c rins : 0.00 0 0
138.15/138.23 c localbranching : 0.00 0 0
138.15/138.23 c mutation : 0.00 0 0
138.15/138.23 c crossover : 0.00 0 0
138.15/138.23 c dins : 0.00 0 0
138.15/138.23 c undercover : 0.00 0 0
138.15/138.23 c nlp : 0.00 0 0
138.15/138.23 c trysol : 0.00 0 0
138.15/138.23 c LP : Time Calls Iterations Iter/call Iter/sec
138.15/138.23 c primal LP : 6.04 0 0 0.00 0.00
138.15/138.23 c dual LP : 64.44 962 151030 157.00 2343.73
138.15/138.23 c lex dual LP : 0.00 0 0 0.00 -
138.15/138.23 c barrier LP : 0.00 0 0 0.00 -
138.15/138.23 c diving/probing LP: 0.00 0 0 0.00 -
138.15/138.23 c strong branching : 54.75 759 183808 242.17 3357.22
138.15/138.23 c (at root node) : - 9 8514 946.00 -
138.15/138.23 c conflict analysis: 0.00 0 0 0.00 -
138.15/138.23 c B&B Tree :
138.15/138.23 c number of runs : 1
138.15/138.23 c nodes : 503
138.15/138.23 c nodes (total) : 503
138.15/138.23 c nodes left : 0
138.15/138.23 c max depth : 37
138.15/138.23 c max depth (total): 37
138.15/138.23 c backtracks : 80 (15.9%)
138.15/138.23 c delayed cutoffs : 0
138.15/138.23 c repropagations : 93 (1177 domain reductions, 0 cutoffs)
138.15/138.23 c avg switch length: 2.32
138.15/138.23 c switching time : 6.37
138.15/138.23 c Solution :
138.15/138.23 c Solutions found : 0 (0 improvements)
138.15/138.23 c Primal Bound : infeasible
138.15/138.23 c Dual Bound : -
138.15/138.23 c Gap : 0.00 %
138.15/138.23 c Root Dual Bound : +0.00000000000000e+00
138.15/138.23 c Root Iterations : 1131
138.15/138.26 c Time complete: 138.22.