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-2667294-1276303180.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 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.96
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 | 86 | - |3551k| 0 | 37 | 231 |2564 | 231 |2564 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.53 c 0.4s| 1 | 0 | 103 | - |3947k| 0 | 41 | 231 |2725 | 231 |2576 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.6s| 1 | 0 | 127 | - |4557k| 0 | 47 | 231 |2725 | 231 |2580 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.06 c 0.9s| 1 | 0 | 168 | - |4609k| 0 | 51 | 231 |2725 | 231 |2585 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.50 c 1.4s| 1 | 0 | 175 | - |4610k| 0 | 54 | 231 |2725 | 231 |2586 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.73 c 2.6s| 1 | 2 | 175 | - |4611k| 0 | 54 | 231 |2725 | 231 |2586 | 22 | 0 | 10 | 0.000000e+00 | -- | Inf
175.04/175.16 c 172s| 10000 | 110 |307574 | 30.7 |7219k| 40 | - | 231 |7867 | 231 |2578 | 22 |7258 |2223 | 0.000000e+00 | -- | Inf
315.40/315.52 c 309s| 20000 | 98 |641200 | 32.1 |7865k| 46 | - | 231 |8648 | 231 |2578 | 22 | 15k|2520 | 0.000000e+00 | -- | Inf
464.56/464.75 c 456s| 30000 | 13 |974919 | 32.5 |7781k| 47 | 28 | 231 |8949 | 231 |2578 | 22 | 22k|3248 | 0.000000e+00 | -- | Inf
498.45/498.64 c
498.45/498.64 c SCIP Status : problem is solved [infeasible]
498.45/498.64 c Solving Time (sec) : 488.91
498.45/498.64 c Solving Nodes : 32188
498.45/498.64 c Primal Bound : +1.00000000000000e+20 (0 solutions)
498.45/498.64 c Dual Bound : +1.00000000000000e+20
498.45/498.64 c Gap : 0.00 %
498.45/498.64 s UNSATISFIABLE
498.45/498.64 c SCIP Status : problem is solved [infeasible]
498.45/498.64 c Solving Time : 488.91
498.45/498.64 c Original Problem :
498.45/498.64 c Problem name : HOME/instance-2667294-1276303180.opb
498.45/498.64 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
498.45/498.64 c Constraints : 2707 initial, 2707 maximal
498.45/498.64 c Presolved Problem :
498.45/498.64 c Problem name : t_HOME/instance-2667294-1276303180.opb
498.45/498.64 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
498.45/498.64 c Constraints : 2564 initial, 10152 maximal
498.45/498.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
498.45/498.64 c trivial : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c dualfix : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c boundshift : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c implics : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c probing : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c knapsack : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c setppc : 0.00 0 0 0 0 0 0 0 0
498.45/498.64 c linear : 0.03 0 0 0 0 0 143 0 0
498.45/498.64 c logicor : 0.03 0 0 0 0 0 0 0 0
498.45/498.64 c root node : - 21 - - 21 - - - -
498.45/498.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
498.45/498.64 c integral : 0 0 0 17019 0 85 1274 0 0 32488
498.45/498.64 c knapsack : 1 5 126839 0 0 245 82745 0 0 0
498.45/498.64 c setppc : 22 5 126735 0 0 1040 187327 0 0 0
498.45/498.64 c linear : 0+ 5 124752 0 0 4 2511 0 0 0
498.45/498.64 c logicor : 2541+ 5 61997 0 0 350 207560 0 0 0
498.45/498.64 c countsols : 0 0 0 0 0 0 0 0 0 0
498.45/498.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
498.45/498.64 c integral : 72.49 0.00 0.00 72.49 0.00
498.45/498.64 c knapsack : 1.14 0.00 1.14 0.00 0.00
498.45/498.64 c setppc : 2.07 0.00 2.07 0.00 0.00
498.45/498.64 c linear : 1.21 0.00 1.21 0.00 0.00
498.45/498.64 c logicor : 10.42 0.00 10.42 0.00 0.00
498.45/498.64 c countsols : 0.00 0.00 0.00 0.00 0.00
498.45/498.64 c Propagators : Time Calls Cutoffs DomReds
498.45/498.64 c vbounds : 0.03 1 0 0
498.45/498.64 c rootredcost : 0.11 0 0 0
498.45/498.64 c pseudoobj : 0.08 0 0 0
498.45/498.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
498.45/498.64 c propagation : 0.09 1639 1632 7965 18.9 20 18.1 -
498.45/498.64 c infeasible LP : 6.12 14517 14331 82476 30.2 88 18.2 0
498.45/498.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
498.45/498.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
498.45/498.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
498.45/498.64 c applied globally : - - - 24182 18.2 - - -
498.45/498.64 c applied locally : - - - 318 33.2 - - -
498.45/498.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
498.45/498.64 c cut pool : 0.00 4 - - 59 - (maximal pool size: 346)
498.45/498.64 c redcost : 0.11 16375 0 0 0 0
498.45/498.64 c impliedbounds : 0.00 5 0 0 0 0
498.45/498.64 c intobj : 0.00 0 0 0 0 0
498.45/498.64 c cgmip : 0.00 0 0 0 0 0
498.45/498.64 c gomory : 0.80 5 0 0 1275 0
498.45/498.64 c strongcg : 0.64 5 0 0 1306 0
498.45/498.64 c cmir : 0.00 0 0 0 0 0
498.45/498.64 c flowcover : 0.00 0 0 0 0 0
498.45/498.64 c clique : 0.00 5 0 0 0 0
498.45/498.64 c zerohalf : 0.00 0 0 0 0 0
498.45/498.64 c mcf : 0.00 1 0 0 0 0
498.45/498.64 c rapidlearning : 0.19 1 0 0 0 161
498.45/498.64 c Pricers : Time Calls Vars
498.45/498.64 c problem variables: 0.00 0 0
498.45/498.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
498.45/498.64 c relpscost : 72.44 17019 85 1274 0 0 32488
498.45/498.64 c pscost : 0.00 0 0 0 0 0 0
498.45/498.64 c inference : 0.00 0 0 0 0 0 0
498.45/498.64 c mostinf : 0.00 0 0 0 0 0 0
498.45/498.64 c leastinf : 0.00 0 0 0 0 0 0
498.45/498.64 c fullstrong : 0.00 0 0 0 0 0 0
498.45/498.64 c allfullstrong : 0.00 0 0 0 0 0 0
498.45/498.64 c random : 0.00 0 0 0 0 0 0
498.45/498.64 c Primal Heuristics : Time Calls Found
498.45/498.64 c LP solutions : 0.00 - 0
498.45/498.64 c pseudo solutions : 0.00 - 0
498.45/498.64 c trivial : 0.00 1 0
498.45/498.64 c simplerounding : 0.00 0 0
498.45/498.64 c zirounding : 0.00 0 0
498.45/498.64 c rounding : 0.00 0 0
498.45/498.64 c shifting : 0.00 0 0
498.45/498.64 c intshifting : 0.00 0 0
498.45/498.64 c oneopt : 0.00 0 0
498.45/498.64 c twoopt : 0.00 0 0
498.45/498.64 c fixandinfer : 0.00 0 0
498.45/498.64 c feaspump : 0.00 0 0
498.45/498.64 c coefdiving : 0.00 0 0
498.45/498.64 c pscostdiving : 0.00 0 0
498.45/498.64 c fracdiving : 0.00 0 0
498.45/498.64 c veclendiving : 0.00 0 0
498.45/498.64 c intdiving : 0.00 0 0
498.45/498.64 c actconsdiving : 0.00 0 0
498.45/498.64 c objpscostdiving : 0.00 0 0
498.45/498.64 c rootsoldiving : 0.00 0 0
498.45/498.64 c linesearchdiving : 0.00 0 0
498.45/498.64 c guideddiving : 0.00 0 0
498.45/498.64 c octane : 0.00 0 0
498.45/498.64 c rens : 0.00 0 0
498.45/498.64 c rins : 0.00 0 0
498.45/498.64 c localbranching : 0.00 0 0
498.45/498.64 c mutation : 0.00 0 0
498.45/498.64 c crossover : 0.00 0 0
498.45/498.64 c dins : 0.00 0 0
498.45/498.64 c undercover : 0.00 0 0
498.45/498.64 c nlp : 0.00 0 0
498.45/498.64 c trysol : 0.00 0 0
498.45/498.64 c LP : Time Calls Iterations Iter/call Iter/sec
498.45/498.64 c primal LP : 0.00 0 0 0.00 -
498.45/498.64 c dual LP : 365.88 31472 1050785 33.39 2871.94
498.45/498.64 c lex dual LP : 0.00 0 0 0.00 -
498.45/498.64 c barrier LP : 0.00 0 0 0.00 -
498.45/498.64 c diving/probing LP: 0.00 0 0 0.00 -
498.45/498.64 c strong branching : 71.82 3429 203717 59.41 2836.49
498.45/498.64 c (at root node) : - 10 1931 193.10 -
498.45/498.64 c conflict analysis: 0.00 0 0 0.00 -
498.45/498.64 c B&B Tree :
498.45/498.64 c number of runs : 1
498.45/498.64 c nodes : 32188
498.45/498.64 c nodes (total) : 32188
498.45/498.64 c nodes left : 0
498.45/498.64 c max depth : 47
498.45/498.64 c max depth (total): 47
498.45/498.64 c backtracks : 3746 (11.6%)
498.45/498.64 c delayed cutoffs : 301
498.45/498.64 c repropagations : 51598 (71016 domain reductions, 297 cutoffs)
498.45/498.64 c avg switch length: 4.91
498.45/498.64 c switching time : 10.33
498.45/498.64 c Solution :
498.45/498.64 c Solutions found : 0 (0 improvements)
498.45/498.64 c Primal Bound : infeasible
498.45/498.64 c Dual Bound : -
498.45/498.64 c Gap : 0.00 %
498.45/498.64 c Root Dual Bound : +0.00000000000000e+00
498.45/498.64 c Root Iterations : 175
498.45/498.66 c Time complete: 498.52.