0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691626-1338020745.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 72 constraints of type <setppc>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1797
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = 1
0.00/0.01 c
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = 5
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = FALSE
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = -1
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = 750
0.00/0.01 c
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = 100
0.00/0.01 c
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = 0.15
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = 0.5
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = -1
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = -1
0.00/0.01 c
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = 0.3
0.00/0.01 c
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = 2000
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/subnlp/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/trivial/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/trysol/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.01 c
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/zirounding/freq = -1
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c propagating/probing/maxprerounds = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/indoneopt/freq = -1
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 112 | - | 824k| 0 | 46 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 133 | - |1408k| 0 | 50 | 169 | 307 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.08 c 0.1s| 1 | 0 | 158 | - |1607k| 0 | 56 | 169 | 307 | 169 | 91 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.09 c 0.1s| 1 | 0 | 188 | - |1862k| 0 | 54 | 169 | 307 | 169 | 97 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.03/0.09 c 0.1s| 1 | 0 | 196 | - |2011k| 0 | 55 | 169 | 307 | 169 | 101 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 227 | - |2145k| 0 | 60 | 169 | 307 | 169 | 102 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 251 | - |2107k| 0 | 59 | 169 | 274 | 169 | 102 | 29 | 0 | 14 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 268 | - |2082k| 0 | 60 | 169 | 249 | 169 | 102 | 29 | 0 | 19 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 286 | - |2060k| 0 | 59 | 169 | 227 | 169 | 102 | 29 | 0 | 28 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 313 | - |2056k| 0 | 59 | 169 | 223 | 169 | 102 | 29 | 0 | 33 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 332 | - |2047k| 0 | 55 | 169 | 213 | 169 | 102 | 29 | 0 | 39 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 383 | - |2043k| 0 | 50 | 169 | 209 | 169 | 93 | 29 | 0 | 45 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 383 | - |2043k| 0 | - | 169 | 209 | 169 | 93 | 29 | 0 | 53 | 0.000000e+00 | -- | Inf
0.29/0.34 c (run 1, node 1) restarting after 34 global fixings of integer variables
0.29/0.34 c
0.29/0.34 c (restart) converted 19 cuts from the global cut pool into linear constraints
0.29/0.34 c
0.29/0.34 c presolving:
0.29/0.34 c (round 1) 34 del vars, 106 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 82 clqs
0.29/0.34 c (round 2) 34 del vars, 107 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 82 clqs
0.29/0.34 c (round 3) 34 del vars, 107 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 49 upgd conss, 8 impls, 82 clqs
0.29/0.34 c (round 4) 34 del vars, 108 del conss, 0 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 49 upgd conss, 8 impls, 82 clqs
0.29/0.34 c presolving (5 rounds):
0.29/0.34 c 34 deleted vars, 108 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.29/0.34 c 8 implications, 82 cliques
0.29/0.34 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 120 constraints
0.29/0.34 c 6 constraints of type <knapsack>
0.29/0.34 c 84 constraints of type <setppc>
0.29/0.34 c 30 constraints of type <logicor>
0.29/0.34 c transformed objective value is always integral (scale: 1)
0.29/0.34 c Presolving Time: 0.01
0.29/0.34 c
0.29/0.35 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.35 c 0.3s| 1 | 0 | 482 | - | 978k| 0 | 48 | 135 | 120 | 135 | 90 | 0 | 0 | 53 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.4s| 1 | 0 | 503 | - |1246k| 0 | 51 | 135 | 120 | 135 | 100 | 10 | 0 | 53 | 0.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 531 | - |1246k| 0 | 47 | 135 | 120 | 135 | 100 | 10 | 0 | 60 | 0.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 604 | - |1246k| 0 | 42 | 135 | 119 | 135 | 100 | 10 | 0 | 67 | 0.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 604 | - |1246k| 0 | 42 | 135 | 119 | 135 | 100 | 10 | 0 | 68 | cutoff | -- | 0.00%
0.39/0.40 c
0.39/0.40 c SCIP Status : problem is solved [infeasible]
0.39/0.40 c Solving Time (sec) : 0.40
0.39/0.40 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.39/0.40 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.39/0.40 c Dual Bound : +1.00000000000000e+20
0.39/0.40 c Gap : 0.00 %
0.39/0.40 s UNSATISFIABLE
0.39/0.40 c SCIP Status : problem is solved [infeasible]
0.39/0.40 c Total Time : 0.40
0.39/0.40 c solving : 0.40
0.39/0.40 c presolving : 0.01 (included in solving)
0.39/0.40 c reading : 0.00 (included in solving)
0.39/0.40 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.39/0.40 c Original Problem :
0.39/0.40 c Problem name : HOME/instance-3691626-1338020745.opb
0.39/0.40 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 101 initial, 101 maximal
0.39/0.40 c Objective sense : minimize
0.39/0.40 c Presolved Problem :
0.39/0.40 c Problem name : t_HOME/instance-3691626-1338020745.opb
0.39/0.40 c Variables : 135 (135 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 120 initial, 120 maximal
0.39/0.40 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.39/0.40 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c trivial : 0.00 0.00 34 0 0 0 0 0 0 0 0
0.39/0.40 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c setppc : 0.00 0.00 0 0 0 0 0 1 0 0 0
0.39/0.40 c linear : 0.00 0.00 0 0 0 0 0 135 0 1 0
0.39/0.40 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.39/0.40 c root node : - - 44 - - 44 - - - - -
0.39/0.40 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.39/0.40 c integral : 0 0 0 0 10 0 2 0 1 44 0 0 0
0.39/0.40 c knapsack : 6 6 6 10 0 0 0 0 0 0 0 0 0
0.39/0.40 c setppc : 84 84 6 10 0 0 0 0 0 0 0 0 0
0.39/0.40 c logicor : 30 30 1 3 0 0 0 0 0 0 0 0 0
0.39/0.40 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.39/0.40 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.39/0.40 c integral : 0.27 0.00 0.00 0.00 0.27 0.00 0.00 0.00
0.39/0.40 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.39/0.40 c rootredcost : 0 0 0 0
0.39/0.40 c pseudoobj : 0 0 0 0
0.39/0.40 c vbounds : 0 0 0 0
0.39/0.40 c redcost : 16 0 0 0
0.39/0.40 c probing : 0 0 0 0
0.39/0.40 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.39/0.40 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c redcost : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c probing : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.40 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.40 c applied globally : - - - 0 0.0 - - -
0.39/0.40 c applied locally : - - - 0 0.0 - - -
0.39/0.40 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.39/0.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 82)
0.39/0.40 c closecuts : 0.00 0.00 0 0 0 0 0
0.39/0.40 c impliedbounds : 0.00 0.00 6 0 0 0 0
0.39/0.40 c intobj : 0.00 0.00 0 0 0 0 0
0.39/0.40 c gomory : 0.02 0.00 6 0 0 6 0
0.39/0.40 c cgmip : 0.00 0.00 0 0 0 0 0
0.39/0.40 c strongcg : 0.02 0.00 6 0 0 290 0
0.39/0.40 c cmir : 0.00 0.00 0 0 0 0 0
0.39/0.40 c flowcover : 0.00 0.00 0 0 0 0 0
0.39/0.40 c clique : 0.00 0.00 6 0 0 24 0
0.39/0.40 c zerohalf : 0.00 0.00 0 0 0 0 0
0.39/0.40 c mcf : 0.00 0.00 2 0 0 0 0
0.39/0.40 c oddcycle : 0.00 0.00 0 0 0 0 0
0.39/0.40 c rapidlearning : 0.05 0.00 1 0 0 0 234
0.39/0.40 c Pricers : ExecTime SetupTime Calls Vars
0.39/0.40 c problem variables: 0.00 - 0 0
0.39/0.40 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.39/0.40 c relpscost : 0.27 0.00 10 1 44 0 0 0
0.39/0.40 c pscost : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c inference : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c random : 0.00 0.00 0 0 0 0 0 0
0.39/0.40 c Primal Heuristics : ExecTime SetupTime Calls Found
0.39/0.40 c LP solutions : 0.00 - - 0
0.39/0.40 c pseudo solutions : 0.00 - - 0
0.39/0.40 c smallcard : 0.00 0.00 0 0
0.39/0.40 c trivial : 0.00 0.00 1 0
0.39/0.40 c shiftandpropagate: 0.00 0.00 0 0
0.39/0.40 c simplerounding : 0.00 0.00 0 0
0.39/0.40 c zirounding : 0.00 0.00 0 0
0.39/0.40 c rounding : 0.00 0.00 0 0
0.39/0.40 c shifting : 0.00 0.00 0 0
0.39/0.40 c intshifting : 0.00 0.00 0 0
0.39/0.40 c oneopt : 0.00 0.00 0 0
0.39/0.40 c twoopt : 0.00 0.00 0 0
0.39/0.40 c indtwoopt : 0.00 0.00 0 0
0.39/0.40 c indoneopt : 0.00 0.00 0 0
0.39/0.40 c fixandinfer : 0.00 0.00 0 0
0.39/0.40 c feaspump : 0.00 0.00 0 0
0.39/0.40 c clique : 0.00 0.00 0 0
0.39/0.40 c indrounding : 0.00 0.00 0 0
0.39/0.40 c indcoefdiving : 0.00 0.00 0 0
0.39/0.40 c coefdiving : 0.00 0.00 0 0
0.39/0.40 c pscostdiving : 0.00 0.00 0 0
0.39/0.40 c nlpdiving : 0.00 0.00 0 0
0.39/0.40 c fracdiving : 0.00 0.00 0 0
0.39/0.40 c veclendiving : 0.00 0.00 0 0
0.39/0.40 c intdiving : 0.00 0.00 0 0
0.39/0.40 c actconsdiving : 0.00 0.00 0 0
0.39/0.40 c objpscostdiving : 0.00 0.00 0 0
0.39/0.40 c rootsoldiving : 0.00 0.00 0 0
0.39/0.40 c linesearchdiving : 0.00 0.00 0 0
0.39/0.40 c guideddiving : 0.00 0.00 0 0
0.39/0.40 c octane : 0.00 0.00 0 0
0.39/0.40 c rens : 0.00 0.00 0 0
0.39/0.40 c rins : 0.00 0.00 0 0
0.39/0.40 c localbranching : 0.00 0.00 0 0
0.39/0.40 c mutation : 0.00 0.00 0 0
0.39/0.40 c crossover : 0.00 0.00 0 0
0.39/0.40 c dins : 0.00 0.00 0 0
0.39/0.40 c vbounds : 0.00 0.00 0 0
0.39/0.40 c undercover : 0.00 0.00 0 0
0.39/0.40 c subnlp : 0.00 0.00 0 0
0.39/0.40 c trysol : 0.00 0.00 0 0
0.39/0.40 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.39/0.40 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.39/0.40 c dual LP : 0.02 16 604 37.75 36076.93 0.00 0
0.39/0.40 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.40 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.39/0.40 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.40 c strong branching : 0.27 68 8860 130.29 33346.26
0.39/0.40 c (at root node) : - 68 8860 130.29 -
0.39/0.40 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.40 c B&B Tree :
0.39/0.40 c number of runs : 2
0.39/0.40 c nodes : 1
0.39/0.40 c nodes (total) : 2
0.39/0.40 c nodes left : 0
0.39/0.40 c max depth : 0
0.39/0.40 c max depth (total): 0
0.39/0.40 c backtracks : 0 (0.0%)
0.39/0.40 c delayed cutoffs : 0
0.39/0.40 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.40 c avg switch length: 2.00
0.39/0.40 c switching time : 0.00
0.39/0.40 c Solution :
0.39/0.40 c Solutions found : 0 (0 improvements)
0.39/0.40 c Primal Bound : infeasible
0.39/0.40 c Dual Bound : -
0.39/0.40 c Gap : 0.00 %
0.39/0.40 c Root Dual Bound : -
0.39/0.40 c Root Iterations : 604
0.39/0.41 c Time complete: 0.4.