0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704246-1278550218.opb>
0.19/0.27 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.19/0.27 c problem read
0.19/0.27 c No objective function, only one solution is needed.
0.19/0.27 c presolving settings loaded
0.30/0.36 c presolving:
0.59/0.68 c (round 1) 1234 del vars, 2261 del conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 298456 impls, 0 clqs
0.69/0.71 c (round 2) 1262 del vars, 3404 del conss, 795 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 298562 impls, 0 clqs
0.69/0.72 c (round 3) 1265 del vars, 3413 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298654 impls, 0 clqs
0.69/0.73 c (round 4) 1266 del vars, 3420 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.69/0.74 c (round 5) 1266 del vars, 3422 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.79/0.86 c (round 6) 1266 del vars, 3477 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13207 upgd conss, 298834 impls, 0 clqs
0.89/0.92 c presolving (7 rounds):
0.89/0.92 c 1266 deleted vars, 3477 deleted constraints, 796 tightened bounds, 0 added holes, 374 changed sides, 881 changed coefficients
0.89/0.92 c 298834 implications, 0 cliques
0.89/0.92 c presolved problem has 4793 variables (4793 bin, 0 int, 0 impl, 0 cont) and 13207 constraints
0.89/0.92 c 716 constraints of type <knapsack>
0.89/0.92 c 8345 constraints of type <setppc>
0.89/0.92 c 4146 constraints of type <logicor>
0.89/0.92 c transformed objective value is always integral (scale: 1)
0.89/0.92 c Presolving Time: 0.59
0.89/0.92 c - non default parameters ----------------------------------------------------------------------
0.89/0.92 c # SCIP version 1.2.1.3
0.89/0.92 c
0.89/0.92 c # frequency for displaying node information lines
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 100]
0.89/0.92 c display/freq = 10000
0.89/0.92 c
0.89/0.92 c # maximal time in seconds to run
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.92 c limits/time = 1789.74
0.89/0.92 c
0.89/0.92 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.89/0.92 c limits/memory = 1620
0.89/0.92 c
0.89/0.92 c # solving stops, if the given number of solutions were found (-1: no limit)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.92 c limits/solutions = 1
0.89/0.92 c
0.89/0.92 c # maximal number of separation rounds per node (-1: unlimited)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 5]
0.89/0.92 c separating/maxrounds = 1
0.89/0.92 c
0.89/0.92 c # maximal number of separation rounds in the root node (-1: unlimited)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.92 c separating/maxroundsroot = 5
0.89/0.92 c
0.89/0.92 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.89/0.92 c # [type: int, range: [1,2], default: 1]
0.89/0.92 c timing/clocktype = 2
0.89/0.92 c
0.89/0.92 c # should presolving try to simplify inequalities
0.89/0.92 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.92 c constraints/linear/simplifyinequalities = TRUE
0.89/0.92 c
0.89/0.92 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.89/0.92 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.92 c constraints/indicator/addCouplingCons = TRUE
0.89/0.92 c
0.89/0.92 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.89/0.92 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.89/0.92 c constraints/knapsack/disaggregation = FALSE
0.89/0.92 c
0.89/0.92 c # should presolving try to simplify knapsacks
0.89/0.92 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.89/0.92 c constraints/knapsack/simplifyinequalities = TRUE
0.89/0.92 c
0.89/0.92 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.92 c presolving/probing/maxrounds = 0
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/coefdiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/coefdiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/coefdiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 30]
0.89/0.92 c heuristics/crossover/freq = -1
0.89/0.92 c
0.89/0.92 c # number of nodes added to the contingent of the total nodes
0.89/0.92 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.92 c heuristics/crossover/nodesofs = 750
0.89/0.92 c
0.89/0.92 c # number of nodes without incumbent change that heuristic should wait
0.89/0.92 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.89/0.92 c heuristics/crossover/nwaitingnodes = 100
0.89/0.92 c
0.89/0.92 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.89/0.92 c # [type: real, range: [0,1], default: 0.1]
0.89/0.92 c heuristics/crossover/nodesquot = 0.15
0.89/0.92 c
0.89/0.92 c # minimum percentage of integer variables that have to be fixed
0.89/0.92 c # [type: real, range: [0,1], default: 0.666]
0.89/0.92 c heuristics/crossover/minfixingrate = 0.5
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.92 c heuristics/feaspump/freq = -1
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/feaspump/maxlpiterofs = 2000
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/fracdiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/fracdiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/fracdiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/guideddiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/guideddiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/guideddiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/intdiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/intshifting/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/linesearchdiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.92 c heuristics/nlp/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.92 c heuristics/objpscostdiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to total iteration number
0.89/0.92 c # [type: real, range: [0,1], default: 0.01]
0.89/0.92 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.92 c heuristics/oneopt/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/pscostdiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.92 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/pscostdiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.92 c heuristics/rens/freq = -1
0.89/0.92 c
0.89/0.92 c # minimum percentage of integer variables that have to be fixable
0.89/0.92 c # [type: real, range: [0,1], default: 0.5]
0.89/0.92 c heuristics/rens/minfixingrate = 0.3
0.89/0.92 c
0.89/0.92 c # number of nodes added to the contingent of the total nodes
0.89/0.92 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.89/0.92 c heuristics/rens/nodesofs = 2000
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 20]
0.89/0.92 c heuristics/rootsoldiving/freq = -1
0.89/0.92 c
0.89/0.92 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.92 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.89/0.92 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.89/0.92 c
0.89/0.92 c # additional number of allowed LP iterations
0.89/0.92 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.92 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.92 c heuristics/rounding/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.92 c heuristics/shifting/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.89/0.92 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.92 c heuristics/simplerounding/freq = -1
0.89/0.92 c
0.89/0.92 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.93 c heuristics/trivial/freq = -1
0.89/0.93 c
0.89/0.93 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.93 c heuristics/trysol/freq = -1
0.89/0.93 c
0.89/0.93 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 10]
0.89/0.93 c heuristics/veclendiving/freq = -1
0.89/0.93 c
0.89/0.93 c # maximal fraction of diving LP iterations compared to node LP iterations
0.89/0.93 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.89/0.93 c heuristics/veclendiving/maxlpiterquot = 0.075
0.89/0.93 c
0.89/0.93 c # additional number of allowed LP iterations
0.89/0.93 c # [type: int, range: [0,2147483647], default: 1000]
0.89/0.93 c heuristics/veclendiving/maxlpiterofs = 1500
0.89/0.93 c
0.89/0.93 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 1]
0.89/0.93 c heuristics/zirounding/freq = -1
0.89/0.93 c
0.89/0.93 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.93 c separating/cmir/freq = -1
0.89/0.93 c
0.89/0.93 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: 0]
0.89/0.93 c separating/flowcover/freq = -1
0.89/0.93 c
0.89/0.93 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.89/0.93 c # [type: int, range: [-1,2147483647], default: -1]
0.89/0.93 c separating/rapidlearning/freq = 0
0.89/0.93 c
0.89/0.93 c -----------------------------------------------------------------------------------------------
0.89/0.93 c start solving
0.89/0.93 c
1.79/1.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.79/1.81 c 1.5s| 1 | 0 | 2077 | - | 36M| 0 |1425 |4793 | 13k|4793 | 13k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.68/3.74 c 3.5s| 1 | 0 | 3115 | - | 36M| 0 |1719 |4793 | 13k|4793 | 13k| 103 | 0 | 0 | 0.000000e+00 | -- | Inf
7.69/7.80 c 7.5s| 1 | 0 | 5060 | - | 36M| 0 |1886 |4793 | 13k|4793 | 13k| 223 | 0 | 0 | 0.000000e+00 | -- | Inf
14.98/15.09 c 14.8s| 1 | 0 | 6906 | - | 37M| 0 |2023 |4793 | 13k|4793 | 13k| 348 | 0 | 0 | 0.000000e+00 | -- | Inf
21.68/21.73 c 21.4s| 1 | 0 | 9781 | - | 37M| 0 |2037 |4793 | 13k|4793 | 13k| 471 | 0 | 0 | 0.000000e+00 | -- | Inf
31.47/31.51 c 31.2s| 1 | 0 | 11591 | - | 37M| 0 |1799 |4793 | 13k|4793 | 13k| 581 | 0 | 0 | 0.000000e+00 | -- | Inf
111.54/111.67 c 111s| 1 | 2 | 11591 | - | 37M| 0 |1799 |4793 | 13k|4793 | 13k| 581 | 0 | 47 | 0.000000e+00 | -- | Inf
403.05/403.24 c
403.05/403.24 c SCIP Status : problem is solved [infeasible]
403.05/403.24 c Solving Time (sec) : 402.96
403.05/403.24 c Solving Nodes : 185
403.05/403.24 c Primal Bound : +1.00000000000000e+20 (0 solutions)
403.05/403.24 c Dual Bound : +1.00000000000000e+20
403.05/403.24 c Gap : 0.00 %
403.05/403.24 s UNSATISFIABLE
403.05/403.24 c SCIP Status : problem is solved [infeasible]
403.05/403.24 c Solving Time : 402.96
403.05/403.24 c Original Problem :
403.05/403.24 c Problem name : HOME/instance-2704246-1278550218.opb
403.05/403.24 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
403.05/403.24 c Constraints : 16684 initial, 16684 maximal
403.05/403.24 c Presolved Problem :
403.05/403.24 c Problem name : t_HOME/instance-2704246-1278550218.opb
403.05/403.24 c Variables : 4793 (4793 binary, 0 integer, 0 implicit integer, 0 continuous)
403.05/403.24 c Constraints : 13207 initial, 13310 maximal
403.05/403.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
403.05/403.24 c trivial : 0.01 3 0 0 0 0 0 0 0
403.05/403.24 c dualfix : 0.00 1 0 0 0 0 0 0 0
403.05/403.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
403.05/403.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
403.05/403.24 c implics : 0.07 0 456 0 0 0 0 0 0
403.05/403.24 c probing : 0.00 0 0 0 0 0 0 0 0
403.05/403.24 c knapsack : 0.01 0 0 0 0 0 0 0 0
403.05/403.24 c setppc : 0.03 0 0 0 0 0 0 0 0
403.05/403.24 c linear : 0.38 796 10 0 796 0 3477 374 881
403.05/403.24 c logicor : 0.04 0 0 0 0 0 0 0 0
403.05/403.24 c root node : - 1212 - - 1212 - - - -
403.05/403.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
403.05/403.24 c integral : 0 0 0 158 0 1 5 0 0 308
403.05/403.24 c knapsack : 716 5 1781 0 0 0 75 1002 0 0
403.05/403.24 c setppc : 8345 5 1781 0 0 29 28643 0 0 0
403.05/403.24 c logicor : 4146+ 5 1417 0 0 28 10245 0 0 0
403.05/403.24 c countsols : 0 0 0 0 0 0 0 0 0 0
403.05/403.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
403.05/403.24 c integral : 312.51 0.00 0.00 312.51 0.00
403.05/403.24 c knapsack : 0.09 0.03 0.06 0.00 0.00
403.05/403.24 c setppc : 0.51 0.01 0.51 0.00 0.00
403.05/403.24 c logicor : 0.11 0.00 0.10 0.00 0.00
403.05/403.24 c countsols : 0.00 0.00 0.00 0.00 0.00
403.05/403.24 c Propagators : Time Calls Cutoffs DomReds
403.05/403.24 c vbounds : 0.00 1 0 0
403.05/403.24 c rootredcost : 0.00 0 0 0
403.05/403.24 c pseudoobj : 0.00 0 0 0
403.05/403.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
403.05/403.24 c propagation : 0.01 57 53 138 13.2 9 12.4 -
403.05/403.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
403.05/403.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
403.05/403.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
403.05/403.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
403.05/403.24 c applied globally : - - - 113 10.6 - - -
403.05/403.24 c applied locally : - - - 0 0.0 - - -
403.05/403.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
403.05/403.24 c cut pool : 0.00 4 - - 213 - (maximal pool size: 1372)
403.05/403.24 c redcost : 0.09 159 0 0 0 0
403.05/403.24 c impliedbounds : 0.03 5 0 0 0 0
403.05/403.24 c intobj : 0.00 0 0 0 0 0
403.05/403.24 c cgmip : 0.00 0 0 0 0 0
403.05/403.24 c gomory : 7.54 5 0 0 2500 0
403.05/403.24 c strongcg : 6.35 5 0 0 2500 0
403.05/403.24 c cmir : 0.00 0 0 0 0 0
403.05/403.24 c flowcover : 0.00 0 0 0 0 0
403.05/403.24 c clique : 0.45 5 0 0 40 0
403.05/403.24 c zerohalf : 0.00 0 0 0 0 0
403.05/403.24 c mcf : 0.10 1 0 0 0 0
403.05/403.24 c rapidlearning : 0.00 0 0 0 0 0
403.05/403.24 c Pricers : Time Calls Vars
403.05/403.24 c problem variables: 0.00 0 0
403.05/403.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
403.05/403.24 c relpscost : 312.50 158 1 5 0 0 308
403.05/403.24 c pscost : 0.00 0 0 0 0 0 0
403.05/403.24 c inference : 0.00 0 0 0 0 0 0
403.05/403.24 c mostinf : 0.00 0 0 0 0 0 0
403.05/403.24 c leastinf : 0.00 0 0 0 0 0 0
403.05/403.24 c fullstrong : 0.00 0 0 0 0 0 0
403.05/403.24 c allfullstrong : 0.00 0 0 0 0 0 0
403.05/403.24 c random : 0.00 0 0 0 0 0 0
403.05/403.24 c Primal Heuristics : Time Calls Found
403.05/403.24 c LP solutions : 0.00 - 0
403.05/403.24 c pseudo solutions : 0.00 - 0
403.05/403.24 c trivial : 0.01 1 0
403.05/403.24 c simplerounding : 0.00 0 0
403.05/403.24 c zirounding : 0.00 0 0
403.05/403.24 c rounding : 0.00 0 0
403.05/403.24 c shifting : 0.00 0 0
403.05/403.24 c intshifting : 0.00 0 0
403.05/403.24 c oneopt : 0.00 0 0
403.05/403.24 c twoopt : 0.00 0 0
403.05/403.24 c fixandinfer : 0.00 0 0
403.05/403.24 c feaspump : 0.00 0 0
403.05/403.24 c coefdiving : 0.00 0 0
403.05/403.24 c pscostdiving : 0.00 0 0
403.05/403.24 c fracdiving : 0.00 0 0
403.05/403.24 c veclendiving : 0.00 0 0
403.05/403.24 c intdiving : 0.00 0 0
403.05/403.25 c actconsdiving : 0.00 0 0
403.05/403.25 c objpscostdiving : 0.00 0 0
403.05/403.25 c rootsoldiving : 0.00 0 0
403.05/403.25 c linesearchdiving : 0.00 0 0
403.05/403.25 c guideddiving : 0.00 0 0
403.05/403.25 c octane : 0.00 0 0
403.05/403.25 c rens : 0.00 0 0
403.05/403.25 c rins : 0.00 0 0
403.05/403.25 c localbranching : 0.00 0 0
403.05/403.25 c mutation : 0.00 0 0
403.05/403.25 c crossover : 0.00 0 0
403.05/403.25 c dins : 0.00 0 0
403.05/403.25 c undercover : 0.00 0 0
403.05/403.25 c nlp : 0.00 0 0
403.05/403.25 c trysol : 0.00 0 0
403.05/403.25 c LP : Time Calls Iterations Iter/call Iter/sec
403.05/403.25 c primal LP : 0.01 0 0 0.00 0.00
403.05/403.25 c dual LP : 73.00 163 49156 301.57 673.41
403.05/403.25 c lex dual LP : 0.00 0 0 0.00 -
403.05/403.25 c barrier LP : 0.00 0 0 0.00 -
403.05/403.25 c diving/probing LP: 0.00 0 0 0.00 -
403.05/403.25 c strong branching : 312.40 236 173012 733.10 553.81
403.05/403.25 c (at root node) : - 47 41514 883.28 -
403.05/403.25 c conflict analysis: 0.00 0 0 0.00 -
403.05/403.25 c B&B Tree :
403.05/403.25 c number of runs : 1
403.05/403.25 c nodes : 185
403.05/403.25 c nodes (total) : 185
403.05/403.25 c nodes left : 0
403.05/403.25 c max depth : 66
403.05/403.25 c max depth (total): 66
403.05/403.25 c backtracks : 31 (16.8%)
403.05/403.25 c delayed cutoffs : 124
403.05/403.25 c repropagations : 234 (12309 domain reductions, 27 cutoffs)
403.05/403.25 c avg switch length: 4.12
403.05/403.25 c switching time : 0.25
403.05/403.25 c Solution :
403.05/403.25 c Solutions found : 0 (0 improvements)
403.05/403.25 c Primal Bound : infeasible
403.05/403.25 c Dual Bound : -
403.05/403.25 c Gap : 0.00 %
403.05/403.25 c Root Dual Bound : +0.00000000000000e+00
403.05/403.25 c Root Iterations : 11591
403.15/403.34 c Time complete: 403.2.