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-3730444-1338688263.opb>
0.00/0.00 c original problem has 149 variables (149 bin, 0 int, 0 impl, 0 cont) and 128 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 128 upgd conss, 0 impls, 20 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 20 cliques
0.00/0.01 c presolved problem has 149 variables (149 bin, 0 int, 0 impl, 0 cont) and 128 constraints
0.00/0.01 c 20 constraints of type <setppc>
0.00/0.01 c 108 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.5
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
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 presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = 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 # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = 0
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 # 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 -----------------------------------------------------------------------------------------------
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 | 50 | - | 660k| 0 | 44 | 149 | 128 | 149 | 128 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.04 c 0.0s| 1 | 0 | 76 | - | 825k| 0 | 48 | 149 | 164 | 149 | 132 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 104 | - | 993k| 0 | 49 | 149 | 164 | 149 | 137 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 145 | - |1119k| 0 | 44 | 149 | 164 | 149 | 143 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.06 c 0.1s| 1 | 0 | 188 | - |1286k| 0 | 43 | 149 | 164 | 149 | 149 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.07 c 0.1s| 1 | 0 | 220 | - |1385k| 0 | 38 | 149 | 164 | 149 | 156 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.08 c 0.1s| 1 | 2 | 220 | - |1385k| 0 | 38 | 149 | 164 | 149 | 156 | 28 | 0 | 15 | 0.000000e+00 | -- | Inf
0.19/0.22 c * 0.2s| 25 | 0 | 556 | 14.0 |1425k| 10 | - | 149 | 166 | 149 | 145 | 28 | 2 | 316 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.19/0.22 c
0.19/0.22 c SCIP Status : problem is solved [optimal solution found]
0.19/0.22 c Solving Time (sec) : 0.22
0.19/0.22 c Solving Nodes : 25
0.19/0.22 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.19/0.22 c Dual Bound : +0.00000000000000e+00
0.19/0.22 c Gap : 0.00 %
0.19/0.22 s SATISFIABLE
0.19/0.22 v x81 -x50 -x45 -x21 -x19 -x83 -x78 -x85 -x48 x55 -x86 -x17 -x16 -x32 -x23 -x52 -x13 -x87 x27 -x88 -x46 -x29 -x22 -x11 -x10 x8 -x6
0.19/0.22 v -x3 -x2 -x53 -x79 -x51 -x31 -x98 -x96 x95 -x93 -x90 -x89 -x15 -x144 -x143 -x142 x141 -x140 -x54 -x20 -x80 -x66 -x65 -x62 -x61
0.19/0.22 v -x60 -x59 -x57 -x33 -x9 -x77 x76 -x75 -x74 -x72 -x71 -x70 -x69 -x68 -x67 -x94 -x49 -x25 -x97 -x149 x148 -x147 -x146 -x145
0.19/0.22 v -x99 -x18 x56 x14 -x92 -x64 -x82 -x107 -x106 -x105 -x104 -x24 -x47 -x7 -x84 -x63 -x91 -x129 -x128 -x127 -x126 x125 -x73 -x44
0.19/0.22 v -x43 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x4 -x111 -x110 x109 -x108 -x58 -x12 x103 -x102 -x101 -x100 -x1 -x119 -x118 -x117
0.19/0.22 v x116 -x5 -x124 -x123 -x122 -x121 -x120 -x28 -x115 x114 -x113 -x112 -x26 -x139 -x138 x137 -x136 -x135 x42 x134 -x133 -x132 -x131
0.19/0.22 v -x130 -x30
0.19/0.22 c SCIP Status : problem is solved [optimal solution found]
0.19/0.22 c Total Time : 0.22
0.19/0.22 c solving : 0.22
0.19/0.22 c presolving : 0.00 (included in solving)
0.19/0.22 c reading : 0.00 (included in solving)
0.19/0.22 c Original Problem :
0.19/0.22 c Problem name : HOME/instance-3730444-1338688263.opb
0.19/0.22 c Variables : 149 (149 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.22 c Constraints : 128 initial, 128 maximal
0.19/0.22 c Presolved Problem :
0.19/0.22 c Problem name : t_HOME/instance-3730444-1338688263.opb
0.19/0.22 c Variables : 149 (149 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.22 c Constraints : 128 initial, 166 maximal
0.19/0.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.22 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.22 c root node : - 0 - - 0 - - - - -
0.19/0.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.22 c integral : 0 0 0 35 0 3 0 2 33 0 0 38
0.19/0.22 c setppc : 20 5 63 1 0 0 53 0 156 0 0 0
0.19/0.22 c linear : 0+ 5 28 0 0 0 0 0 0 0 0 0
0.19/0.22 c logicor : 108+ 5 28 1 0 0 2 0 3 0 0 0
0.19/0.22 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
0.19/0.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.22 c integral : 0.14 0.00 0.00 0.14 0.00 0.00 0.00
0.19/0.22 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.22 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.22 c vbounds : 0 0 0 0
0.19/0.22 c rootredcost : 0 0 0 0
0.19/0.22 c pseudoobj : 0 0 0 0
0.19/0.22 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.22 c vbounds : 0.00 0.00 0.00
0.19/0.22 c rootredcost : 0.00 0.00 0.00
0.19/0.22 c pseudoobj : 0.00 0.00 0.00
0.19/0.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.22 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.22 c infeasible LP : 0.00 3 1 8 19.0 0 0.0 0
0.19/0.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.22 c applied globally : - - - 2 15.5 - - -
0.19/0.22 c applied locally : - - - 0 0.0 - - -
0.19/0.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.22 c cut pool : 0.00 4 - - 4 - (maximal pool size: 284)
0.19/0.22 c redcost : 0.00 29 0 0 0 0
0.19/0.22 c impliedbounds : 0.00 5 0 0 0 0
0.19/0.22 c intobj : 0.00 0 0 0 0 0
0.19/0.22 c gomory : 0.01 5 0 0 523 0
0.19/0.22 c cgmip : 0.00 0 0 0 0 0
0.19/0.22 c closecuts : 0.00 0 0 0 0 0
0.19/0.22 c strongcg : 0.01 5 0 0 544 0
0.19/0.22 c cmir : 0.00 0 0 0 0 0
0.19/0.22 c flowcover : 0.00 0 0 0 0 0
0.19/0.22 c clique : 0.00 5 0 0 0 0
0.19/0.22 c zerohalf : 0.00 0 0 0 0 0
0.19/0.22 c mcf : 0.00 1 0 0 0 0
0.19/0.22 c oddcycle : 0.00 0 0 0 0 0
0.19/0.22 c rapidlearning : 0.02 1 0 0 0 36
0.19/0.22 c Pricers : Time Calls Vars
0.19/0.22 c problem variables: 0.00 0 0
0.19/0.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.22 c relpscost : 0.14 34 2 33 0 0 38
0.19/0.22 c pscost : 0.00 0 0 0 0 0 0
0.19/0.22 c inference : 0.00 0 0 0 0 0 0
0.19/0.22 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.22 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.22 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.22 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.22 c random : 0.00 0 0 0 0 0 0
0.19/0.22 c Primal Heuristics : Time Calls Found
0.19/0.22 c LP solutions : 0.00 - 1
0.19/0.22 c pseudo solutions : 0.00 - 0
0.19/0.22 c trivial : 0.00 1 0
0.19/0.22 c shiftandpropagate: 0.00 0 0
0.19/0.22 c simplerounding : 0.00 0 0
0.19/0.22 c zirounding : 0.00 0 0
0.19/0.22 c rounding : 0.00 0 0
0.19/0.22 c shifting : 0.00 0 0
0.19/0.22 c intshifting : 0.00 0 0
0.19/0.22 c oneopt : 0.00 0 0
0.19/0.22 c twoopt : 0.00 0 0
0.19/0.22 c fixandinfer : 0.00 0 0
0.19/0.22 c feaspump : 0.00 0 0
0.19/0.22 c clique : 0.00 0 0
0.19/0.22 c coefdiving : 0.00 0 0
0.19/0.22 c pscostdiving : 0.00 0 0
0.19/0.22 c fracdiving : 0.00 0 0
0.19/0.22 c veclendiving : 0.00 0 0
0.19/0.22 c intdiving : 0.00 0 0
0.19/0.22 c actconsdiving : 0.00 0 0
0.19/0.22 c objpscostdiving : 0.00 0 0
0.19/0.22 c rootsoldiving : 0.00 0 0
0.19/0.22 c linesearchdiving : 0.00 0 0
0.19/0.22 c guideddiving : 0.00 0 0
0.19/0.22 c octane : 0.00 0 0
0.19/0.22 c rens : 0.00 0 0
0.19/0.22 c rins : 0.00 0 0
0.19/0.22 c localbranching : 0.00 0 0
0.19/0.22 c mutation : 0.00 0 0
0.19/0.22 c crossover : 0.00 0 0
0.19/0.22 c dins : 0.00 0 0
0.19/0.22 c vbounds : 0.00 0 0
0.19/0.22 c undercover : 0.00 0 0
0.19/0.22 c subnlp : 0.00 0 0
0.19/0.22 c trysol : 0.00 0 0
0.19/0.22 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.22 c primal LP : 0.00 0 0 0.00 -
0.19/0.22 c dual LP : 0.01 43 556 12.93 43659.21
0.19/0.22 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.22 c barrier LP : 0.00 0 0 0.00 -
0.19/0.22 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.22 c strong branching : 0.14 316 5293 16.75 37968.78
0.19/0.22 c (at root node) : - 15 452 30.13 -
0.19/0.22 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.22 c B&B Tree :
0.19/0.22 c number of runs : 1
0.19/0.22 c nodes : 25
0.19/0.22 c nodes (total) : 25
0.19/0.22 c nodes left : 0
0.19/0.22 c max depth : 10
0.19/0.22 c max depth (total): 10
0.19/0.22 c backtracks : 1 (4.0%)
0.19/0.22 c delayed cutoffs : 0
0.19/0.22 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.22 c avg switch length: 2.00
0.19/0.22 c switching time : 0.00
0.19/0.22 c Solution :
0.19/0.22 c Solutions found : 1 (1 improvements)
0.19/0.22 c First Solution : +0.00000000000000e+00 (in run 1, after 25 nodes, 0.22 seconds, depth 10, found by <relaxation>)
0.19/0.22 c Primal Bound : +0.00000000000000e+00 (in run 1, after 25 nodes, 0.22 seconds, depth 10, found by <relaxation>)
0.19/0.22 c Dual Bound : +0.00000000000000e+00
0.19/0.22 c Gap : 0.00 %
0.19/0.22 c Root Dual Bound : +0.00000000000000e+00
0.19/0.22 c Root Iterations : 220
0.19/0.23 c Time complete: 0.22.