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-2665846-1276298427.opb>
0.00/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c problem read
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c presolving settings loaded
0.00/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.17 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 59 | - |3551k| 0 | 32 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.4s| 1 | 0 | 86 | - |3932k| 0 | 37 | 231 |2783 | 231 |2577 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 146 | - |4580k| 0 | 51 | 231 |2783 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.88/0.99 c 0.8s| 1 | 0 | 209 | - |4895k| 0 | 54 | 231 |2783 | 231 |2583 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.83 c 1.7s| 1 | 0 | 1249 | - |5393k| 0 | 56 | 231 |2783 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.08 c 1.9s| 1 | 0 | 1410 | - |6117k| 0 | 75 | 231 |2783 | 231 |2588 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
4.59/4.63 c 4.5s| 1 | 2 | 1410 | - |6117k| 0 | 75 | 231 |2783 | 231 |2588 | 24 | 0 | 9 | 0.000000e+00 | -- | Inf
289.09/289.28 c 284s| 10000 | 60 |669826 | 66.8 |8046k| 45 | - | 231 |6574 | 231 |2573 | 24 |6026 |1869 | 0.000000e+00 | -- | Inf
538.99/539.26 c 528s| 20000 | 12 | 1404k| 70.1 |8415k| 47 | 37 | 231 |7469 | 231 |2573 | 24 | 12k|2415 | 0.000000e+00 | -- | Inf
566.48/566.73 c
566.48/566.73 c SCIP Status : problem is solved [infeasible]
566.48/566.73 c Solving Time (sec) : 554.61
566.48/566.73 c Solving Nodes : 21191
566.48/566.73 c Primal Bound : +1.00000000000000e+20 (0 solutions)
566.48/566.73 c Dual Bound : +1.00000000000000e+20
566.48/566.73 c Gap : 0.00 %
566.48/566.73 s UNSATISFIABLE
566.48/566.73 c SCIP Status : problem is solved [infeasible]
566.48/566.73 c Solving Time : 554.61
566.48/566.73 c Original Problem :
566.48/566.73 c Problem name : HOME/instance-2665846-1276298427.opb
566.48/566.73 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
566.48/566.73 c Constraints : 2707 initial, 2707 maximal
566.48/566.73 c Presolved Problem :
566.48/566.73 c Problem name : t_HOME/instance-2665846-1276298427.opb
566.48/566.73 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
566.48/566.73 c Constraints : 2564 initial, 7900 maximal
566.48/566.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
566.48/566.73 c trivial : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c implics : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c probing : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c knapsack : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c setppc : 0.00 0 0 0 0 0 0 0 0
566.48/566.73 c linear : 0.02 0 0 0 0 0 143 0 0
566.48/566.73 c logicor : 0.03 0 0 0 0 0 0 0 0
566.48/566.73 c root node : - 1 - - 1 - - - -
566.48/566.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
566.48/566.73 c integral : 0 0 0 11270 0 57 935 0 0 21372
566.48/566.73 c knapsack : 1 5 73029 0 0 149 57590 0 0 0
566.48/566.73 c setppc : 22 5 72984 0 0 712 129566 0 0 0
566.48/566.73 c linear : 0+ 5 70434 0 0 21 463 2 0 0
566.48/566.73 c logicor : 2541+ 5 40740 0 0 254 134845 0 0 0
566.48/566.73 c countsols : 0 0 0 0 0 0 0 0 0 0
566.48/566.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
566.48/566.73 c integral : 100.19 0.00 0.00 100.19 0.00
566.48/566.73 c knapsack : 0.75 0.00 0.75 0.00 0.00
566.48/566.73 c setppc : 1.50 0.00 1.50 0.00 0.00
566.48/566.73 c linear : 0.75 0.00 0.75 0.00 0.00
566.48/566.73 c logicor : 5.62 0.00 5.62 0.00 0.00
566.48/566.73 c countsols : 0.00 0.00 0.00 0.00 0.00
566.48/566.73 c Propagators : Time Calls Cutoffs DomReds
566.48/566.73 c vbounds : 0.04 1 0 0
566.48/566.73 c rootredcost : 0.07 0 0 0
566.48/566.73 c pseudoobj : 0.03 0 0 0
566.48/566.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
566.48/566.73 c propagation : 0.05 1136 1131 5133 18.5 19 18.8 -
566.48/566.73 c infeasible LP : 3.74 9491 7308 38239 30.6 51 15.9 0
566.48/566.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
566.48/566.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
566.48/566.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
566.48/566.73 c applied globally : - - - 12965 18.5 - - -
566.48/566.73 c applied locally : - - - 237 34.1 - - -
566.48/566.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
566.48/566.73 c cut pool : 0.00 4 - - 5 - (maximal pool size: 667)
566.48/566.73 c redcost : 0.10 10767 0 0 0 0
566.48/566.73 c impliedbounds : 0.00 5 0 0 0 0
566.48/566.73 c intobj : 0.00 0 0 0 0 0
566.48/566.73 c cgmip : 0.00 0 0 0 0 0
566.48/566.73 c gomory : 0.57 5 0 0 1505 0
566.48/566.73 c strongcg : 0.41 5 0 0 2500 0
566.48/566.73 c cmir : 0.00 0 0 0 0 0
566.48/566.73 c flowcover : 0.00 0 0 0 0 0
566.48/566.73 c clique : 0.00 5 0 0 0 0
566.48/566.73 c zerohalf : 0.00 0 0 0 0 0
566.48/566.73 c mcf : 0.00 1 0 0 0 0
566.48/566.73 c rapidlearning : 0.25 1 0 0 0 219
566.48/566.73 c Pricers : Time Calls Vars
566.48/566.73 c problem variables: 0.00 0 0
566.48/566.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
566.48/566.73 c relpscost : 100.15 11270 57 935 0 0 21372
566.48/566.73 c pscost : 0.00 0 0 0 0 0 0
566.48/566.73 c inference : 0.00 0 0 0 0 0 0
566.48/566.73 c mostinf : 0.00 0 0 0 0 0 0
566.48/566.73 c leastinf : 0.00 0 0 0 0 0 0
566.48/566.73 c fullstrong : 0.00 0 0 0 0 0 0
566.48/566.73 c allfullstrong : 0.00 0 0 0 0 0 0
566.48/566.73 c random : 0.00 0 0 0 0 0 0
566.48/566.73 c Primal Heuristics : Time Calls Found
566.48/566.73 c LP solutions : 0.00 - 0
566.48/566.73 c pseudo solutions : 0.00 - 0
566.48/566.73 c trivial : 0.00 1 0
566.48/566.73 c simplerounding : 0.00 0 0
566.48/566.73 c zirounding : 0.00 0 0
566.48/566.73 c rounding : 0.00 0 0
566.48/566.73 c shifting : 0.00 0 0
566.48/566.73 c intshifting : 0.00 0 0
566.48/566.73 c oneopt : 0.00 0 0
566.48/566.73 c twoopt : 0.00 0 0
566.48/566.73 c fixandinfer : 0.00 0 0
566.48/566.73 c feaspump : 0.00 0 0
566.48/566.73 c coefdiving : 0.00 0 0
566.48/566.73 c pscostdiving : 0.00 0 0
566.48/566.73 c fracdiving : 0.00 0 0
566.48/566.73 c veclendiving : 0.00 0 0
566.48/566.73 c intdiving : 0.00 0 0
566.48/566.73 c actconsdiving : 0.00 0 0
566.48/566.73 c objpscostdiving : 0.00 0 0
566.48/566.73 c rootsoldiving : 0.00 0 0
566.48/566.73 c linesearchdiving : 0.00 0 0
566.48/566.73 c guideddiving : 0.00 0 0
566.48/566.73 c octane : 0.00 0 0
566.48/566.73 c rens : 0.00 0 0
566.48/566.73 c rins : 0.00 0 0
566.48/566.73 c localbranching : 0.00 0 0
566.48/566.73 c mutation : 0.00 0 0
566.48/566.73 c crossover : 0.00 0 0
566.48/566.73 c dins : 0.00 0 0
566.48/566.73 c undercover : 0.00 0 0
566.48/566.73 c nlp : 0.00 0 0
566.48/566.73 c trysol : 0.00 0 0
566.48/566.73 c LP : Time Calls Iterations Iter/call Iter/sec
566.48/566.73 c primal LP : 0.00 0 0 0.00 -
566.48/566.73 c dual LP : 425.72 20747 1476564 71.17 3468.39
566.48/566.73 c lex dual LP : 0.00 0 0 0.00 -
566.48/566.73 c barrier LP : 0.00 0 0 0.00 -
566.48/566.73 c diving/probing LP: 0.00 0 0 0.00 -
566.48/566.73 c strong branching : 99.53 2554 344503 134.89 3461.30
566.48/566.73 c (at root node) : - 9 5512 612.44 -
566.48/566.73 c conflict analysis: 0.00 0 0 0.00 -
566.48/566.73 c B&B Tree :
566.48/566.73 c number of runs : 1
566.48/566.73 c nodes : 21191
566.48/566.73 c nodes (total) : 21191
566.48/566.73 c nodes left : 0
566.48/566.73 c max depth : 47
566.48/566.73 c max depth (total): 47
566.48/566.73 c backtracks : 2424 (11.4%)
566.48/566.73 c delayed cutoffs : 182
566.48/566.73 c repropagations : 24667 (42564 domain reductions, 179 cutoffs)
566.48/566.73 c avg switch length: 4.31
566.48/566.73 c switching time : 6.23
566.48/566.73 c Solution :
566.48/566.73 c Solutions found : 0 (0 improvements)
566.48/566.73 c Primal Bound : infeasible
566.48/566.73 c Dual Bound : -
566.48/566.73 c Gap : 0.00 %
566.48/566.73 c Root Dual Bound : +0.00000000000000e+00
566.48/566.73 c Root Iterations : 1410
566.48/566.75 c Time complete: 566.53.