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-3739660-1338736532.opb>
0.38/0.47 c original problem has 24684 variables (24684 bin, 0 int, 0 impl, 0 cont) and 81656 constraints
0.38/0.47 c problem read
0.38/0.47 c No objective function, only one solution is needed.
0.38/0.47 c presolving settings loaded
0.59/0.67 c presolving:
2.89/2.94 c (round 1) 5837 del vars, 16179 del conss, 0 add conss, 4321 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4875508 impls, 0 clqs
3.69/3.74 c (round 2) 12194 del vars, 41995 del conss, 0 add conss, 10137 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4917601 impls, 0 clqs
3.79/3.89 c (round 3) 14858 del vars, 52577 del conss, 0 add conss, 11900 chg bounds, 28 chg sides, 30 chg coeffs, 0 upgd conss, 4934117 impls, 0 clqs
3.89/3.96 c (round 4) 16042 del vars, 56828 del conss, 0 add conss, 12777 chg bounds, 66 chg sides, 86 chg coeffs, 0 upgd conss, 4944901 impls, 0 clqs
3.99/4.02 c (round 5) 17350 del vars, 60734 del conss, 0 add conss, 13728 chg bounds, 80 chg sides, 107 chg coeffs, 0 upgd conss, 4958508 impls, 0 clqs
3.99/4.06 c (round 6) 17968 del vars, 63015 del conss, 0 add conss, 14154 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4964062 impls, 0 clqs
3.99/4.08 c (round 7) 18272 del vars, 64171 del conss, 0 add conss, 14349 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4967243 impls, 0 clqs
4.09/4.10 c (round 8) 18457 del vars, 64909 del conss, 0 add conss, 14469 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4969390 impls, 0 clqs
4.09/4.11 c (round 9) 18568 del vars, 65380 del conss, 0 add conss, 14541 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970626 impls, 0 clqs
4.09/4.12 c (round 10) 18604 del vars, 65568 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970900 impls, 0 clqs
4.09/4.13 c (round 11) 18605 del vars, 65585 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970910 impls, 0 clqs
4.18/4.21 c (round 12) 18605 del vars, 65586 del conss, 0 add conss, 14563 chg bounds, 87 chg sides, 113 chg coeffs, 16070 upgd conss, 4970910 impls, 0 clqs
4.30/4.32 c (round 13) 18605 del vars, 65586 del conss, 0 add conss, 14563 chg bounds, 129 chg sides, 203 chg coeffs, 16070 upgd conss, 4970910 impls, 0 clqs
4.30/4.35 c presolving (14 rounds):
4.30/4.35 c 18605 deleted vars, 65586 deleted constraints, 0 added constraints, 14563 tightened bounds, 0 added holes, 129 changed sides, 226 changed coefficients
4.30/4.35 c 4970910 implications, 2 cliques
4.30/4.35 c presolved problem has 6079 variables (6079 bin, 0 int, 0 impl, 0 cont) and 16070 constraints
4.30/4.35 c 340 constraints of type <knapsack>
4.30/4.35 c 13021 constraints of type <setppc>
4.30/4.35 c 2709 constraints of type <logicor>
4.30/4.35 c transformed objective value is always integral (scale: 1)
4.30/4.35 c Presolving Time: 3.74
4.30/4.35 c - non default parameters ----------------------------------------------------------------------
4.30/4.35 c # SCIP version 2.0.1.5
4.30/4.35 c
4.30/4.35 c # frequency for displaying node information lines
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 100]
4.30/4.35 c display/freq = 10000
4.30/4.35 c
4.30/4.35 c # maximal time in seconds to run
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.30/4.35 c limits/time = 1797
4.30/4.35 c
4.30/4.35 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.30/4.35 c limits/memory = 13950
4.30/4.35 c
4.30/4.35 c # solving stops, if the given number of solutions were found (-1: no limit)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.35 c limits/solutions = 1
4.30/4.35 c
4.30/4.35 c # maximal number of separation rounds per node (-1: unlimited)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 5]
4.30/4.35 c separating/maxrounds = 1
4.30/4.35 c
4.30/4.35 c # maximal number of separation rounds in the root node (-1: unlimited)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.35 c separating/maxroundsroot = 5
4.30/4.35 c
4.30/4.35 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.30/4.35 c # [type: int, range: [1,2], default: 1]
4.30/4.35 c timing/clocktype = 2
4.30/4.35 c
4.30/4.35 c # belongs reading time to solving time?
4.30/4.35 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.35 c timing/reading = TRUE
4.30/4.35 c
4.30/4.35 c # should presolving try to simplify inequalities
4.30/4.35 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.35 c constraints/linear/simplifyinequalities = TRUE
4.30/4.35 c
4.30/4.35 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.30/4.35 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.35 c constraints/indicator/addCouplingCons = TRUE
4.30/4.35 c
4.30/4.35 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.30/4.35 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.30/4.35 c constraints/knapsack/disaggregation = FALSE
4.30/4.35 c
4.30/4.35 c # should presolving try to simplify knapsacks
4.30/4.35 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.35 c constraints/knapsack/simplifyinequalities = TRUE
4.30/4.35 c
4.30/4.35 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.35 c presolving/probing/maxrounds = 0
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/coefdiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/coefdiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/coefdiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 30]
4.30/4.35 c heuristics/crossover/freq = -1
4.30/4.35 c
4.30/4.35 c # number of nodes added to the contingent of the total nodes
4.30/4.35 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.30/4.35 c heuristics/crossover/nodesofs = 750
4.30/4.35 c
4.30/4.35 c # number of nodes without incumbent change that heuristic should wait
4.30/4.35 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.30/4.35 c heuristics/crossover/nwaitingnodes = 100
4.30/4.35 c
4.30/4.35 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.30/4.35 c # [type: real, range: [0,1], default: 0.1]
4.30/4.35 c heuristics/crossover/nodesquot = 0.15
4.30/4.35 c
4.30/4.35 c # minimum percentage of integer variables that have to be fixed
4.30/4.35 c # [type: real, range: [0,1], default: 0.666]
4.30/4.35 c heuristics/crossover/minfixingrate = 0.5
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.35 c heuristics/feaspump/freq = -1
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/feaspump/maxlpiterofs = 2000
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/fracdiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/fracdiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/fracdiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/guideddiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/guideddiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/guideddiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/intdiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/intshifting/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/linesearchdiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.35 c heuristics/objpscostdiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to total iteration number
4.30/4.35 c # [type: real, range: [0,1], default: 0.01]
4.30/4.35 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/oneopt/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/pscostdiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/pscostdiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c heuristics/rens/freq = -1
4.30/4.35 c
4.30/4.35 c # minimum percentage of integer variables that have to be fixable
4.30/4.35 c # [type: real, range: [0,1], default: 0.5]
4.30/4.35 c heuristics/rens/minfixingrate = 0.3
4.30/4.35 c
4.30/4.35 c # number of nodes added to the contingent of the total nodes
4.30/4.35 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.30/4.35 c heuristics/rens/nodesofs = 2000
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.35 c heuristics/rootsoldiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.30/4.35 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/rounding/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c heuristics/shiftandpropagate/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/shifting/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/simplerounding/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/subnlp/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c heuristics/trivial/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/trysol/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c heuristics/undercover/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.35 c heuristics/veclendiving/freq = -1
4.30/4.35 c
4.30/4.35 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.35 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.35 c heuristics/veclendiving/maxlpiterquot = 0.075
4.30/4.35 c
4.30/4.35 c # additional number of allowed LP iterations
4.30/4.35 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.35 c heuristics/veclendiving/maxlpiterofs = 1500
4.30/4.35 c
4.30/4.35 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.35 c heuristics/zirounding/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c separating/cmir/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.35 c separating/flowcover/freq = -1
4.30/4.35 c
4.30/4.35 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.30/4.35 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.35 c separating/rapidlearning/freq = 0
4.30/4.35 c
4.30/4.35 c -----------------------------------------------------------------------------------------------
4.30/4.35 c start solving
4.30/4.35 c
17.38/17.48 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
17.38/17.48 c 17.5s| 1 | 0 | 15724 | - | 122M| 0 | - |6079 | 16k|6079 | 16k| 0 | 0 | 0 | cutoff | -- | 0.00%
17.38/17.48 c 17.5s| 1 | 0 | 15724 | - | 122M| 0 | - |6079 | 16k|6079 | 16k| 0 | 0 | 0 | cutoff | -- | 0.00%
17.38/17.48 c
17.38/17.48 c SCIP Status : problem is solved [infeasible]
17.38/17.48 c Solving Time (sec) : 17.48
17.38/17.48 c Solving Nodes : 1
17.38/17.48 c Primal Bound : +1.00000000000000e+20 (0 solutions)
17.38/17.48 c Dual Bound : +1.00000000000000e+20
17.38/17.48 c Gap : 0.00 %
17.38/17.48 s UNSATISFIABLE
17.38/17.48 c SCIP Status : problem is solved [infeasible]
17.38/17.48 c Total Time : 17.48
17.38/17.48 c solving : 17.48
17.38/17.48 c presolving : 3.74 (included in solving)
17.38/17.48 c reading : 0.47 (included in solving)
17.38/17.48 c Original Problem :
17.38/17.48 c Problem name : HOME/instance-3739660-1338736532.opb
17.38/17.48 c Variables : 24684 (24684 binary, 0 integer, 0 implicit integer, 0 continuous)
17.38/17.48 c Constraints : 81656 initial, 81656 maximal
17.38/17.48 c Presolved Problem :
17.38/17.48 c Problem name : t_HOME/instance-3739660-1338736532.opb
17.38/17.48 c Variables : 6079 (6079 binary, 0 integer, 0 implicit integer, 0 continuous)
17.38/17.48 c Constraints : 16070 initial, 16070 maximal
17.38/17.48 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
17.38/17.48 c trivial : 0.01 653 0 0 0 0 0 0 0 0
17.38/17.48 c dualfix : 0.03 120 0 0 0 0 0 0 0 0
17.38/17.48 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
17.38/17.48 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
17.38/17.48 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
17.38/17.48 c implics : 0.04 0 0 0 0 0 0 0 0 0
17.38/17.48 c probing : 0.00 0 0 0 0 0 0 0 0 0
17.38/17.48 c knapsack : 0.09 0 0 0 0 0 0 0 42 113
17.38/17.48 c setppc : 0.03 0 0 0 0 0 0 0 0 0
17.38/17.48 c linear : 3.38 13910 3922 0 14563 0 65586 0 87 113
17.38/17.48 c logicor : 0.02 0 0 0 0 0 0 0 0 0
17.38/17.48 c root node : - 0 - - 0 - - - - -
17.38/17.48 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
17.38/17.48 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
17.38/17.48 c knapsack : 340 0 1 0 0 0 0 0 0 0 0 0
17.38/17.48 c setppc : 13021 0 1 0 0 0 0 0 0 0 0 0
17.38/17.48 c logicor : 2709 0 1 0 0 0 0 0 0 0 0 0
17.38/17.48 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
17.38/17.48 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
17.38/17.48 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
17.38/17.48 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
17.38/17.48 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
17.38/17.48 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
17.38/17.48 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
17.38/17.48 c Propagators : #Propagate #Resprop Cutoffs DomReds
17.38/17.48 c vbounds : 0 0 0 0
17.38/17.48 c rootredcost : 0 0 0 0
17.38/17.48 c pseudoobj : 0 0 0 0
17.38/17.48 c Propagator Timings : TotalTime Propagate Resprop
17.38/17.48 c vbounds : 0.00 0.00 0.00
17.38/17.48 c rootredcost : 0.00 0.00 0.00
17.38/17.48 c pseudoobj : 0.00 0.00 0.00
17.38/17.48 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
17.38/17.48 c propagation : 0.00 0 0 0 0.0 0 0.0 -
17.38/17.48 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
17.38/17.48 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
17.38/17.48 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
17.38/17.48 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
17.38/17.48 c applied globally : - - - 0 0.0 - - -
17.38/17.48 c applied locally : - - - 0 0.0 - - -
17.38/17.48 c Separators : Time Calls Cutoffs DomReds Cuts Conss
17.38/17.48 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
17.38/17.48 c redcost : 0.00 0 0 0 0 0
17.38/17.48 c impliedbounds : 0.00 0 0 0 0 0
17.38/17.48 c intobj : 0.00 0 0 0 0 0
17.38/17.48 c gomory : 0.00 0 0 0 0 0
17.38/17.48 c cgmip : 0.00 0 0 0 0 0
17.38/17.48 c closecuts : 0.00 0 0 0 0 0
17.38/17.48 c strongcg : 0.00 0 0 0 0 0
17.38/17.48 c cmir : 0.00 0 0 0 0 0
17.38/17.48 c flowcover : 0.00 0 0 0 0 0
17.38/17.48 c clique : 0.00 0 0 0 0 0
17.38/17.48 c zerohalf : 0.00 0 0 0 0 0
17.38/17.48 c mcf : 0.00 0 0 0 0 0
17.38/17.48 c oddcycle : 0.00 0 0 0 0 0
17.38/17.48 c rapidlearning : 0.00 0 0 0 0 0
17.38/17.48 c Pricers : Time Calls Vars
17.38/17.48 c problem variables: 0.00 0 0
17.38/17.48 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
17.38/17.48 c pscost : 0.00 0 0 0 0 0 0
17.38/17.48 c inference : 0.00 0 0 0 0 0 0
17.38/17.48 c mostinf : 0.00 0 0 0 0 0 0
17.38/17.48 c leastinf : 0.00 0 0 0 0 0 0
17.38/17.48 c fullstrong : 0.00 0 0 0 0 0 0
17.38/17.48 c allfullstrong : 0.00 0 0 0 0 0 0
17.38/17.48 c random : 0.00 0 0 0 0 0 0
17.38/17.48 c relpscost : 0.00 0 0 0 0 0 0
17.38/17.48 c Primal Heuristics : Time Calls Found
17.38/17.48 c LP solutions : 0.00 - 0
17.38/17.48 c pseudo solutions : 0.00 - 0
17.38/17.48 c trivial : 0.02 1 0
17.38/17.48 c shiftandpropagate: 0.00 0 0
17.38/17.48 c simplerounding : 0.00 0 0
17.38/17.48 c zirounding : 0.00 0 0
17.38/17.48 c rounding : 0.00 0 0
17.38/17.48 c shifting : 0.00 0 0
17.38/17.48 c intshifting : 0.00 0 0
17.38/17.48 c oneopt : 0.00 0 0
17.38/17.48 c twoopt : 0.00 0 0
17.38/17.48 c fixandinfer : 0.00 0 0
17.38/17.48 c feaspump : 0.00 0 0
17.38/17.48 c clique : 0.00 0 0
17.38/17.48 c coefdiving : 0.00 0 0
17.38/17.48 c pscostdiving : 0.00 0 0
17.38/17.48 c fracdiving : 0.00 0 0
17.38/17.48 c veclendiving : 0.00 0 0
17.38/17.48 c intdiving : 0.00 0 0
17.38/17.48 c actconsdiving : 0.00 0 0
17.38/17.48 c objpscostdiving : 0.00 0 0
17.38/17.48 c rootsoldiving : 0.00 0 0
17.38/17.48 c linesearchdiving : 0.00 0 0
17.38/17.48 c guideddiving : 0.00 0 0
17.38/17.48 c octane : 0.00 0 0
17.38/17.48 c rens : 0.00 0 0
17.38/17.48 c rins : 0.00 0 0
17.38/17.48 c localbranching : 0.00 0 0
17.38/17.48 c mutation : 0.00 0 0
17.38/17.48 c crossover : 0.00 0 0
17.38/17.48 c dins : 0.00 0 0
17.38/17.48 c vbounds : 0.00 0 0
17.38/17.48 c undercover : 0.00 0 0
17.38/17.48 c subnlp : 0.00 0 0
17.38/17.48 c trysol : 0.00 0 0
17.38/17.48 c LP : Time Calls Iterations Iter/call Iter/sec
17.38/17.48 c primal LP : 0.00 0 0 0.00 -
17.38/17.48 c dual LP : 13.09 1 15724 15724.00 1201.54
17.38/17.48 c lex dual LP : 0.00 0 0 0.00 -
17.38/17.48 c barrier LP : 0.00 0 0 0.00 -
17.38/17.48 c diving/probing LP: 0.00 0 0 0.00 -
17.38/17.48 c strong branching : 0.00 0 0 0.00 -
17.38/17.48 c (at root node) : - 0 0 0.00 -
17.38/17.48 c conflict analysis: 0.00 0 0 0.00 -
17.38/17.48 c B&B Tree :
17.38/17.48 c number of runs : 1
17.38/17.48 c nodes : 1
17.38/17.48 c nodes (total) : 1
17.38/17.48 c nodes left : 0
17.38/17.48 c max depth : 0
17.38/17.48 c max depth (total): 0
17.38/17.48 c backtracks : 0 (0.0%)
17.38/17.48 c delayed cutoffs : 0
17.38/17.48 c repropagations : 0 (0 domain reductions, 0 cutoffs)
17.38/17.48 c avg switch length: 2.00
17.38/17.48 c switching time : 0.00
17.38/17.48 c Solution :
17.38/17.48 c Solutions found : 0 (0 improvements)
17.38/17.48 c Primal Bound : infeasible
17.38/17.48 c Dual Bound : -
17.38/17.48 c Gap : 0.00 %
17.38/17.48 c Root Dual Bound : -
17.38/17.48 c Root Iterations : 15724
17.59/17.63 c Time complete: 17.62.