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-3451970-1307113549.opb>
0.00/0.00 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 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.04 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 100 clqs
0.00/0.06 c presolving (2 rounds):
0.00/0.06 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.06 c 12084 implications, 100 cliques
0.00/0.06 c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 150 constraints of type <setppc>
0.00/0.06 c 1498 constraints of type <and>
0.00/0.06 c 1 constraints of type <linear>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.06
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.0.1.4
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.08 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.08 c 0.1s| 1 | 0 | 49 | - |6781k| 0 | 42 |1598 |1650 |1598 |3148 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 109 | - |7001k| 0 | 69 |1598 |1689 |1598 |3157 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 147 | - |7055k| 0 | 91 |1598 |1689 |1598 |3160 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 187 | - |7069k| 0 | 78 |1598 |1689 |1598 |3163 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 233 | - |7081k| 0 | 70 |1598 |1689 |1598 |3166 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 266 | - |7106k| 0 | 72 |1598 |1689 |1598 |3169 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
2.11/2.21 c 2.2s| 1 | 2 | 266 | - |7107k| 0 | 72 |1598 |1689 |1598 |3169 | 21 | 0 | 14 | 0.000000e+00 | -- | Inf
2.29/2.33 c * 2.3s| 15 | 0 | 660 | 28.1 |7650k| 8 | - |1598 |1697 |1598 | 272 | 176 | 8 | 109 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.29/2.33 c
2.29/2.33 c SCIP Status : problem is solved [optimal solution found]
2.29/2.33 c Solving Time (sec) : 2.33
2.29/2.33 c Solving Nodes : 15
2.29/2.33 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.29/2.33 c Dual Bound : +0.00000000000000e+00
2.29/2.33 c Gap : 0.00 %
2.29/2.33 s SATISFIABLE
2.29/2.33 v -x95 x89 x79 -x96 -x52 -x98 -x58 -x55 -x54 x71 -x75 -x99 -x88 x85 -x57 -x51 -x97 -x92 -x90 -x82 -x76 -x67 -x65 -x61 -x56 -x70 -x59
2.29/2.33 v -x53 -x74 -x81 -x83 -x80 -x68 -x69 -x62 -x73 -x77 -x64 -x60 -x91 -x63 x72 -x100 -x93 -x86 -x94 -x66 -x78 -x87 -x84 x50 -x49
2.29/2.33 v -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
2.29/2.33 v -x23 -x22 -x21 -x20 -x19 x18 -x17 -x16 -x15 -x14 -x13 x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
2.29/2.33 c SCIP Status : problem is solved [optimal solution found]
2.29/2.33 c Total Time : 2.33
2.29/2.33 c solving : 2.33
2.29/2.33 c presolving : 0.06 (included in solving)
2.29/2.33 c reading : 0.00 (included in solving)
2.29/2.33 c Original Problem :
2.29/2.33 c Problem name : HOME/instance-3451970-1307113549.opb
2.29/2.33 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.33 c Constraints : 152 initial, 152 maximal
2.29/2.33 c Presolved Problem :
2.29/2.33 c Problem name : t_HOME/instance-3451970-1307113549.opb
2.29/2.33 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.33 c Constraints : 1650 initial, 1697 maximal
2.29/2.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.29/2.33 c trivial : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c setppc : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c and : 0.04 0 0 0 0 0 0 0 0 0
2.29/2.33 c linear : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c logicor : 0.00 0 0 0 0 0 0 0 0 0
2.29/2.33 c root node : - 0 - - 0 - - - - -
2.29/2.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.29/2.33 c integral : 0 0 0 18 0 3 0 0 7 0 0 20
2.29/2.33 c knapsack : 1 5 51 2 0 0 2 0 2 0 0 0
2.29/2.33 c setppc : 150 5 52 4 0 0 178 0 142 0 0 0
2.29/2.33 c and : 1498 18 52 4 0 0 176 0 1856 155 0 0
2.29/2.33 c linear : 1+ 6 52 1 0 0 4 0 1 0 0 0
2.29/2.33 c logicor : 0+ 0 7 0 0 0 1 1 3 0 0 0
2.29/2.33 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
2.29/2.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.29/2.33 c integral : 1.24 0.00 0.00 1.24 0.00 0.00 0.00
2.29/2.33 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.29/2.33 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.29/2.33 c vbounds : 0 0 0 0
2.29/2.33 c rootredcost : 0 0 0 0
2.29/2.33 c pseudoobj : 0 0 0 0
2.29/2.33 c Propagator Timings : TotalTime Propagate Resprop
2.29/2.33 c vbounds : 0.00 0.00 0.00
2.29/2.33 c rootredcost : 0.00 0.00 0.00
2.29/2.33 c pseudoobj : 0.00 0.00 0.00
2.29/2.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.33 c propagation : 0.00 1 1 2 35.5 0 0.0 -
2.29/2.33 c infeasible LP : 0.00 3 3 11 32.1 0 0.0 0
2.29/2.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.33 c applied globally : - - - 8 31.4 - - -
2.29/2.33 c applied locally : - - - 0 0.0 - - -
2.29/2.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.33 c cut pool : 0.00 4 - - 13 - (maximal pool size: 63)
2.29/2.33 c redcost : 0.00 18 0 0 0 0
2.29/2.33 c impliedbounds : 0.00 5 0 0 0 0
2.29/2.33 c intobj : 0.00 0 0 0 0 0
2.29/2.33 c gomory : 0.49 5 0 0 261 0
2.29/2.33 c cgmip : 0.00 0 0 0 0 0
2.29/2.33 c closecuts : 0.00 0 0 0 0 0
2.29/2.33 c strongcg : 0.37 5 0 0 824 0
2.29/2.33 c cmir : 0.00 0 0 0 0 0
2.29/2.33 c flowcover : 0.00 0 0 0 0 0
2.29/2.33 c clique : 0.01 5 0 0 13 0
2.29/2.33 c zerohalf : 0.00 0 0 0 0 0
2.29/2.33 c mcf : 0.01 2 0 0 0 0
2.29/2.33 c oddcycle : 0.00 0 0 0 0 0
2.29/2.33 c rapidlearning : 0.06 1 0 0 0 39
2.29/2.33 c Pricers : Time Calls Vars
2.29/2.33 c problem variables: 0.00 0 0
2.29/2.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.33 c relpscost : 1.24 14 0 7 0 0 20
2.29/2.33 c pscost : 0.00 0 0 0 0 0 0
2.29/2.33 c inference : 0.00 0 0 0 0 0 0
2.29/2.33 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.33 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.33 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.33 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.33 c random : 0.00 0 0 0 0 0 0
2.29/2.33 c Primal Heuristics : Time Calls Found
2.29/2.33 c LP solutions : 0.00 - 1
2.29/2.33 c pseudo solutions : 0.00 - 0
2.29/2.33 c trivial : 0.00 1 0
2.29/2.33 c shiftandpropagate: 0.00 0 0
2.29/2.33 c simplerounding : 0.00 0 0
2.29/2.33 c zirounding : 0.00 0 0
2.29/2.33 c rounding : 0.00 0 0
2.29/2.33 c shifting : 0.00 0 0
2.29/2.33 c intshifting : 0.00 0 0
2.29/2.33 c oneopt : 0.00 0 0
2.29/2.33 c twoopt : 0.00 0 0
2.29/2.33 c fixandinfer : 0.00 0 0
2.29/2.33 c feaspump : 0.00 0 0
2.29/2.33 c clique : 0.00 0 0
2.29/2.33 c coefdiving : 0.00 0 0
2.29/2.33 c pscostdiving : 0.00 0 0
2.29/2.33 c fracdiving : 0.00 0 0
2.29/2.33 c veclendiving : 0.00 0 0
2.29/2.33 c intdiving : 0.00 0 0
2.29/2.33 c actconsdiving : 0.00 0 0
2.29/2.33 c objpscostdiving : 0.00 0 0
2.29/2.33 c rootsoldiving : 0.00 0 0
2.29/2.33 c linesearchdiving : 0.00 0 0
2.29/2.33 c guideddiving : 0.00 0 0
2.29/2.33 c octane : 0.00 0 0
2.29/2.33 c rens : 0.00 0 0
2.29/2.33 c rins : 0.00 0 0
2.29/2.33 c localbranching : 0.00 0 0
2.29/2.33 c mutation : 0.00 0 0
2.29/2.33 c crossover : 0.00 0 0
2.29/2.33 c dins : 0.00 0 0
2.29/2.33 c vbounds : 0.00 0 0
2.29/2.33 c undercover : 0.00 0 0
2.29/2.33 c subnlp : 0.00 0 0
2.29/2.33 c trysol : 0.00 0 0
2.29/2.33 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.33 c primal LP : 0.00 0 0 0.00 -
2.29/2.33 c dual LP : 0.05 39 660 16.92 12877.04
2.29/2.33 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.33 c barrier LP : 0.00 0 0 0.00 -
2.29/2.33 c diving/probing LP: 0.00 0 0 0.00 -
2.29/2.33 c strong branching : 1.24 109 10776 98.86 8683.72
2.29/2.33 c (at root node) : - 14 9545 681.79 -
2.29/2.33 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.33 c B&B Tree :
2.29/2.33 c number of runs : 1
2.29/2.33 c nodes : 15
2.29/2.33 c nodes (total) : 15
2.29/2.33 c nodes left : 0
2.29/2.33 c max depth : 8
2.29/2.33 c max depth (total): 8
2.29/2.33 c backtracks : 1 (6.7%)
2.29/2.33 c delayed cutoffs : 0
2.29/2.33 c repropagations : 3 (29 domain reductions, 0 cutoffs)
2.29/2.33 c avg switch length: 2.00
2.29/2.33 c switching time : 0.00
2.29/2.33 c Solution :
2.29/2.33 c Solutions found : 1 (1 improvements)
2.29/2.33 c First Solution : +0.00000000000000e+00 (in run 1, after 15 nodes, 2.33 seconds, depth 8, found by <relaxation>)
2.29/2.33 c Primal Bound : +0.00000000000000e+00 (in run 1, after 15 nodes, 2.33 seconds, depth 8, found by <relaxation>)
2.29/2.33 c Dual Bound : +0.00000000000000e+00
2.29/2.33 c Gap : 0.00 %
2.29/2.33 c Root Dual Bound : +0.00000000000000e+00
2.29/2.33 c Root Iterations : 266
2.29/2.34 c Time complete: 2.33.