0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3489628-1307791407.opb>
0.19/0.22 c original problem has 12322 variables (12322 bin, 0 int, 0 impl, 0 cont) and 38967 constraints
0.19/0.22 c problem read
0.19/0.22 c No objective function, only one solution is needed.
0.19/0.22 c presolving settings loaded
0.19/0.29 c presolving:
1.19/1.28 c (round 1) 1928 del vars, 5359 del conss, 0 add conss, 1269 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2408864 impls, 0 clqs
1.59/1.67 c (round 2) 4896 del vars, 15276 del conss, 0 add conss, 4027 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2423259 impls, 0 clqs
1.69/1.74 c (round 3) 5906 del vars, 20188 del conss, 0 add conss, 4614 chg bounds, 13 chg sides, 17 chg coeffs, 0 upgd conss, 2427306 impls, 0 clqs
1.69/1.76 c (round 4) 6135 del vars, 21424 del conss, 0 add conss, 4756 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2429143 impls, 0 clqs
1.69/1.77 c (round 5) 6238 del vars, 21835 del conss, 0 add conss, 4809 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430144 impls, 0 clqs
1.69/1.78 c (round 6) 6315 del vars, 22114 del conss, 0 add conss, 4858 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430630 impls, 0 clqs
1.69/1.79 c (round 7) 6346 del vars, 22238 del conss, 0 add conss, 4872 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2430921 impls, 0 clqs
1.69/1.79 c (round 8) 6353 del vars, 22278 del conss, 0 add conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2431034 impls, 0 clqs
1.79/1.80 c (round 9) 6353 del vars, 22281 del conss, 0 add conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 0 upgd conss, 2431034 impls, 0 clqs
1.79/1.86 c (round 10) 6353 del vars, 22283 del conss, 0 add conss, 4874 chg bounds, 19 chg sides, 23 chg coeffs, 16684 upgd conss, 2431034 impls, 0 clqs
1.89/1.95 c presolving (11 rounds):
1.89/1.95 c 6353 deleted vars, 22283 deleted constraints, 0 added constraints, 4874 tightened bounds, 0 added holes, 19 changed sides, 58 changed coefficients
1.89/1.95 c 2431120 implications, 105 cliques
1.89/1.95 c presolved problem has 5969 variables (5969 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
1.89/1.95 c 368 constraints of type <knapsack>
1.89/1.95 c 13486 constraints of type <setppc>
1.89/1.95 c 2830 constraints of type <logicor>
1.89/1.95 c transformed objective value is always integral (scale: 1)
1.89/1.95 c Presolving Time: 1.68
1.89/1.95 c - non default parameters ----------------------------------------------------------------------
1.89/1.95 c # SCIP version 2.0.1.5
1.89/1.95 c
1.89/1.95 c # frequency for displaying node information lines
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 100]
1.89/1.95 c display/freq = 10000
1.89/1.95 c
1.89/1.95 c # maximal time in seconds to run
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.95 c limits/time = 1797
1.89/1.95 c
1.89/1.95 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.95 c limits/memory = 13950
1.89/1.95 c
1.89/1.95 c # solving stops, if the given number of solutions were found (-1: no limit)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.95 c limits/solutions = 1
1.89/1.95 c
1.89/1.95 c # maximal number of separation rounds per node (-1: unlimited)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 5]
1.89/1.95 c separating/maxrounds = 1
1.89/1.95 c
1.89/1.95 c # maximal number of separation rounds in the root node (-1: unlimited)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.95 c separating/maxroundsroot = 5
1.89/1.95 c
1.89/1.95 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.89/1.95 c # [type: int, range: [1,2], default: 1]
1.89/1.95 c timing/clocktype = 2
1.89/1.95 c
1.89/1.95 c # belongs reading time to solving time?
1.89/1.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.95 c timing/reading = TRUE
1.89/1.95 c
1.89/1.95 c # should presolving try to simplify inequalities
1.89/1.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.95 c constraints/linear/simplifyinequalities = TRUE
1.89/1.95 c
1.89/1.95 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.89/1.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.95 c constraints/indicator/addCouplingCons = TRUE
1.89/1.95 c
1.89/1.95 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.89/1.95 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.89/1.95 c constraints/knapsack/disaggregation = FALSE
1.89/1.95 c
1.89/1.95 c # should presolving try to simplify knapsacks
1.89/1.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.95 c constraints/knapsack/simplifyinequalities = TRUE
1.89/1.95 c
1.89/1.95 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.95 c presolving/probing/maxrounds = 0
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/coefdiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/coefdiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/coefdiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 30]
1.89/1.95 c heuristics/crossover/freq = -1
1.89/1.95 c
1.89/1.95 c # number of nodes added to the contingent of the total nodes
1.89/1.95 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.95 c heuristics/crossover/nodesofs = 750
1.89/1.95 c
1.89/1.95 c # number of nodes without incumbent change that heuristic should wait
1.89/1.95 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.89/1.95 c heuristics/crossover/nwaitingnodes = 100
1.89/1.95 c
1.89/1.95 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.89/1.95 c # [type: real, range: [0,1], default: 0.1]
1.89/1.95 c heuristics/crossover/nodesquot = 0.15
1.89/1.95 c
1.89/1.95 c # minimum percentage of integer variables that have to be fixed
1.89/1.95 c # [type: real, range: [0,1], default: 0.666]
1.89/1.95 c heuristics/crossover/minfixingrate = 0.5
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.95 c heuristics/feaspump/freq = -1
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/feaspump/maxlpiterofs = 2000
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/fracdiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/fracdiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/fracdiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/guideddiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/guideddiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/guideddiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/intdiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/intshifting/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/linesearchdiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.95 c heuristics/objpscostdiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to total iteration number
1.89/1.95 c # [type: real, range: [0,1], default: 0.01]
1.89/1.95 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/oneopt/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/pscostdiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/pscostdiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c heuristics/rens/freq = -1
1.89/1.95 c
1.89/1.95 c # minimum percentage of integer variables that have to be fixable
1.89/1.95 c # [type: real, range: [0,1], default: 0.5]
1.89/1.95 c heuristics/rens/minfixingrate = 0.3
1.89/1.95 c
1.89/1.95 c # number of nodes added to the contingent of the total nodes
1.89/1.95 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.95 c heuristics/rens/nodesofs = 2000
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.95 c heuristics/rootsoldiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.89/1.95 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/rounding/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c heuristics/shiftandpropagate/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/shifting/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/simplerounding/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/subnlp/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c heuristics/trivial/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/trysol/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c heuristics/undercover/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.95 c heuristics/veclendiving/freq = -1
1.89/1.95 c
1.89/1.95 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.95 c heuristics/veclendiving/maxlpiterquot = 0.075
1.89/1.95 c
1.89/1.95 c # additional number of allowed LP iterations
1.89/1.95 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.95 c heuristics/veclendiving/maxlpiterofs = 1500
1.89/1.95 c
1.89/1.95 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.95 c heuristics/zirounding/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c separating/cmir/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.95 c separating/flowcover/freq = -1
1.89/1.95 c
1.89/1.95 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.89/1.95 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.95 c separating/rapidlearning/freq = 0
1.89/1.95 c
1.89/1.95 c -----------------------------------------------------------------------------------------------
1.89/1.95 c start solving
1.89/1.95 c
14.99/15.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
14.99/15.05 c 15.0s| 1 | 0 | 16247 | - | 84M| 0 | - |5969 | 16k|5969 | 16k| 0 | 0 | 0 | cutoff | -- | 0.00%
14.99/15.05 c 15.0s| 1 | 0 | 16247 | - | 84M| 0 | - |5969 | 16k|5969 | 16k| 0 | 0 | 0 | cutoff | -- | 0.00%
14.99/15.05 c
14.99/15.05 c SCIP Status : problem is solved [infeasible]
14.99/15.05 c Solving Time (sec) : 15.05
14.99/15.05 c Solving Nodes : 1
14.99/15.05 c Primal Bound : +1.00000000000000e+20 (0 solutions)
14.99/15.05 c Dual Bound : +1.00000000000000e+20
14.99/15.05 c Gap : 0.00 %
14.99/15.05 s UNSATISFIABLE
14.99/15.05 c SCIP Status : problem is solved [infeasible]
14.99/15.05 c Total Time : 15.05
14.99/15.05 c solving : 15.05
14.99/15.05 c presolving : 1.68 (included in solving)
14.99/15.05 c reading : 0.22 (included in solving)
14.99/15.05 c Original Problem :
14.99/15.05 c Problem name : HOME/instance-3489628-1307791407.opb
14.99/15.05 c Variables : 12322 (12322 binary, 0 integer, 0 implicit integer, 0 continuous)
14.99/15.05 c Constraints : 38967 initial, 38967 maximal
14.99/15.05 c Presolved Problem :
14.99/15.05 c Problem name : t_HOME/instance-3489628-1307791407.opb
14.99/15.05 c Variables : 5969 (5969 binary, 0 integer, 0 implicit integer, 0 continuous)
14.99/15.05 c Constraints : 16684 initial, 16684 maximal
14.99/15.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
14.99/15.05 c trivial : 0.00 324 0 0 0 0 0 0 0 0
14.99/15.05 c dualfix : 0.01 53 0 0 0 0 0 0 0 0
14.99/15.05 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
14.99/15.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
14.99/15.05 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
14.99/15.05 c implics : 0.02 0 0 0 0 0 0 0 0 0
14.99/15.05 c probing : 0.00 0 0 0 0 0 0 0 0 0
14.99/15.05 c knapsack : 0.06 0 0 0 0 0 0 0 0 35
14.99/15.05 c setppc : 0.02 0 0 0 0 0 0 0 0 0
14.99/15.05 c linear : 1.50 4550 1426 0 4874 0 22283 0 19 23
14.99/15.05 c logicor : 0.01 0 0 0 0 0 0 0 0 0
14.99/15.05 c root node : - 0 - - 0 - - - - -
14.99/15.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
14.99/15.05 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
14.99/15.05 c knapsack : 368 0 1 0 0 0 0 0 0 0 0 0
14.99/15.05 c setppc : 13486 0 1 0 0 0 0 0 0 0 0 0
14.99/15.05 c logicor : 2830 0 1 0 0 0 0 0 0 0 0 0
14.99/15.05 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
14.99/15.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
14.99/15.05 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.99/15.05 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.99/15.05 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.99/15.05 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.99/15.05 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.99/15.05 c Propagators : #Propagate #Resprop Cutoffs DomReds
14.99/15.05 c vbounds : 0 0 0 0
14.99/15.05 c rootredcost : 0 0 0 0
14.99/15.05 c pseudoobj : 0 0 0 0
14.99/15.05 c Propagator Timings : TotalTime Propagate Resprop
14.99/15.05 c vbounds : 0.00 0.00 0.00
14.99/15.05 c rootredcost : 0.00 0.00 0.00
14.99/15.05 c pseudoobj : 0.00 0.00 0.00
14.99/15.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
14.99/15.05 c propagation : 0.00 0 0 0 0.0 0 0.0 -
14.99/15.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
14.99/15.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
14.99/15.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
14.99/15.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
14.99/15.05 c applied globally : - - - 0 0.0 - - -
14.99/15.05 c applied locally : - - - 0 0.0 - - -
14.99/15.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
14.99/15.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
14.99/15.05 c redcost : 0.00 0 0 0 0 0
14.99/15.05 c impliedbounds : 0.00 0 0 0 0 0
14.99/15.05 c intobj : 0.00 0 0 0 0 0
14.99/15.05 c gomory : 0.00 0 0 0 0 0
14.99/15.05 c cgmip : 0.00 0 0 0 0 0
14.99/15.05 c closecuts : 0.00 0 0 0 0 0
14.99/15.05 c strongcg : 0.00 0 0 0 0 0
14.99/15.05 c cmir : 0.00 0 0 0 0 0
14.99/15.05 c flowcover : 0.00 0 0 0 0 0
14.99/15.05 c clique : 0.00 0 0 0 0 0
14.99/15.05 c zerohalf : 0.00 0 0 0 0 0
14.99/15.05 c mcf : 0.00 0 0 0 0 0
14.99/15.05 c oddcycle : 0.00 0 0 0 0 0
14.99/15.05 c rapidlearning : 0.00 0 0 0 0 0
14.99/15.05 c Pricers : Time Calls Vars
14.99/15.05 c problem variables: 0.00 0 0
14.99/15.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
14.99/15.05 c pscost : 0.00 0 0 0 0 0 0
14.99/15.05 c inference : 0.00 0 0 0 0 0 0
14.99/15.05 c mostinf : 0.00 0 0 0 0 0 0
14.99/15.05 c leastinf : 0.00 0 0 0 0 0 0
14.99/15.05 c fullstrong : 0.00 0 0 0 0 0 0
14.99/15.05 c allfullstrong : 0.00 0 0 0 0 0 0
14.99/15.05 c random : 0.00 0 0 0 0 0 0
14.99/15.05 c relpscost : 0.00 0 0 0 0 0 0
14.99/15.05 c Primal Heuristics : Time Calls Found
14.99/15.05 c LP solutions : 0.00 - 0
14.99/15.05 c pseudo solutions : 0.00 - 0
14.99/15.05 c trivial : 0.01 1 0
14.99/15.05 c shiftandpropagate: 0.00 0 0
14.99/15.05 c simplerounding : 0.00 0 0
14.99/15.05 c zirounding : 0.00 0 0
14.99/15.05 c rounding : 0.00 0 0
14.99/15.05 c shifting : 0.00 0 0
14.99/15.05 c intshifting : 0.00 0 0
14.99/15.05 c oneopt : 0.00 0 0
14.99/15.05 c twoopt : 0.00 0 0
14.99/15.05 c fixandinfer : 0.00 0 0
14.99/15.05 c feaspump : 0.00 0 0
14.99/15.05 c clique : 0.00 0 0
14.99/15.05 c coefdiving : 0.00 0 0
14.99/15.05 c pscostdiving : 0.00 0 0
14.99/15.05 c fracdiving : 0.00 0 0
14.99/15.05 c veclendiving : 0.00 0 0
14.99/15.05 c intdiving : 0.00 0 0
14.99/15.05 c actconsdiving : 0.00 0 0
14.99/15.05 c objpscostdiving : 0.00 0 0
14.99/15.05 c rootsoldiving : 0.00 0 0
14.99/15.05 c linesearchdiving : 0.00 0 0
14.99/15.05 c guideddiving : 0.00 0 0
14.99/15.05 c octane : 0.00 0 0
14.99/15.05 c rens : 0.00 0 0
14.99/15.05 c rins : 0.00 0 0
14.99/15.05 c localbranching : 0.00 0 0
14.99/15.05 c mutation : 0.00 0 0
14.99/15.05 c crossover : 0.00 0 0
14.99/15.05 c dins : 0.00 0 0
14.99/15.05 c vbounds : 0.00 0 0
14.99/15.05 c undercover : 0.00 0 0
14.99/15.05 c subnlp : 0.00 0 0
14.99/15.05 c trysol : 0.00 0 0
14.99/15.05 c LP : Time Calls Iterations Iter/call Iter/sec
14.99/15.05 c primal LP : 0.00 0 0 0.00 -
14.99/15.05 c dual LP : 13.06 1 16247 16247.00 1243.74
14.99/15.05 c lex dual LP : 0.00 0 0 0.00 -
14.99/15.05 c barrier LP : 0.00 0 0 0.00 -
14.99/15.05 c diving/probing LP: 0.00 0 0 0.00 -
14.99/15.05 c strong branching : 0.00 0 0 0.00 -
14.99/15.05 c (at root node) : - 0 0 0.00 -
14.99/15.05 c conflict analysis: 0.00 0 0 0.00 -
14.99/15.05 c B&B Tree :
14.99/15.05 c number of runs : 1
14.99/15.05 c nodes : 1
14.99/15.05 c nodes (total) : 1
14.99/15.05 c nodes left : 0
14.99/15.05 c max depth : 0
14.99/15.05 c max depth (total): 0
14.99/15.05 c backtracks : 0 (0.0%)
14.99/15.05 c delayed cutoffs : 0
14.99/15.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
14.99/15.05 c avg switch length: 2.00
14.99/15.05 c switching time : 0.00
14.99/15.05 c Solution :
14.99/15.05 c Solutions found : 0 (0 improvements)
14.99/15.05 c Primal Bound : infeasible
14.99/15.05 c Dual Bound : -
14.99/15.05 c Gap : 0.00 %
14.99/15.05 c Root Dual Bound : -
14.99/15.05 c Root Iterations : 16247
15.09/15.12 c Time complete: 15.11.