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-2664867-1276678202.opb>
0.01/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.01/0.02 c problem read
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/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, 11828 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 11828 implications, 100 cliques
0.39/0.41 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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 1466 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.19
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.98
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.59/0.60 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.60 c 0.4s| 1 | 0 | 436 | - |7174k| 0 | 352 |1566 |1618 |1566 |3084 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.39/2.46 c 2.0s| 1 | 0 | 597 | - |8161k| 0 | 388 |1566 |1807 |1566 |3094 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
3.49/3.56 c 3.1s| 1 | 0 | 797 | - |8684k| 0 | 405 |1566 |1807 |1566 |3100 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
4.99/5.02 c 4.6s| 1 | 0 | 930 | - |9187k| 0 | 431 |1566 |1807 |1566 |3110 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
6.99/7.03 c 6.6s| 1 | 0 | 1076 | - | 10M| 0 | 450 |1566 |1807 |1566 |3117 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
9.19/9.20 c 8.7s| 1 | 0 | 1254 | - | 11M| 0 | 455 |1566 |1807 |1566 |3135 | 51 | 0 | 0 | 0.000000e+00 | -- | Inf
9.19/9.24 c 8.8s| 1 | 0 | 1273 | - | 11M| 0 | 447 |1566 |1807 |1566 |3139 | 55 | 0 | 0 | 0.000000e+00 | -- | Inf
15.08/15.13 c 14.6s| 1 | 2 | 1273 | - | 11M| 0 | 447 |1566 |1807 |1566 |3139 | 55 | 0 | 10 | 0.000000e+00 | -- | Inf
145.94/146.08 c
145.94/146.09 c SCIP Status : problem is solved [infeasible]
145.94/146.09 c Solving Time (sec) : 144.47
145.94/146.09 c Solving Nodes : 615
145.94/146.09 c Primal Bound : +1.00000000000000e+20 (0 solutions)
145.94/146.09 c Dual Bound : +1.00000000000000e+20
145.94/146.09 c Gap : 0.00 %
145.94/146.09 s UNSATISFIABLE
145.94/146.09 c SCIP Status : problem is solved [infeasible]
145.94/146.09 c Solving Time : 144.47
145.94/146.09 c Original Problem :
145.94/146.09 c Problem name : HOME/instance-2664867-1276678202.opb
145.94/146.09 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
145.94/146.09 c Constraints : 1618 initial, 1618 maximal
145.94/146.09 c Presolved Problem :
145.94/146.09 c Problem name : t_HOME/instance-2664867-1276678202.opb
145.94/146.09 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
145.94/146.09 c Constraints : 1618 initial, 1840 maximal
145.94/146.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
145.94/146.09 c trivial : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c implics : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c probing : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c knapsack : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c setppc : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c and : 0.17 0 0 0 0 0 0 0 0
145.94/146.09 c linear : 0.01 0 0 0 0 0 0 0 0
145.94/146.09 c logicor : 0.00 0 0 0 0 0 0 0 0
145.94/146.09 c root node : - 27 - - 27 - - - -
145.94/146.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
145.94/146.09 c integral : 0 0 0 335 0 0 73 0 0 614
145.94/146.09 c knapsack : 1 5 1660 0 0 3 0 0 0 0
145.94/146.09 c setppc : 100 5 1657 0 0 1 1860 0 0 0
145.94/146.09 c and : 1466 567 1656 0 0 0 51665 84643 0 0
145.94/146.09 c linear : 1+ 6 1656 0 0 0 212 0 0 0
145.94/146.09 c logicor : 50+ 5 560 0 0 0 284 0 0 0
145.94/146.09 c countsols : 0 0 0 0 0 0 0 0 0 0
145.94/146.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
145.94/146.09 c integral : 55.11 0.00 0.00 55.11 0.00
145.94/146.09 c knapsack : 0.01 0.01 0.00 0.00 0.00
145.94/146.09 c setppc : 0.03 0.00 0.03 0.00 0.00
145.94/146.09 c and : 0.88 0.64 0.24 0.00 0.00
145.94/146.09 c linear : 0.10 0.02 0.08 0.00 0.00
145.94/146.09 c logicor : 0.00 0.00 0.00 0.00 0.00
145.94/146.09 c countsols : 0.00 0.00 0.00 0.00 0.00
145.94/146.09 c Propagators : Time Calls Cutoffs DomReds
145.94/146.09 c vbounds : 0.01 1 0 0
145.94/146.09 c rootredcost : 0.00 0 0 0
145.94/146.09 c pseudoobj : 0.00 0 0 0
145.94/146.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
145.94/146.09 c propagation : 0.00 4 4 5 13.0 0 0.0 -
145.94/146.09 c infeasible LP : 0.18 304 37 108 19.2 0 0.0 0
145.94/146.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
145.94/146.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
145.94/146.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
145.94/146.09 c applied globally : - - - 73 22.8 - - -
145.94/146.09 c applied locally : - - - 0 0.0 - - -
145.94/146.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
145.94/146.09 c cut pool : 0.00 4 - - 8 - (maximal pool size: 635)
145.94/146.09 c redcost : 0.01 567 0 0 0 0
145.94/146.09 c impliedbounds : 0.00 5 0 0 26 0
145.94/146.09 c intobj : 0.00 0 0 0 0 0
145.94/146.09 c cgmip : 0.00 0 0 0 0 0
145.94/146.09 c gomory : 4.09 5 0 0 0 0
145.94/146.09 c strongcg : 3.20 5 0 0 2268 0
145.94/146.09 c cmir : 0.00 0 0 0 0 0
145.94/146.09 c flowcover : 0.00 0 0 0 0 0
145.94/146.09 c clique : 0.05 5 0 0 32 0
145.94/146.09 c zerohalf : 0.00 0 0 0 0 0
145.94/146.09 c mcf : 0.05 3 0 0 18 0
145.94/146.09 c rapidlearning : 0.36 1 0 0 0 189
145.94/146.09 c Pricers : Time Calls Vars
145.94/146.09 c problem variables: 0.00 0 0
145.94/146.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
145.94/146.09 c relpscost : 55.11 335 0 73 0 0 614
145.94/146.09 c pscost : 0.00 0 0 0 0 0 0
145.94/146.09 c inference : 0.00 0 0 0 0 0 0
145.94/146.09 c mostinf : 0.00 0 0 0 0 0 0
145.94/146.09 c leastinf : 0.00 0 0 0 0 0 0
145.94/146.09 c fullstrong : 0.00 0 0 0 0 0 0
145.94/146.09 c allfullstrong : 0.00 0 0 0 0 0 0
145.94/146.09 c random : 0.00 0 0 0 0 0 0
145.94/146.09 c Primal Heuristics : Time Calls Found
145.94/146.09 c LP solutions : 0.00 - 0
145.94/146.09 c pseudo solutions : 0.00 - 0
145.94/146.09 c trivial : 0.00 1 0
145.94/146.09 c simplerounding : 0.00 0 0
145.94/146.09 c zirounding : 0.00 0 0
145.94/146.09 c rounding : 0.00 0 0
145.94/146.09 c shifting : 0.00 0 0
145.94/146.09 c intshifting : 0.00 0 0
145.94/146.09 c oneopt : 0.00 0 0
145.94/146.09 c twoopt : 0.00 0 0
145.94/146.09 c fixandinfer : 0.00 0 0
145.94/146.09 c feaspump : 0.00 0 0
145.94/146.09 c coefdiving : 0.00 0 0
145.94/146.09 c pscostdiving : 0.00 0 0
145.94/146.09 c fracdiving : 0.00 0 0
145.94/146.09 c veclendiving : 0.00 0 0
145.94/146.09 c intdiving : 0.00 0 0
145.94/146.09 c actconsdiving : 0.00 0 0
145.94/146.09 c objpscostdiving : 0.00 0 0
145.94/146.09 c rootsoldiving : 0.00 0 0
145.94/146.09 c linesearchdiving : 0.00 0 0
145.94/146.09 c guideddiving : 0.00 0 0
145.94/146.09 c octane : 0.00 0 0
145.94/146.09 c rens : 0.00 0 0
145.94/146.09 c rins : 0.00 0 0
145.94/146.09 c localbranching : 0.00 0 0
145.94/146.09 c mutation : 0.00 0 0
145.94/146.09 c crossover : 0.00 0 0
145.94/146.09 c dins : 0.00 0 0
145.94/146.09 c undercover : 0.00 0 0
145.94/146.09 c nlp : 0.00 0 0
145.94/146.09 c trysol : 0.00 0 0
145.94/146.09 c LP : Time Calls Iterations Iter/call Iter/sec
145.94/146.09 c primal LP : 6.45 0 0 0.00 0.00
145.94/146.09 c dual LP : 71.69 1195 174106 145.70 2428.60
145.94/146.09 c lex dual LP : 0.00 0 0 0.00 -
145.94/146.09 c barrier LP : 0.00 0 0 0.00 -
145.94/146.09 c diving/probing LP: 0.00 0 0 0.00 -
145.94/146.09 c strong branching : 55.02 953 194595 204.19 3536.80
145.94/146.09 c (at root node) : - 10 7521 752.10 -
145.94/146.09 c conflict analysis: 0.00 0 0 0.00 -
145.94/146.09 c B&B Tree :
145.94/146.09 c number of runs : 1
145.94/146.09 c nodes : 615
145.94/146.09 c nodes (total) : 615
145.94/146.09 c nodes left : 0
145.94/146.09 c max depth : 41
145.94/146.09 c max depth (total): 41
145.94/146.09 c backtracks : 112 (18.2%)
145.94/146.09 c delayed cutoffs : 0
145.94/146.09 c repropagations : 94 (1013 domain reductions, 0 cutoffs)
145.94/146.09 c avg switch length: 2.70
145.94/146.09 c switching time : 6.80
145.94/146.09 c Solution :
145.94/146.09 c Solutions found : 0 (0 improvements)
145.94/146.09 c Primal Bound : infeasible
145.94/146.09 c Dual Bound : -
145.94/146.09 c Gap : 0.00 %
145.94/146.09 c Root Dual Bound : +0.00000000000000e+00
145.94/146.09 c Root Iterations : 1273
146.04/146.11 c Time complete: 146.06.