0.00/0.01 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3451721-1307116673.opb>
0.19/0.20 c original problem has 9638 variables (9638 bin, 0 int, 0 impl, 0 cont) and 30220 constraints
0.19/0.20 c problem read
0.19/0.20 c No objective function, only one solution is needed.
0.19/0.20 c presolving settings loaded
0.19/0.25 c presolving:
0.69/0.79 c (round 1) 1982 del vars, 5307 del conss, 0 add conss, 1275 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1666520 impls, 0 clqs
0.88/0.97 c (round 2) 4964 del vars, 15526 del conss, 0 add conss, 3995 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1681738 impls, 0 clqs
1.00/1.01 c (round 3) 5802 del vars, 19471 del conss, 0 add conss, 4436 chg bounds, 24 chg sides, 7 chg coeffs, 0 upgd conss, 1686895 impls, 0 clqs
1.00/1.02 c (round 4) 6174 del vars, 20738 del conss, 0 add conss, 4688 chg bounds, 36 chg sides, 18 chg coeffs, 0 upgd conss, 1690986 impls, 0 clqs
1.00/1.03 c (round 5) 6436 del vars, 21657 del conss, 0 add conss, 4859 chg bounds, 42 chg sides, 24 chg coeffs, 0 upgd conss, 1692886 impls, 0 clqs
1.00/1.03 c (round 6) 6505 del vars, 21992 del conss, 0 add conss, 4902 chg bounds, 45 chg sides, 27 chg coeffs, 0 upgd conss, 1693248 impls, 0 clqs
1.00/1.04 c (round 7) 6527 del vars, 22077 del conss, 0 add conss, 4919 chg bounds, 48 chg sides, 30 chg coeffs, 0 upgd conss, 1693332 impls, 0 clqs
1.00/1.04 c (round 8) 6536 del vars, 22113 del conss, 0 add conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
1.00/1.04 c (round 9) 6536 del vars, 22115 del conss, 0 add conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 0 upgd conss, 1693428 impls, 0 clqs
1.00/1.08 c (round 10) 6536 del vars, 22115 del conss, 0 add conss, 4920 chg bounds, 51 chg sides, 33 chg coeffs, 8105 upgd conss, 1693428 impls, 0 clqs
1.00/1.10 c (round 11) 6559 del vars, 22132 del conss, 0 add conss, 4930 chg bounds, 58 chg sides, 85 chg coeffs, 8105 upgd conss, 1696014 impls, 112 clqs
1.00/1.11 c (round 12) 6578 del vars, 22206 del conss, 0 add conss, 4932 chg bounds, 60 chg sides, 108 chg coeffs, 8105 upgd conss, 1697226 impls, 122 clqs
1.10/1.13 c (round 13) 6580 del vars, 22222 del conss, 0 add conss, 4932 chg bounds, 62 chg sides, 122 chg coeffs, 8105 upgd conss, 1697226 impls, 125 clqs
1.10/1.14 c presolving (14 rounds):
1.10/1.14 c 6580 deleted vars, 22222 deleted constraints, 0 added constraints, 4932 tightened bounds, 0 added holes, 62 changed sides, 127 changed coefficients
1.10/1.14 c 1697226 implications, 128 cliques
1.10/1.14 c presolved problem has 3058 variables (3058 bin, 0 int, 0 impl, 0 cont) and 7998 constraints
1.10/1.14 c 261 constraints of type <knapsack>
1.10/1.14 c 6346 constraints of type <setppc>
1.10/1.14 c 1391 constraints of type <logicor>
1.10/1.14 c transformed objective value is always integral (scale: 1)
1.10/1.14 c Presolving Time: 0.90
1.10/1.14 c - non default parameters ----------------------------------------------------------------------
1.10/1.14 c # SCIP version 2.0.1.5
1.10/1.14 c
1.10/1.14 c # frequency for displaying node information lines
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 100]
1.10/1.14 c display/freq = 10000
1.10/1.14 c
1.10/1.14 c # maximal time in seconds to run
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.14 c limits/time = 1800
1.10/1.14 c
1.10/1.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.14 c limits/memory = 13950
1.10/1.14 c
1.10/1.14 c # solving stops, if the given number of solutions were found (-1: no limit)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c limits/solutions = 1
1.10/1.14 c
1.10/1.14 c # maximal number of separation rounds per node (-1: unlimited)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 5]
1.10/1.14 c separating/maxrounds = 1
1.10/1.14 c
1.10/1.14 c # maximal number of separation rounds in the root node (-1: unlimited)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c separating/maxroundsroot = 5
1.10/1.14 c
1.10/1.14 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.10/1.14 c # [type: int, range: [1,2], default: 1]
1.10/1.14 c timing/clocktype = 2
1.10/1.14 c
1.10/1.14 c # belongs reading time to solving time?
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c timing/reading = TRUE
1.10/1.14 c
1.10/1.14 c # should presolving try to simplify inequalities
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c constraints/linear/simplifyinequalities = TRUE
1.10/1.14 c
1.10/1.14 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c constraints/indicator/addCouplingCons = TRUE
1.10/1.14 c
1.10/1.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.10/1.14 c constraints/knapsack/disaggregation = FALSE
1.10/1.14 c
1.10/1.14 c # should presolving try to simplify knapsacks
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c constraints/knapsack/simplifyinequalities = TRUE
1.10/1.14 c
1.10/1.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c presolving/probing/maxrounds = 0
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/coefdiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/coefdiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/coefdiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 30]
1.10/1.14 c heuristics/crossover/freq = -1
1.10/1.14 c
1.10/1.14 c # number of nodes added to the contingent of the total nodes
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.14 c heuristics/crossover/nodesofs = 750
1.10/1.14 c
1.10/1.14 c # number of nodes without incumbent change that heuristic should wait
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.10/1.14 c heuristics/crossover/nwaitingnodes = 100
1.10/1.14 c
1.10/1.14 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.10/1.14 c # [type: real, range: [0,1], default: 0.1]
1.10/1.14 c heuristics/crossover/nodesquot = 0.15
1.10/1.14 c
1.10/1.14 c # minimum percentage of integer variables that have to be fixed
1.10/1.14 c # [type: real, range: [0,1], default: 0.666]
1.10/1.14 c heuristics/crossover/minfixingrate = 0.5
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/feaspump/freq = -1
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/feaspump/maxlpiterofs = 2000
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/fracdiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/fracdiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/fracdiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/guideddiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/guideddiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/guideddiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/intdiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/intshifting/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/linesearchdiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/objpscostdiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to total iteration number
1.10/1.14 c # [type: real, range: [0,1], default: 0.01]
1.10/1.14 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/oneopt/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/pscostdiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/pscostdiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c heuristics/rens/freq = -1
1.10/1.14 c
1.10/1.14 c # minimum percentage of integer variables that have to be fixable
1.10/1.14 c # [type: real, range: [0,1], default: 0.5]
1.10/1.14 c heuristics/rens/minfixingrate = 0.3
1.10/1.14 c
1.10/1.14 c # number of nodes added to the contingent of the total nodes
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.14 c heuristics/rens/nodesofs = 2000
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/rootsoldiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.10/1.14 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/rounding/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c heuristics/shiftandpropagate/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/shifting/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/simplerounding/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/subnlp/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c heuristics/trivial/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/trysol/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c heuristics/undercover/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/veclendiving/freq = -1
1.10/1.14 c
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/veclendiving/maxlpiterquot = 0.075
1.10/1.14 c
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/veclendiving/maxlpiterofs = 1500
1.10/1.14 c
1.10/1.14 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/zirounding/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c separating/cmir/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c separating/flowcover/freq = -1
1.10/1.14 c
1.10/1.14 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c separating/rapidlearning/freq = 0
1.10/1.14 c
1.10/1.14 c -----------------------------------------------------------------------------------------------
1.10/1.14 c start solving
1.10/1.14 c
3.98/4.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.98/4.01 c 4.0s| 1 | 0 | 9748 | - | 50M| 0 |1194 |3058 |7998 |3058 |7977 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
9.29/9.30 c 9.3s| 1 | 0 | 16162 | - | 51M| 0 | - |3058 |8745 |3058 |8049 | 94 | 0 | 0 | cutoff | -- | 0.00%
9.29/9.30 c 9.3s| 1 | 0 | 16162 | - | 51M| 0 | - |3058 |8745 |3058 |8049 | 94 | 0 | 0 | cutoff | -- | 0.00%
9.29/9.30 c
9.29/9.30 c SCIP Status : problem is solved [infeasible]
9.29/9.30 c Solving Time (sec) : 9.30
9.29/9.30 c Solving Nodes : 1
9.29/9.30 c Primal Bound : +1.00000000000000e+20 (0 solutions)
9.29/9.30 c Dual Bound : +1.00000000000000e+20
9.29/9.30 c Gap : 0.00 %
9.29/9.30 s UNSATISFIABLE
9.29/9.30 c SCIP Status : problem is solved [infeasible]
9.29/9.30 c Total Time : 9.30
9.29/9.30 c solving : 9.30
9.29/9.30 c presolving : 0.90 (included in solving)
9.29/9.30 c reading : 0.20 (included in solving)
9.29/9.30 c Original Problem :
9.29/9.30 c Problem name : HOME/instance-3451721-1307116673.opb
9.29/9.30 c Variables : 9638 (9638 binary, 0 integer, 0 implicit integer, 0 continuous)
9.29/9.30 c Constraints : 30220 initial, 30220 maximal
9.29/9.30 c Presolved Problem :
9.29/9.30 c Problem name : t_HOME/instance-3451721-1307116673.opb
9.29/9.30 c Variables : 3058 (3058 binary, 0 integer, 0 implicit integer, 0 continuous)
9.29/9.30 c Constraints : 7998 initial, 8768 maximal
9.29/9.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
9.29/9.30 c trivial : 0.00 329 0 0 0 0 0 0 0 0
9.29/9.30 c dualfix : 0.01 57 0 0 0 0 0 0 0 0
9.29/9.30 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
9.29/9.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
9.29/9.30 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
9.29/9.30 c implics : 0.01 0 21 0 0 0 0 0 0 0
9.29/9.30 c probing : 0.00 0 0 0 0 0 0 0 0 0
9.29/9.30 c knapsack : 0.03 0 0 0 2 0 0 0 11 94
9.29/9.30 c setppc : 0.01 10 0 0 4 0 106 0 0 0
9.29/9.30 c linear : 0.78 4603 1560 0 4920 0 22115 0 51 33
9.29/9.30 c logicor : 0.02 0 0 0 6 0 1 0 0 0
9.29/9.30 c root node : - 3 - - 3 - - - - -
9.29/9.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
9.29/9.30 c integral : 0 0 0 0 0 1 0 0 0 0 0 0
9.29/9.30 c knapsack : 261 2 2 0 0 0 0 0 0 362 0 0
9.29/9.30 c setppc : 6346 2 2 0 0 0 0 0 0 0 0 0
9.29/9.30 c linear : 0+ 1 1 0 0 0 0 0 0 1 0 0
9.29/9.30 c logicor : 1391 2 1 0 0 0 0 0 0 0 0 0
9.29/9.30 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
9.29/9.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
9.29/9.30 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.29/9.30 c Propagators : #Propagate #Resprop Cutoffs DomReds
9.29/9.30 c vbounds : 0 0 0 0
9.29/9.30 c rootredcost : 0 0 0 0
9.29/9.30 c pseudoobj : 0 0 0 0
9.29/9.30 c Propagator Timings : TotalTime Propagate Resprop
9.29/9.30 c vbounds : 0.00 0.00 0.00
9.29/9.30 c rootredcost : 0.00 0.00 0.00
9.29/9.30 c pseudoobj : 0.00 0.00 0.00
9.29/9.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.29/9.30 c propagation : 0.00 0 0 0 0.0 0 0.0 -
9.29/9.30 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.29/9.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.29/9.30 c applied globally : - - - 0 0.0 - - -
9.29/9.30 c applied locally : - - - 0 0.0 - - -
9.29/9.30 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.29/9.30 c cut pool : 0.00 0 - - 0 - (maximal pool size: 27)
9.29/9.30 c redcost : 0.00 1 0 0 0 0
9.29/9.30 c impliedbounds : 0.00 1 0 0 34 0
9.29/9.30 c intobj : 0.00 0 0 0 0 0
9.29/9.30 c gomory : 0.78 1 0 0 0 0
9.29/9.30 c cgmip : 0.00 0 0 0 0 0
9.29/9.30 c closecuts : 0.00 0 0 0 0 0
9.29/9.30 c strongcg : 0.80 1 0 0 0 0
9.29/9.30 c cmir : 0.00 0 0 0 0 0
9.29/9.30 c flowcover : 0.00 0 0 0 0 0
9.29/9.30 c clique : 0.11 1 0 0 7 0
9.29/9.30 c zerohalf : 0.00 0 0 0 0 0
9.29/9.30 c mcf : 0.01 1 0 0 0 0
9.29/9.30 c oddcycle : 0.00 0 0 0 0 0
9.29/9.30 c rapidlearning : 0.87 1 0 3 0 770
9.29/9.30 c Pricers : Time Calls Vars
9.29/9.30 c problem variables: 0.00 0 0
9.29/9.30 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.29/9.30 c pscost : 0.00 0 0 0 0 0 0
9.29/9.30 c inference : 0.00 0 0 0 0 0 0
9.29/9.30 c mostinf : 0.00 0 0 0 0 0 0
9.29/9.30 c leastinf : 0.00 0 0 0 0 0 0
9.29/9.30 c fullstrong : 0.00 0 0 0 0 0 0
9.29/9.30 c allfullstrong : 0.00 0 0 0 0 0 0
9.29/9.30 c random : 0.00 0 0 0 0 0 0
9.29/9.30 c relpscost : 0.00 0 0 0 0 0 0
9.29/9.30 c Primal Heuristics : Time Calls Found
9.29/9.30 c LP solutions : 0.00 - 0
9.29/9.30 c pseudo solutions : 0.00 - 0
9.29/9.30 c trivial : 0.01 1 0
9.29/9.30 c shiftandpropagate: 0.00 0 0
9.29/9.30 c simplerounding : 0.00 0 0
9.29/9.30 c zirounding : 0.00 0 0
9.29/9.30 c rounding : 0.00 0 0
9.29/9.30 c shifting : 0.00 0 0
9.29/9.30 c intshifting : 0.00 0 0
9.29/9.30 c oneopt : 0.00 0 0
9.29/9.30 c twoopt : 0.00 0 0
9.29/9.30 c fixandinfer : 0.00 0 0
9.29/9.30 c feaspump : 0.00 0 0
9.29/9.30 c clique : 0.00 0 0
9.29/9.30 c coefdiving : 0.00 0 0
9.29/9.30 c pscostdiving : 0.00 0 0
9.29/9.30 c fracdiving : 0.00 0 0
9.29/9.30 c veclendiving : 0.00 0 0
9.29/9.30 c intdiving : 0.00 0 0
9.29/9.30 c actconsdiving : 0.00 0 0
9.29/9.30 c objpscostdiving : 0.00 0 0
9.29/9.30 c rootsoldiving : 0.00 0 0
9.29/9.30 c linesearchdiving : 0.00 0 0
9.29/9.30 c guideddiving : 0.00 0 0
9.29/9.30 c octane : 0.00 0 0
9.29/9.30 c rens : 0.00 0 0
9.29/9.30 c rins : 0.00 0 0
9.29/9.30 c localbranching : 0.00 0 0
9.29/9.30 c mutation : 0.00 0 0
9.29/9.30 c crossover : 0.00 0 0
9.29/9.30 c dins : 0.00 0 0
9.29/9.30 c vbounds : 0.00 0 0
9.29/9.30 c undercover : 0.00 0 0
9.29/9.30 c subnlp : 0.00 0 0
9.29/9.30 c trysol : 0.00 0 0
9.29/9.30 c LP : Time Calls Iterations Iter/call Iter/sec
9.29/9.30 c primal LP : 0.00 0 0 0.00 -
9.29/9.30 c dual LP : 5.56 2 16162 8081.00 2909.38
9.29/9.30 c lex dual LP : 0.00 0 0 0.00 -
9.29/9.30 c barrier LP : 0.00 0 0 0.00 -
9.29/9.30 c diving/probing LP: 0.00 0 0 0.00 -
9.29/9.30 c strong branching : 0.00 0 0 0.00 -
9.29/9.30 c (at root node) : - 0 0 0.00 -
9.29/9.30 c conflict analysis: 0.00 0 0 0.00 -
9.29/9.30 c B&B Tree :
9.29/9.30 c number of runs : 1
9.29/9.30 c nodes : 1
9.29/9.30 c nodes (total) : 1
9.29/9.30 c nodes left : 0
9.29/9.30 c max depth : 0
9.29/9.30 c max depth (total): 0
9.29/9.30 c backtracks : 0 (0.0%)
9.29/9.30 c delayed cutoffs : 0
9.29/9.30 c repropagations : 0 (0 domain reductions, 0 cutoffs)
9.29/9.30 c avg switch length: 2.00
9.29/9.30 c switching time : 0.00
9.29/9.30 c Solution :
9.29/9.30 c Solutions found : 0 (0 improvements)
9.29/9.30 c Primal Bound : infeasible
9.29/9.30 c Dual Bound : -
9.29/9.30 c Gap : 0.00 %
9.29/9.30 c Root Dual Bound : -
9.29/9.30 c Root Iterations : 16162
9.29/9.35 c Time complete: 9.34.