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-2667318-1276314669.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.18 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.18 c 0.1s| 1 | 0 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.4s| 1 | 0 | 103 | - |3965k| 0 | 41 | 231 |2730 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.6s| 1 | 0 | 127 | - |4576k| 0 | 47 | 231 |2730 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.08 c 0.9s| 1 | 0 | 181 | - |4628k| 0 | 55 | 231 |2730 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 184 | - |4629k| 0 | 56 | 231 |2730 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.61 c 2.5s| 1 | 2 | 184 | - |4629k| 0 | 56 | 231 |2730 | 231 |2586 | 22 | 0 | 10 | 0.000000e+00 | -- | Inf
186.32/186.48 c 183s| 10000 | 36 |332812 | 33.3 |7201k| 38 | - | 231 |8436 | 231 |2577 | 22 |7804 |2335 | 0.000000e+00 | -- | Inf
308.67/308.81 c 303s| 20000 | 78 |625096 | 31.2 |8140k| 52 | 36 | 231 |9517 | 231 |2577 | 22 | 15k|2578 | 0.000000e+00 | -- | Inf
452.52/452.72 c 444s| 30000 | 19 |948678 | 31.6 |8399k| 52 | - | 231 | 10k| 231 |2577 | 22 | 22k|3299 | 0.000000e+00 | -- | Inf
483.61/483.88 c
483.61/483.88 c SCIP Status : problem is solved [infeasible]
483.61/483.88 c Solving Time (sec) : 474.14
483.61/483.88 c Solving Nodes : 32222
483.61/483.88 c Primal Bound : +1.00000000000000e+20 (0 solutions)
483.61/483.88 c Dual Bound : +1.00000000000000e+20
483.61/483.88 c Gap : 0.00 %
483.61/483.88 s UNSATISFIABLE
483.61/483.88 c SCIP Status : problem is solved [infeasible]
483.61/483.88 c Solving Time : 474.14
483.61/483.88 c Original Problem :
483.61/483.88 c Problem name : HOME/instance-2667318-1276314669.opb
483.61/483.88 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
483.61/483.88 c Constraints : 2707 initial, 2707 maximal
483.61/483.88 c Presolved Problem :
483.61/483.88 c Problem name : t_HOME/instance-2667318-1276314669.opb
483.61/483.88 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
483.61/483.88 c Constraints : 2564 initial, 11036 maximal
483.61/483.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
483.61/483.88 c trivial : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c implics : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c probing : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c knapsack : 0.01 0 0 0 0 0 0 0 0
483.61/483.88 c setppc : 0.00 0 0 0 0 0 0 0 0
483.61/483.88 c linear : 0.02 0 0 0 0 0 143 0 0
483.61/483.88 c logicor : 0.03 0 0 0 0 0 0 0 0
483.61/483.88 c root node : - 2 - - 2 - - - -
483.61/483.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
483.61/483.88 c integral : 0 0 0 17120 0 68 1562 0 0 32364
483.61/483.88 c knapsack : 1 5 128605 0 0 166 59705 0 0 0
483.61/483.88 c setppc : 22 5 128632 0 0 544 186329 0 0 0
483.61/483.88 c linear : 0+ 5 127604 0 0 6 579 0 0 0
483.61/483.88 c logicor : 2541+ 5 61015 0 0 149 192516 0 0 0
483.61/483.88 c countsols : 0 0 0 0 0 0 0 0 0 0
483.61/483.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
483.61/483.88 c integral : 73.87 0.00 0.00 73.87 0.00
483.61/483.88 c knapsack : 0.83 0.00 0.83 0.00 0.00
483.61/483.88 c setppc : 1.99 0.00 1.99 0.00 0.00
483.61/483.88 c linear : 1.05 0.00 1.05 0.00 0.00
483.61/483.88 c logicor : 9.81 0.00 9.81 0.00 0.00
483.61/483.88 c countsols : 0.00 0.00 0.00 0.00 0.00
483.61/483.88 c Propagators : Time Calls Cutoffs DomReds
483.61/483.88 c vbounds : 0.10 1 0 0
483.61/483.88 c rootredcost : 0.10 0 0 0
483.61/483.88 c pseudoobj : 0.05 0 0 0
483.61/483.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
483.61/483.88 c propagation : 0.07 865 861 4191 20.7 12 20.2 -
483.61/483.88 c infeasible LP : 6.55 15247 15067 85605 30.2 117 19.2 0
483.61/483.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
483.61/483.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
483.61/483.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
483.61/483.88 c applied globally : - - - 24219 19.4 - - -
483.61/483.88 c applied locally : - - - 496 32.2 - - -
483.61/483.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
483.61/483.88 c cut pool : 0.00 4 - - 60 - (maximal pool size: 346)
483.61/483.88 c redcost : 0.12 16298 0 0 0 0
483.61/483.88 c impliedbounds : 0.00 5 0 0 0 0
483.61/483.88 c intobj : 0.00 0 0 0 0 0
483.61/483.88 c cgmip : 0.00 0 0 0 0 0
483.61/483.88 c gomory : 0.80 5 0 0 1275 0
483.61/483.88 c strongcg : 0.65 5 0 0 1306 0
483.61/483.88 c cmir : 0.00 0 0 0 0 0
483.61/483.88 c flowcover : 0.00 0 0 0 0 0
483.61/483.88 c clique : 0.00 5 0 0 0 0
483.61/483.88 c zerohalf : 0.00 0 0 0 0 0
483.61/483.88 c mcf : 0.00 1 0 0 0 0
483.61/483.88 c rapidlearning : 0.22 1 0 0 0 166
483.61/483.88 c Pricers : Time Calls Vars
483.61/483.88 c problem variables: 0.00 0 0
483.61/483.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
483.61/483.88 c relpscost : 73.83 17120 68 1562 0 0 32364
483.61/483.88 c pscost : 0.00 0 0 0 0 0 0
483.61/483.88 c inference : 0.00 0 0 0 0 0 0
483.61/483.88 c mostinf : 0.00 0 0 0 0 0 0
483.61/483.88 c leastinf : 0.00 0 0 0 0 0 0
483.61/483.88 c fullstrong : 0.00 0 0 0 0 0 0
483.61/483.88 c allfullstrong : 0.00 0 0 0 0 0 0
483.61/483.88 c random : 0.00 0 0 0 0 0 0
483.61/483.88 c Primal Heuristics : Time Calls Found
483.61/483.88 c LP solutions : 0.00 - 0
483.61/483.88 c pseudo solutions : 0.00 - 0
483.61/483.88 c trivial : 0.00 1 0
483.61/483.88 c simplerounding : 0.00 0 0
483.61/483.88 c zirounding : 0.00 0 0
483.61/483.88 c rounding : 0.00 0 0
483.61/483.88 c shifting : 0.00 0 0
483.61/483.88 c intshifting : 0.00 0 0
483.61/483.88 c oneopt : 0.00 0 0
483.61/483.88 c twoopt : 0.00 0 0
483.61/483.88 c fixandinfer : 0.00 0 0
483.61/483.88 c feaspump : 0.00 0 0
483.61/483.88 c coefdiving : 0.00 0 0
483.61/483.88 c pscostdiving : 0.00 0 0
483.61/483.88 c fracdiving : 0.00 0 0
483.61/483.88 c veclendiving : 0.00 0 0
483.61/483.88 c intdiving : 0.00 0 0
483.61/483.88 c actconsdiving : 0.00 0 0
483.61/483.88 c objpscostdiving : 0.00 0 0
483.61/483.88 c rootsoldiving : 0.00 0 0
483.61/483.88 c linesearchdiving : 0.00 0 0
483.61/483.88 c guideddiving : 0.00 0 0
483.61/483.88 c octane : 0.00 0 0
483.61/483.88 c rens : 0.00 0 0
483.61/483.88 c rins : 0.00 0 0
483.61/483.88 c localbranching : 0.00 0 0
483.61/483.88 c mutation : 0.00 0 0
483.61/483.88 c crossover : 0.00 0 0
483.61/483.88 c dins : 0.00 0 0
483.61/483.88 c undercover : 0.00 0 0
483.61/483.88 c nlp : 0.00 0 0
483.61/483.88 c trysol : 0.00 0 0
483.61/483.88 c LP : Time Calls Iterations Iter/call Iter/sec
483.61/483.88 c primal LP : 0.00 0 0 0.00 -
483.61/483.88 c dual LP : 349.25 32282 1015301 31.45 2907.09
483.61/483.88 c lex dual LP : 0.00 0 0 0.00 -
483.61/483.88 c barrier LP : 0.00 0 0 0.00 -
483.61/483.88 c diving/probing LP: 0.00 0 0 0.00 -
483.61/483.88 c strong branching : 73.07 3505 205797 58.72 2816.44
483.61/483.88 c (at root node) : - 10 1605 160.50 -
483.61/483.88 c conflict analysis: 0.00 0 0 0.00 -
483.61/483.88 c B&B Tree :
483.61/483.88 c number of runs : 1
483.61/483.88 c nodes : 32222
483.61/483.88 c nodes (total) : 32222
483.61/483.88 c nodes left : 0
483.61/483.88 c max depth : 52
483.61/483.88 c max depth (total): 52
483.61/483.88 c backtracks : 3490 (10.8%)
483.61/483.88 c delayed cutoffs : 143
483.61/483.88 c repropagations : 54456 (60555 domain reductions, 140 cutoffs)
483.61/483.88 c avg switch length: 5.00
483.61/483.88 c switching time : 10.07
483.61/483.88 c Solution :
483.61/483.88 c Solutions found : 0 (0 improvements)
483.61/483.88 c Primal Bound : infeasible
483.61/483.88 c Dual Bound : -
483.61/483.88 c Gap : 0.00 %
483.61/483.88 c Root Dual Bound : +0.00000000000000e+00
483.61/483.88 c Root Iterations : 184
483.71/483.91 c Time complete: 483.72.