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-2666345-1276683000.opb>
0.00/0.03 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/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, 11908 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 11908 implications, 100 cliques
0.39/0.42 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 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 1476 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.22
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.69/0.71 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.71 c 0.5s| 1 | 0 | 641 | - |7218k| 0 | 356 |1576 |1628 |1576 |3104 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.19/3.26 c 2.8s| 1 | 0 | 854 | - |8875k| 0 | 349 |1576 |1853 |1576 |3130 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
4.69/4.76 c 4.3s| 1 | 0 | 1121 | - |9309k| 0 | 353 |1576 |1853 |1576 |3141 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
6.29/6.31 c 5.8s| 1 | 0 | 1297 | - |9973k| 0 | 355 |1576 |1853 |1576 |3157 | 53 | 0 | 0 | 0.000000e+00 | -- | Inf
7.59/7.64 c 7.2s| 1 | 0 | 1444 | - | 10M| 0 | 344 |1576 |1853 |1576 |3165 | 61 | 0 | 0 | 0.000000e+00 | -- | Inf
8.80/8.87 c 8.4s| 1 | 0 | 1616 | - | 12M| 0 | 353 |1576 |1853 |1576 |3171 | 67 | 0 | 0 | 0.000000e+00 | -- | Inf
16.18/16.22 c 15.7s| 1 | 2 | 1616 | - | 12M| 0 | 353 |1576 |1853 |1576 |3171 | 67 | 0 | 10 | 0.000000e+00 | -- | Inf
116.67/116.71 c
116.67/116.71 c SCIP Status : problem is solved [infeasible]
116.67/116.71 c Solving Time (sec) : 115.00
116.67/116.71 c Solving Nodes : 342
116.67/116.71 c Primal Bound : +1.00000000000000e+20 (0 solutions)
116.67/116.71 c Dual Bound : +1.00000000000000e+20
116.67/116.71 c Gap : 0.00 %
116.67/116.71 s UNSATISFIABLE
116.67/116.71 c SCIP Status : problem is solved [infeasible]
116.67/116.71 c Solving Time : 115.00
116.67/116.71 c Original Problem :
116.67/116.71 c Problem name : HOME/instance-2666345-1276683000.opb
116.67/116.71 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
116.67/116.71 c Constraints : 1628 initial, 1628 maximal
116.67/116.71 c Presolved Problem :
116.67/116.71 c Problem name : t_HOME/instance-2666345-1276683000.opb
116.67/116.71 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
116.67/116.71 c Constraints : 1628 initial, 2082 maximal
116.67/116.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
116.67/116.71 c trivial : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c implics : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c probing : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c knapsack : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c setppc : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c and : 0.20 0 0 0 0 0 0 0 0
116.67/116.71 c linear : 0.01 0 0 0 0 0 0 0 0
116.67/116.71 c logicor : 0.00 0 0 0 0 0 0 0 0
116.67/116.71 c root node : - 399 - - 399 - - - -
116.67/116.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
116.67/116.71 c integral : 0 0 0 224 0 2 150 0 0 348
116.67/116.71 c knapsack : 1 5 1806 0 0 1 0 0 0 0
116.67/116.71 c setppc : 100 5 1805 0 0 1 526 0 0 0
116.67/116.71 c and : 1476 289 1804 0 0 0 20686 36616 0 0
116.67/116.71 c linear : 1+ 6 1804 0 0 0 66 0 0 0
116.67/116.71 c logicor : 50+ 5 408 0 0 3 338 0 0 0
116.67/116.71 c countsols : 0 0 0 0 0 0 0 0 0 0
116.67/116.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
116.67/116.71 c integral : 58.93 0.00 0.00 58.93 0.00
116.67/116.71 c knapsack : 0.02 0.00 0.02 0.00 0.00
116.67/116.71 c setppc : 0.02 0.00 0.02 0.00 0.00
116.67/116.71 c and : 0.57 0.41 0.16 0.00 0.00
116.67/116.71 c linear : 0.06 0.01 0.05 0.00 0.00
116.67/116.71 c logicor : 0.01 0.00 0.01 0.00 0.00
116.67/116.71 c countsols : 0.00 0.00 0.00 0.00 0.00
116.67/116.71 c Propagators : Time Calls Cutoffs DomReds
116.67/116.71 c vbounds : 0.00 1 0 0
116.67/116.71 c rootredcost : 0.01 0 0 0
116.67/116.71 c pseudoobj : 0.00 0 0 0
116.67/116.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
116.67/116.71 c propagation : 0.00 5 3 9 10.3 0 0.0 -
116.67/116.71 c infeasible LP : 0.17 163 156 679 12.3 0 0.0 0
116.67/116.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
116.67/116.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
116.67/116.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
116.67/116.71 c applied globally : - - - 230 9.9 - - -
116.67/116.71 c applied locally : - - - 0 0.0 - - -
116.67/116.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
116.67/116.71 c cut pool : 0.00 4 - - 0 - (maximal pool size: 606)
116.67/116.71 c redcost : 0.01 289 0 0 0 0
116.67/116.71 c impliedbounds : 0.02 5 0 0 54 0
116.67/116.71 c intobj : 0.00 0 0 0 0 0
116.67/116.71 c cgmip : 0.00 0 0 0 0 0
116.67/116.71 c gomory : 3.65 5 0 0 0 0
116.67/116.71 c strongcg : 2.85 5 0 0 2500 0
116.67/116.71 c cmir : 0.00 0 0 0 0 0
116.67/116.71 c flowcover : 0.00 0 0 0 0 0
116.67/116.71 c clique : 0.03 5 0 0 30 0
116.67/116.71 c zerohalf : 0.00 0 0 0 0 0
116.67/116.71 c mcf : 0.11 5 0 0 78 0
116.67/116.71 c rapidlearning : 0.41 1 0 0 0 225
116.67/116.71 c Pricers : Time Calls Vars
116.67/116.71 c problem variables: 0.00 0 0
116.67/116.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
116.67/116.71 c relpscost : 58.93 224 2 150 0 0 348
116.67/116.71 c pscost : 0.00 0 0 0 0 0 0
116.67/116.71 c inference : 0.00 0 0 0 0 0 0
116.67/116.71 c mostinf : 0.00 0 0 0 0 0 0
116.67/116.71 c leastinf : 0.00 0 0 0 0 0 0
116.67/116.71 c fullstrong : 0.00 0 0 0 0 0 0
116.67/116.71 c allfullstrong : 0.00 0 0 0 0 0 0
116.67/116.71 c random : 0.00 0 0 0 0 0 0
116.67/116.71 c Primal Heuristics : Time Calls Found
116.67/116.71 c LP solutions : 0.00 - 0
116.67/116.71 c pseudo solutions : 0.00 - 0
116.67/116.71 c trivial : 0.00 1 0
116.67/116.71 c simplerounding : 0.00 0 0
116.67/116.71 c zirounding : 0.00 0 0
116.67/116.71 c rounding : 0.00 0 0
116.67/116.71 c shifting : 0.00 0 0
116.67/116.71 c intshifting : 0.00 0 0
116.67/116.71 c oneopt : 0.00 0 0
116.67/116.71 c twoopt : 0.00 0 0
116.67/116.71 c fixandinfer : 0.00 0 0
116.67/116.71 c feaspump : 0.00 0 0
116.67/116.71 c coefdiving : 0.00 0 0
116.67/116.71 c pscostdiving : 0.00 0 0
116.67/116.71 c fracdiving : 0.00 0 0
116.67/116.71 c veclendiving : 0.00 0 0
116.67/116.71 c intdiving : 0.00 0 0
116.67/116.71 c actconsdiving : 0.00 0 0
116.67/116.71 c objpscostdiving : 0.00 0 0
116.67/116.71 c rootsoldiving : 0.00 0 0
116.67/116.71 c linesearchdiving : 0.00 0 0
116.67/116.71 c guideddiving : 0.00 0 0
116.67/116.71 c octane : 0.00 0 0
116.67/116.71 c rens : 0.00 0 0
116.67/116.71 c rins : 0.00 0 0
116.67/116.71 c localbranching : 0.00 0 0
116.67/116.71 c mutation : 0.00 0 0
116.67/116.71 c crossover : 0.00 0 0
116.67/116.71 c dins : 0.00 0 0
116.67/116.71 c undercover : 0.00 0 0
116.67/116.71 c nlp : 0.00 0 0
116.67/116.71 c trysol : 0.00 0 0
116.67/116.71 c LP : Time Calls Iterations Iter/call Iter/sec
116.67/116.71 c primal LP : 0.30 0 0 0.00 0.00
116.67/116.71 c dual LP : 46.55 664 133645 201.27 2871.00
116.67/116.71 c lex dual LP : 0.00 0 0 0.00 -
116.67/116.71 c barrier LP : 0.00 0 0 0.00 -
116.67/116.71 c diving/probing LP: 0.00 0 0 0.00 -
116.67/116.71 c strong branching : 58.89 899 172341 191.70 2926.49
116.67/116.71 c (at root node) : - 10 8055 805.50 -
116.67/116.71 c conflict analysis: 0.00 0 0 0.00 -
116.67/116.71 c B&B Tree :
116.67/116.71 c number of runs : 1
116.67/116.71 c nodes : 342
116.67/116.71 c nodes (total) : 342
116.67/116.71 c nodes left : 0
116.67/116.71 c max depth : 41
116.67/116.71 c max depth (total): 41
116.67/116.71 c backtracks : 69 (20.2%)
116.67/116.71 c delayed cutoffs : 7
116.67/116.71 c repropagations : 780 (4527 domain reductions, 2 cutoffs)
116.67/116.71 c avg switch length: 5.99
116.67/116.71 c switching time : 0.47
116.67/116.71 c Solution :
116.67/116.71 c Solutions found : 0 (0 improvements)
116.67/116.71 c Primal Bound : infeasible
116.67/116.71 c Dual Bound : -
116.67/116.71 c Gap : 0.00 %
116.67/116.71 c Root Dual Bound : +0.00000000000000e+00
116.67/116.71 c Root Iterations : 1616
116.67/116.74 c Time complete: 116.7.