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-2666281-1276676617.opb>
0.00/0.03 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 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.20/0.22 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11940 impls, 100 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 11940 implications, 100 cliques
0.29/0.39 c presolved problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 100 constraints of type <setppc>
0.29/0.39 c 1480 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 50 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.18
0.29/0.39 c - non default parameters ----------------------------------------------------------------------
0.29/0.39 c # SCIP version 1.2.1.2
0.29/0.39 c
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = 10000
0.29/0.39 c
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = 1799.98
0.29/0.39 c
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = 1620
0.29/0.39 c
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = 1
0.29/0.39 c
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = 1
0.29/0.39 c
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = 5
0.29/0.39 c
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = TRUE
0.29/0.39 c
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = FALSE
0.29/0.39 c
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = TRUE
0.29/0.39 c
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = 0
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = -1
0.29/0.39 c
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = 750
0.29/0.39 c
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = 100
0.29/0.39 c
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = 0.15
0.29/0.39 c
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = 0.5
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = -1
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/nlp/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = -1
0.29/0.39 c
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = 0.3
0.29/0.39 c
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = 2000
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/trivial/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/trysol/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/zirounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/rapidlearning/freq = 0
0.29/0.39 c
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving
0.29/0.39 c
0.49/0.56 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.56 c 0.3s| 1 | 0 | 467 | - |7239k| 0 | 280 |1580 |1632 |1580 |3112 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.03 c 1.6s| 1 | 0 | 743 | - |8139k| 0 | 273 |1580 |1808 |1580 |3139 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
2.79/2.86 c 2.4s| 1 | 0 | 1047 | - |8335k| 0 | 280 |1580 |1808 |1580 |3148 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
3.99/4.05 c 3.6s| 1 | 0 | 1351 | - |8759k| 0 | 304 |1580 |1808 |1580 |3160 | 48 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.18 c 4.8s| 1 | 0 | 1652 | - |9078k| 0 | 298 |1580 |1808 |1580 |3177 | 65 | 0 | 0 | 0.000000e+00 | -- | Inf
6.60/6.65 c 6.2s| 1 | 0 | 1813 | - |9735k| 0 | 312 |1580 |1808 |1580 |3184 | 72 | 0 | 0 | 0.000000e+00 | -- | Inf
6.70/6.73 c 6.3s| 1 | 0 | 1908 | - |9736k| 0 | 338 |1580 |1808 |1580 |3187 | 75 | 0 | 0 | 0.000000e+00 | -- | Inf
12.28/12.34 c 11.8s| 1 | 2 | 1908 | - |9737k| 0 | 338 |1580 |1808 |1580 |3187 | 75 | 0 | 9 | 0.000000e+00 | -- | Inf
106.46/106.52 c
106.46/106.52 c SCIP Status : problem is solved [infeasible]
106.46/106.52 c Solving Time (sec) : 105.05
106.46/106.52 c Solving Nodes : 306
106.46/106.52 c Primal Bound : +1.00000000000000e+20 (0 solutions)
106.46/106.52 c Dual Bound : +1.00000000000000e+20
106.46/106.52 c Gap : 0.00 %
106.46/106.52 s UNSATISFIABLE
106.46/106.52 c SCIP Status : problem is solved [infeasible]
106.46/106.52 c Solving Time : 105.05
106.46/106.52 c Original Problem :
106.46/106.52 c Problem name : HOME/instance-2666281-1276676617.opb
106.46/106.52 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
106.46/106.52 c Constraints : 1632 initial, 1632 maximal
106.46/106.52 c Presolved Problem :
106.46/106.52 c Problem name : t_HOME/instance-2666281-1276676617.opb
106.46/106.52 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
106.46/106.52 c Constraints : 1632 initial, 1940 maximal
106.46/106.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
106.46/106.52 c trivial : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c implics : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c probing : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c knapsack : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c setppc : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c and : 0.17 0 0 0 0 0 0 0 0
106.46/106.52 c linear : 0.01 0 0 0 0 0 0 0 0
106.46/106.52 c logicor : 0.00 0 0 0 0 0 0 0 0
106.46/106.52 c root node : - 55 - - 55 - - - -
106.46/106.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
106.46/106.52 c integral : 0 0 0 197 0 0 129 0 0 310
106.46/106.52 c knapsack : 1 5 1460 0 0 1 0 0 0 0
106.46/106.52 c setppc : 100 5 1459 0 0 0 412 0 0 0
106.46/106.52 c and : 1480 269 1459 0 0 0 17239 36048 0 0
106.46/106.52 c linear : 1+ 6 1459 0 0 0 17 0 0 0
106.46/106.52 c logicor : 50+ 5 326 0 0 0 277 0 0 0
106.46/106.52 c countsols : 0 0 0 0 0 0 0 0 0 0
106.46/106.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
106.46/106.52 c integral : 54.93 0.00 0.00 54.93 0.00
106.46/106.52 c knapsack : 0.00 0.00 0.00 0.00 0.00
106.46/106.52 c setppc : 0.00 0.00 0.00 0.00 0.00
106.46/106.52 c and : 0.40 0.29 0.11 0.00 0.00
106.46/106.52 c linear : 0.02 0.00 0.02 0.00 0.00
106.46/106.52 c logicor : 0.01 0.00 0.01 0.00 0.00
106.46/106.52 c countsols : 0.00 0.00 0.00 0.00 0.00
106.46/106.52 c Propagators : Time Calls Cutoffs DomReds
106.46/106.52 c vbounds : 0.00 1 0 0
106.46/106.52 c rootredcost : 0.00 0 0 0
106.46/106.52 c pseudoobj : 0.00 0 0 0
106.46/106.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
106.46/106.52 c propagation : 0.00 1 1 6 12.7 0 0.0 -
106.46/106.52 c infeasible LP : 0.11 150 147 597 10.9 0 0.0 0
106.46/106.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
106.46/106.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
106.46/106.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
106.46/106.52 c applied globally : - - - 237 9.7 - - -
106.46/106.52 c applied locally : - - - 0 0.0 - - -
106.46/106.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
106.46/106.52 c cut pool : 0.00 4 - - 1 - (maximal pool size: 417)
106.46/106.52 c redcost : 0.01 269 0 0 0 0
106.46/106.52 c impliedbounds : 0.00 5 0 0 54 0
106.46/106.52 c intobj : 0.00 0 0 0 0 0
106.46/106.52 c cgmip : 0.00 0 0 0 0 0
106.46/106.52 c gomory : 3.38 5 0 0 4 0
106.46/106.52 c strongcg : 1.20 5 0 0 2500 0
106.46/106.52 c cmir : 0.00 0 0 0 0 0
106.46/106.52 c flowcover : 0.00 0 0 0 0 0
106.46/106.52 c clique : 0.03 5 0 0 32 0
106.46/106.52 c zerohalf : 0.00 0 0 0 0 0
106.46/106.52 c mcf : 0.06 3 0 0 42 0
106.46/106.52 c rapidlearning : 0.33 1 0 0 0 176
106.46/106.52 c Pricers : Time Calls Vars
106.46/106.52 c problem variables: 0.00 0 0
106.46/106.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
106.46/106.52 c relpscost : 54.93 197 0 129 0 0 310
106.46/106.52 c pscost : 0.00 0 0 0 0 0 0
106.46/106.52 c inference : 0.00 0 0 0 0 0 0
106.46/106.52 c mostinf : 0.00 0 0 0 0 0 0
106.46/106.52 c leastinf : 0.00 0 0 0 0 0 0
106.46/106.52 c fullstrong : 0.00 0 0 0 0 0 0
106.46/106.52 c allfullstrong : 0.00 0 0 0 0 0 0
106.46/106.52 c random : 0.00 0 0 0 0 0 0
106.46/106.52 c Primal Heuristics : Time Calls Found
106.46/106.52 c LP solutions : 0.00 - 0
106.46/106.52 c pseudo solutions : 0.00 - 0
106.46/106.52 c trivial : 0.00 1 0
106.46/106.52 c simplerounding : 0.00 0 0
106.46/106.52 c zirounding : 0.00 0 0
106.46/106.52 c rounding : 0.00 0 0
106.46/106.52 c shifting : 0.00 0 0
106.46/106.52 c intshifting : 0.00 0 0
106.46/106.52 c oneopt : 0.00 0 0
106.46/106.52 c twoopt : 0.00 0 0
106.46/106.52 c fixandinfer : 0.00 0 0
106.46/106.52 c feaspump : 0.00 0 0
106.46/106.52 c coefdiving : 0.00 0 0
106.46/106.52 c pscostdiving : 0.00 0 0
106.46/106.52 c fracdiving : 0.00 0 0
106.46/106.52 c veclendiving : 0.00 0 0
106.46/106.52 c intdiving : 0.00 0 0
106.46/106.52 c actconsdiving : 0.00 0 0
106.46/106.52 c objpscostdiving : 0.00 0 0
106.46/106.52 c rootsoldiving : 0.00 0 0
106.46/106.52 c linesearchdiving : 0.00 0 0
106.46/106.52 c guideddiving : 0.00 0 0
106.46/106.52 c octane : 0.00 0 0
106.46/106.52 c rens : 0.00 0 0
106.46/106.52 c rins : 0.00 0 0
106.46/106.52 c localbranching : 0.00 0 0
106.46/106.52 c mutation : 0.00 0 0
106.46/106.52 c crossover : 0.00 0 0
106.46/106.52 c dins : 0.00 0 0
106.46/106.52 c undercover : 0.00 0 0
106.46/106.52 c nlp : 0.00 0 0
106.46/106.52 c trysol : 0.00 0 0
106.46/106.52 c LP : Time Calls Iterations Iter/call Iter/sec
106.46/106.52 c primal LP : 0.24 0 0 0.00 0.00
106.46/106.52 c dual LP : 42.98 612 129363 211.38 3009.84
106.46/106.52 c lex dual LP : 0.00 0 0 0.00 -
106.46/106.52 c barrier LP : 0.00 0 0 0.00 -
106.46/106.52 c diving/probing LP: 0.00 0 0 0.00 -
106.46/106.52 c strong branching : 54.91 852 173992 204.22 3168.68
106.46/106.52 c (at root node) : - 9 6816 757.33 -
106.46/106.52 c conflict analysis: 0.00 0 0 0.00 -
106.46/106.52 c B&B Tree :
106.46/106.52 c number of runs : 1
106.46/106.52 c nodes : 306
106.46/106.52 c nodes (total) : 306
106.46/106.52 c nodes left : 0
106.46/106.52 c max depth : 41
106.46/106.52 c max depth (total): 41
106.46/106.52 c backtracks : 55 (18.0%)
106.46/106.52 c delayed cutoffs : 5
106.46/106.52 c repropagations : 529 (3464 domain reductions, 0 cutoffs)
106.46/106.52 c avg switch length: 4.65
106.46/106.52 c switching time : 0.36
106.46/106.52 c Solution :
106.46/106.52 c Solutions found : 0 (0 improvements)
106.46/106.52 c Primal Bound : infeasible
106.46/106.52 c Dual Bound : -
106.46/106.52 c Gap : 0.00 %
106.46/106.52 c Root Dual Bound : +0.00000000000000e+00
106.46/106.52 c Root Iterations : 1908
106.46/106.55 c Time complete: 106.51.