0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3453348-1307116786.opb>
0.39/0.44 c original problem has 22022 variables (22022 bin, 0 int, 0 impl, 0 cont) and 69222 constraints
0.39/0.44 c problem read
0.39/0.44 c No objective function, only one solution is needed.
0.39/0.44 c presolving settings loaded
0.59/0.67 c presolving:
1.89/1.99 c (round 1) 4654 del vars, 14089 del conss, 0 add conss, 3062 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3965158 impls, 0 clqs
2.39/2.49 c (round 2) 12366 del vars, 37959 del conss, 0 add conss, 10471 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4005122 impls, 0 clqs
2.39/2.98 c (round 3) 14991 del vars, 49615 del conss, 0 add conss, 11840 chg bounds, 42 chg sides, 47 chg coeffs, 0 upgd conss, 4019436 impls, 0 clqs
2.39/2.98 c (round 4) 15861 del vars, 52662 del conss, 0 add conss, 12400 chg bounds, 72 chg sides, 86 chg coeffs, 0 upgd conss, 4026232 impls, 0 clqs
2.39/2.98 c (round 5) 16526 del vars, 54760 del conss, 0 add conss, 12804 chg bounds, 73 chg sides, 88 chg coeffs, 0 upgd conss, 4033138 impls, 0 clqs
2.39/2.98 c (round 6) 16793 del vars, 55812 del conss, 0 add conss, 12933 chg bounds, 84 chg sides, 106 chg coeffs, 0 upgd conss, 4035963 impls, 0 clqs
2.39/2.98 c (round 7) 16893 del vars, 56210 del conss, 0 add conss, 12983 chg bounds, 84 chg sides, 106 chg coeffs, 0 upgd conss, 4037383 impls, 0 clqs
2.39/2.98 c (round 8) 16953 del vars, 56475 del conss, 0 add conss, 13017 chg bounds, 84 chg sides, 106 chg coeffs, 0 upgd conss, 4038075 impls, 0 clqs
2.39/2.98 c (round 9) 16979 del vars, 56585 del conss, 0 add conss, 13029 chg bounds, 84 chg sides, 106 chg coeffs, 0 upgd conss, 4038361 impls, 0 clqs
2.39/2.98 c (round 10) 16995 del vars, 56641 del conss, 0 add conss, 13036 chg bounds, 89 chg sides, 112 chg coeffs, 0 upgd conss, 4038621 impls, 0 clqs
2.39/2.98 c (round 11) 17003 del vars, 56687 del conss, 0 add conss, 13039 chg bounds, 94 chg sides, 118 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 12) 17004 del vars, 56691 del conss, 0 add conss, 13039 chg bounds, 94 chg sides, 118 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 13) 17005 del vars, 56695 del conss, 0 add conss, 13039 chg bounds, 94 chg sides, 118 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 14) 17006 del vars, 56699 del conss, 0 add conss, 13039 chg bounds, 94 chg sides, 118 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 15) 17007 del vars, 56703 del conss, 0 add conss, 13039 chg bounds, 97 chg sides, 121 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 16) 17008 del vars, 56707 del conss, 0 add conss, 13039 chg bounds, 100 chg sides, 124 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 17) 17009 del vars, 56711 del conss, 0 add conss, 13039 chg bounds, 103 chg sides, 127 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 18) 17010 del vars, 56714 del conss, 0 add conss, 13039 chg bounds, 107 chg sides, 131 chg coeffs, 0 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 19) 17010 del vars, 56714 del conss, 0 add conss, 13039 chg bounds, 107 chg sides, 131 chg coeffs, 12508 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c (round 20) 17010 del vars, 56714 del conss, 0 add conss, 13039 chg bounds, 123 chg sides, 200 chg coeffs, 12508 upgd conss, 4038641 impls, 0 clqs
2.39/2.98 c presolving (21 rounds):
2.39/2.98 c 17010 deleted vars, 56714 deleted constraints, 0 added constraints, 13039 tightened bounds, 0 added holes, 123 changed sides, 216 changed coefficients
2.39/2.98 c 4038641 implications, 0 cliques
2.39/2.98 c presolved problem has 5012 variables (5012 bin, 0 int, 0 impl, 0 cont) and 12508 constraints
2.39/2.98 c 261 constraints of type <knapsack>
2.39/2.98 c 10074 constraints of type <setppc>
2.39/2.98 c 2173 constraints of type <logicor>
2.39/2.98 c transformed objective value is always integral (scale: 1)
2.39/2.98 c Presolving Time: 2.29
2.39/2.98 c - non default parameters ----------------------------------------------------------------------
2.39/2.98 c # SCIP version 2.0.1.4
2.39/2.98 c
2.39/2.98 c # frequency for displaying node information lines
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 100]
2.39/2.98 c display/freq = 10000
2.39/2.98 c
2.39/2.98 c # maximal time in seconds to run
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.39/2.98 c limits/time = 1800
2.39/2.98 c
2.39/2.98 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.39/2.98 c limits/memory = 13950
2.39/2.98 c
2.39/2.98 c # solving stops, if the given number of solutions were found (-1: no limit)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: -1]
2.39/2.98 c limits/solutions = 1
2.39/2.98 c
2.39/2.98 c # maximal number of separation rounds per node (-1: unlimited)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 5]
2.39/2.98 c separating/maxrounds = 1
2.39/2.98 c
2.39/2.98 c # maximal number of separation rounds in the root node (-1: unlimited)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: -1]
2.39/2.98 c separating/maxroundsroot = 5
2.39/2.98 c
2.39/2.98 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.39/2.98 c # [type: int, range: [1,2], default: 1]
2.39/2.98 c timing/clocktype = 2
2.39/2.98 c
2.39/2.98 c # belongs reading time to solving time?
2.39/2.98 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.39/2.98 c timing/reading = TRUE
2.39/2.98 c
2.39/2.98 c # should presolving try to simplify inequalities
2.39/2.98 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.39/2.98 c constraints/linear/simplifyinequalities = TRUE
2.39/2.98 c
2.39/2.98 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.39/2.98 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.39/2.98 c constraints/indicator/addCouplingCons = TRUE
2.39/2.98 c
2.39/2.98 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.39/2.98 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.39/2.98 c constraints/knapsack/disaggregation = FALSE
2.39/2.98 c
2.39/2.98 c # should presolving try to simplify knapsacks
2.39/2.98 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.39/2.98 c constraints/knapsack/simplifyinequalities = TRUE
2.39/2.98 c
2.39/2.98 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: -1]
2.39/2.98 c presolving/probing/maxrounds = 0
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/coefdiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/coefdiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/coefdiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 30]
2.39/2.98 c heuristics/crossover/freq = -1
2.39/2.98 c
2.39/2.98 c # number of nodes added to the contingent of the total nodes
2.39/2.98 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.39/2.98 c heuristics/crossover/nodesofs = 750
2.39/2.98 c
2.39/2.98 c # number of nodes without incumbent change that heuristic should wait
2.39/2.98 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.39/2.98 c heuristics/crossover/nwaitingnodes = 100
2.39/2.98 c
2.39/2.98 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.39/2.98 c # [type: real, range: [0,1], default: 0.1]
2.39/2.98 c heuristics/crossover/nodesquot = 0.15
2.39/2.98 c
2.39/2.98 c # minimum percentage of integer variables that have to be fixed
2.39/2.98 c # [type: real, range: [0,1], default: 0.666]
2.39/2.98 c heuristics/crossover/minfixingrate = 0.5
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 20]
2.39/2.98 c heuristics/feaspump/freq = -1
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/feaspump/maxlpiterofs = 2000
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/fracdiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/fracdiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/fracdiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/guideddiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/guideddiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/guideddiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/intdiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/intshifting/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/linesearchdiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 20]
2.39/2.98 c heuristics/objpscostdiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to total iteration number
2.39/2.98 c # [type: real, range: [0,1], default: 0.01]
2.39/2.98 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/oneopt/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/pscostdiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/pscostdiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c heuristics/rens/freq = -1
2.39/2.98 c
2.39/2.98 c # minimum percentage of integer variables that have to be fixable
2.39/2.98 c # [type: real, range: [0,1], default: 0.5]
2.39/2.98 c heuristics/rens/minfixingrate = 0.3
2.39/2.98 c
2.39/2.98 c # number of nodes added to the contingent of the total nodes
2.39/2.98 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.39/2.98 c heuristics/rens/nodesofs = 2000
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 20]
2.39/2.98 c heuristics/rootsoldiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.39/2.98 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/rounding/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c heuristics/shiftandpropagate/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/shifting/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/simplerounding/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/subnlp/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c heuristics/trivial/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/trysol/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c heuristics/undercover/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 10]
2.39/2.98 c heuristics/veclendiving/freq = -1
2.39/2.98 c
2.39/2.98 c # maximal fraction of diving LP iterations compared to node LP iterations
2.39/2.98 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.39/2.98 c heuristics/veclendiving/maxlpiterquot = 0.075
2.39/2.98 c
2.39/2.98 c # additional number of allowed LP iterations
2.39/2.98 c # [type: int, range: [0,2147483647], default: 1000]
2.39/2.98 c heuristics/veclendiving/maxlpiterofs = 1500
2.39/2.98 c
2.39/2.98 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 1]
2.39/2.98 c heuristics/zirounding/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c separating/cmir/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: 0]
2.39/2.98 c separating/flowcover/freq = -1
2.39/2.98 c
2.39/2.98 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.39/2.98 c # [type: int, range: [-1,2147483647], default: -1]
2.39/2.98 c separating/rapidlearning/freq = 0
2.39/2.98 c
2.39/2.98 c -----------------------------------------------------------------------------------------------
2.39/2.98 c start solving
2.39/2.98 c
9.99/10.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
9.99/10.08 c 10.1s| 1 | 0 | 13009 | - | 95M| 0 | - |5012 | 12k|5012 | 12k| 0 | 0 | 0 | cutoff | -- | 0.00%
9.99/10.08 c 10.1s| 1 | 0 | 13009 | - | 95M| 0 | - |5012 | 12k|5012 | 12k| 0 | 0 | 0 | cutoff | -- | 0.00%
9.99/10.08 c
9.99/10.08 c SCIP Status : problem is solved [infeasible]
9.99/10.08 c Solving Time (sec) : 10.08
9.99/10.08 c Solving Nodes : 1
9.99/10.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
9.99/10.08 c Dual Bound : +1.00000000000000e+20
9.99/10.08 c Gap : 0.00 %
9.99/10.08 s UNSATISFIABLE
9.99/10.08 c SCIP Status : problem is solved [infeasible]
9.99/10.08 c Total Time : 10.08
9.99/10.08 c solving : 10.08
9.99/10.08 c presolving : 2.29 (included in solving)
9.99/10.08 c reading : 0.44 (included in solving)
9.99/10.08 c Original Problem :
9.99/10.08 c Problem name : HOME/instance-3453348-1307116786.opb
9.99/10.08 c Variables : 22022 (22022 binary, 0 integer, 0 implicit integer, 0 continuous)
9.99/10.08 c Constraints : 69222 initial, 69222 maximal
9.99/10.08 c Presolved Problem :
9.99/10.08 c Problem name : t_HOME/instance-3453348-1307116786.opb
9.99/10.08 c Variables : 5012 (5012 binary, 0 integer, 0 implicit integer, 0 continuous)
9.99/10.08 c Constraints : 12508 initial, 12508 maximal
9.99/10.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
9.99/10.08 c trivial : 0.01 1044 0 0 0 0 0 0 0 0
9.99/10.08 c dualfix : 0.02 121 0 0 0 0 0 0 0 0
9.99/10.08 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
9.99/10.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
9.99/10.08 c implics : 0.03 0 0 0 0 0 0 0 0 0
9.99/10.08 c probing : 0.00 0 0 0 0 0 0 0 0 0
9.99/10.08 c knapsack : 0.03 0 0 0 0 0 0 0 16 85
9.99/10.08 c setppc : 0.02 0 0 0 0 0 0 0 0 0
9.99/10.08 c linear : 1.95 11995 3850 0 13039 0 56714 0 107 131
9.99/10.08 c logicor : 0.02 0 0 0 0 0 0 0 0 0
9.99/10.08 c root node : - 0 - - 0 - - - - -
9.99/10.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
9.99/10.08 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
9.99/10.08 c knapsack : 261 0 1 0 0 0 0 0 0 0 0 0
9.99/10.08 c setppc : 10074 0 1 0 0 0 0 0 0 0 0 0
9.99/10.08 c logicor : 2173 0 1 0 0 0 0 0 0 0 0 0
9.99/10.08 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
9.99/10.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
9.99/10.08 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.99/10.08 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.99/10.08 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.99/10.08 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.99/10.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.99/10.08 c Propagators : #Propagate #Resprop Cutoffs DomReds
9.99/10.08 c vbounds : 0 0 0 0
9.99/10.08 c rootredcost : 0 0 0 0
9.99/10.08 c pseudoobj : 0 0 0 0
9.99/10.08 c Propagator Timings : TotalTime Propagate Resprop
9.99/10.08 c vbounds : 0.00 0.00 0.00
9.99/10.08 c rootredcost : 0.00 0.00 0.00
9.99/10.08 c pseudoobj : 0.00 0.00 0.00
9.99/10.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.99/10.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
9.99/10.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.99/10.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.99/10.08 c applied globally : - - - 0 0.0 - - -
9.99/10.08 c applied locally : - - - 0 0.0 - - -
9.99/10.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.99/10.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
9.99/10.08 c redcost : 0.00 0 0 0 0 0
9.99/10.08 c impliedbounds : 0.00 0 0 0 0 0
9.99/10.08 c intobj : 0.00 0 0 0 0 0
9.99/10.08 c gomory : 0.00 0 0 0 0 0
9.99/10.08 c cgmip : 0.00 0 0 0 0 0
9.99/10.08 c closecuts : 0.00 0 0 0 0 0
9.99/10.08 c strongcg : 0.00 0 0 0 0 0
9.99/10.08 c cmir : 0.00 0 0 0 0 0
9.99/10.08 c flowcover : 0.00 0 0 0 0 0
9.99/10.08 c clique : 0.00 0 0 0 0 0
9.99/10.08 c zerohalf : 0.00 0 0 0 0 0
9.99/10.08 c mcf : 0.00 0 0 0 0 0
9.99/10.08 c oddcycle : 0.00 0 0 0 0 0
9.99/10.08 c rapidlearning : 0.00 0 0 0 0 0
9.99/10.08 c Pricers : Time Calls Vars
9.99/10.08 c problem variables: 0.00 0 0
9.99/10.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.99/10.08 c pscost : 0.00 0 0 0 0 0 0
9.99/10.08 c inference : 0.00 0 0 0 0 0 0
9.99/10.08 c mostinf : 0.00 0 0 0 0 0 0
9.99/10.08 c leastinf : 0.00 0 0 0 0 0 0
9.99/10.08 c fullstrong : 0.00 0 0 0 0 0 0
9.99/10.08 c allfullstrong : 0.00 0 0 0 0 0 0
9.99/10.08 c random : 0.00 0 0 0 0 0 0
9.99/10.08 c relpscost : 0.00 0 0 0 0 0 0
9.99/10.08 c Primal Heuristics : Time Calls Found
9.99/10.08 c LP solutions : 0.00 - 0
9.99/10.08 c pseudo solutions : 0.00 - 0
9.99/10.08 c trivial : 0.01 1 0
9.99/10.08 c shiftandpropagate: 0.00 0 0
9.99/10.08 c simplerounding : 0.00 0 0
9.99/10.08 c zirounding : 0.00 0 0
9.99/10.08 c rounding : 0.00 0 0
9.99/10.08 c shifting : 0.00 0 0
9.99/10.08 c intshifting : 0.00 0 0
9.99/10.08 c oneopt : 0.00 0 0
9.99/10.08 c twoopt : 0.00 0 0
9.99/10.08 c fixandinfer : 0.00 0 0
9.99/10.08 c feaspump : 0.00 0 0
9.99/10.08 c clique : 0.00 0 0
9.99/10.08 c coefdiving : 0.00 0 0
9.99/10.08 c pscostdiving : 0.00 0 0
9.99/10.08 c fracdiving : 0.00 0 0
9.99/10.08 c veclendiving : 0.00 0 0
9.99/10.08 c intdiving : 0.00 0 0
9.99/10.08 c actconsdiving : 0.00 0 0
9.99/10.08 c objpscostdiving : 0.00 0 0
9.99/10.08 c rootsoldiving : 0.00 0 0
9.99/10.08 c linesearchdiving : 0.00 0 0
9.99/10.08 c guideddiving : 0.00 0 0
9.99/10.08 c octane : 0.00 0 0
9.99/10.08 c rens : 0.00 0 0
9.99/10.08 c rins : 0.00 0 0
9.99/10.08 c localbranching : 0.00 0 0
9.99/10.08 c mutation : 0.00 0 0
9.99/10.08 c crossover : 0.00 0 0
9.99/10.08 c dins : 0.00 0 0
9.99/10.08 c vbounds : 0.00 0 0
9.99/10.08 c undercover : 0.00 0 0
9.99/10.08 c subnlp : 0.00 0 0
9.99/10.08 c trysol : 0.00 0 0
9.99/10.08 c LP : Time Calls Iterations Iter/call Iter/sec
9.99/10.08 c primal LP : 0.00 0 0 0.00 -
9.99/10.08 c dual LP : 7.25 1 13009 13009.00 1794.19
9.99/10.08 c lex dual LP : 0.00 0 0 0.00 -
9.99/10.08 c barrier LP : 0.00 0 0 0.00 -
9.99/10.08 c diving/probing LP: 0.00 0 0 0.00 -
9.99/10.08 c strong branching : 0.00 0 0 0.00 -
9.99/10.08 c (at root node) : - 0 0 0.00 -
9.99/10.08 c conflict analysis: 0.00 0 0 0.00 -
9.99/10.08 c B&B Tree :
9.99/10.08 c number of runs : 1
9.99/10.08 c nodes : 1
9.99/10.08 c nodes (total) : 1
9.99/10.08 c nodes left : 0
9.99/10.08 c max depth : 0
9.99/10.08 c max depth (total): 0
9.99/10.08 c backtracks : 0 (0.0%)
9.99/10.08 c delayed cutoffs : 0
9.99/10.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
9.99/10.08 c avg switch length: 2.00
9.99/10.08 c switching time : 0.00
9.99/10.08 c Solution :
9.99/10.08 c Solutions found : 0 (0 improvements)
9.99/10.08 c Primal Bound : infeasible
9.99/10.08 c Dual Bound : -
9.99/10.08 c Gap : 0.00 %
9.99/10.08 c Root Dual Bound : -
9.99/10.08 c Root Iterations : 13009
10.09/10.17 c Time complete: 10.17.