0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2664849-1276676494.opb>
0.00/0.02 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.02/0.04 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 11812 implications, 100 cliques
0.39/0.42 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 100 constraints of type <setppc>
0.39/0.42 c 1464 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 50 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.20
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.39/0.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.46 c 0.2s| 1 | 0 | 56 | - |7165k| 0 | 46 |1564 |1616 |1564 |3080 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.18 c 0.7s| 1 | 0 | 144 | - |7394k| 0 | 77 |1564 |1674 |1564 |3091 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.65 c 1.2s| 1 | 0 | 231 | - |7433k| 0 | 103 |1564 |1674 |1564 |3106 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.31 c 1.9s| 1 | 0 | 387 | - |7460k| 0 | 117 |1564 |1674 |1564 |3121 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.10 c 2.6s| 1 | 0 | 484 | - |7577k| 0 | 123 |1564 |1674 |1564 |3141 | 61 | 0 | 0 | 0.000000e+00 | -- | Inf
3.89/3.96 c 3.5s| 1 | 0 | 545 | - |7675k| 0 | 137 |1564 |1674 |1564 |3144 | 64 | 0 | 0 | 0.000000e+00 | -- | Inf
3.99/4.01 c 3.5s| 1 | 0 | 608 | - |7683k| 0 | 155 |1564 |1674 |1564 |3149 | 69 | 0 | 0 | 0.000000e+00 | -- | Inf
8.59/8.69 c 8.2s| 1 | 2 | 608 | - |7684k| 0 | 155 |1564 |1674 |1564 |3149 | 69 | 0 | 9 | 0.000000e+00 | -- | Inf
10.28/10.35 c * 9.8s| 9 | 0 | 1632 | 128.0 |8215k| 8 | - |1564 |1674 |1564 | 438 | 266 | 0 | 97 | 0.000000e+00 | 0.000000e+00 | 0.00%
10.28/10.35 c
10.28/10.35 c SCIP Status : problem is solved [optimal solution found]
10.28/10.35 c Solving Time (sec) : 9.84
10.28/10.35 c Solving Nodes : 9
10.28/10.35 c Primal Bound : +0.00000000000000e+00 (1 solutions)
10.28/10.35 c Dual Bound : +0.00000000000000e+00
10.28/10.35 c Gap : 0.00 %
10.28/10.36 s SATISFIABLE
10.28/10.36 v -x57 -x96 x92 -x81 -x75 -x95 -x69 -x67 -x93 -x90 -x89 -x94 -x86 -x64 -x72 -x51 -x98 -x88 -x70 -x63 -x60 -x58 x55 -x54 -x52 -x91
10.28/10.36 v -x62 -x59 -x85 -x78 -x97 -x68 -x53 -x84 -x80 -x56 -x65 -x87 -x79 x99 -x82 x74 -x100 -x71 -x83 -x77 x73 -x61 -x66 -x76 -x50 -x49
10.28/10.36 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
10.28/10.36 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 x3 -x2 -x1
10.28/10.36 c SCIP Status : problem is solved [optimal solution found]
10.28/10.36 c Solving Time : 9.84
10.28/10.36 c Original Problem :
10.28/10.36 c Problem name : HOME/instance-2664849-1276676494.opb
10.28/10.36 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
10.28/10.36 c Constraints : 1616 initial, 1616 maximal
10.28/10.36 c Presolved Problem :
10.28/10.36 c Problem name : t_HOME/instance-2664849-1276676494.opb
10.28/10.36 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
10.28/10.36 c Constraints : 1616 initial, 1674 maximal
10.28/10.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
10.28/10.36 c trivial : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c implics : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c probing : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c knapsack : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c setppc : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c and : 0.19 0 0 0 0 0 0 0 0
10.28/10.36 c linear : 0.01 0 0 0 0 0 0 0 0
10.28/10.36 c logicor : 0.00 0 0 0 0 0 0 0 0
10.28/10.36 c root node : - 0 - - 0 - - - -
10.28/10.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
10.28/10.36 c integral : 0 0 0 14 0 0 7 0 0 16
10.28/10.36 c knapsack : 1 5 28 1 0 0 0 0 0 0
10.28/10.36 c setppc : 100 5 29 1 0 0 84 0 0 0
10.28/10.36 c and : 1464 13 29 1 0 0 1457 225 0 0
10.28/10.36 c linear : 1+ 6 28 0 0 0 5 0 0 0
10.28/10.36 c logicor : 50 5 10 1 0 0 3 0 0 0
10.28/10.36 c countsols : 0 0 0 1 0 0 0 0 0 0
10.28/10.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
10.28/10.36 c integral : 6.05 0.00 0.00 6.05 0.00
10.28/10.36 c knapsack : 0.00 0.00 0.00 0.00 0.00
10.28/10.36 c setppc : 0.00 0.00 0.00 0.00 0.00
10.28/10.36 c and : 0.02 0.02 0.00 0.00 0.00
10.28/10.36 c linear : 0.00 0.00 0.00 0.00 0.00
10.28/10.36 c logicor : 0.00 0.00 0.00 0.00 0.00
10.28/10.36 c countsols : 0.00 0.00 0.00 0.00 0.00
10.28/10.36 c Propagators : Time Calls Cutoffs DomReds
10.28/10.36 c vbounds : 0.00 1 0 0
10.28/10.36 c rootredcost : 0.00 0 0 0
10.28/10.36 c pseudoobj : 0.00 0 0 0
10.28/10.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
10.28/10.36 c propagation : 0.00 0 0 0 0.0 0 0.0 -
10.28/10.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
10.28/10.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
10.28/10.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
10.28/10.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
10.28/10.36 c applied globally : - - - 0 0.0 - - -
10.28/10.36 c applied locally : - - - 0 0.0 - - -
10.28/10.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
10.28/10.36 c cut pool : 0.00 4 - - 5 - (maximal pool size: 149)
10.28/10.36 c redcost : 0.00 13 0 0 0 0
10.28/10.36 c impliedbounds : 0.00 5 0 0 31 0
10.28/10.36 c intobj : 0.00 0 0 0 0 0
10.28/10.36 c cgmip : 0.00 0 0 0 0 0
10.28/10.36 c gomory : 1.44 5 0 0 500 0
10.28/10.36 c strongcg : 1.24 5 0 0 863 0
10.28/10.36 c cmir : 0.00 0 0 0 0 0
10.28/10.36 c flowcover : 0.00 0 0 0 0 0
10.28/10.36 c clique : 0.02 5 0 0 27 0
10.28/10.36 c zerohalf : 0.00 0 0 0 0 0
10.28/10.36 c mcf : 0.03 2 0 0 18 0
10.28/10.36 c rapidlearning : 0.32 1 0 0 0 58
10.28/10.36 c Pricers : Time Calls Vars
10.28/10.36 c problem variables: 0.00 0 0
10.28/10.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
10.28/10.36 c relpscost : 6.05 12 0 7 0 0 16
10.28/10.36 c pscost : 0.00 0 0 0 0 0 0
10.28/10.36 c inference : 0.00 0 0 0 0 0 0
10.28/10.36 c mostinf : 0.00 0 0 0 0 0 0
10.28/10.36 c leastinf : 0.00 0 0 0 0 0 0
10.28/10.36 c fullstrong : 0.00 0 0 0 0 0 0
10.28/10.36 c allfullstrong : 0.00 0 0 0 0 0 0
10.28/10.36 c random : 0.00 0 0 0 0 0 0
10.28/10.36 c Primal Heuristics : Time Calls Found
10.28/10.36 c LP solutions : 0.00 - 1
10.28/10.36 c pseudo solutions : 0.00 - 0
10.28/10.36 c trivial : 0.00 1 0
10.28/10.36 c simplerounding : 0.00 0 0
10.28/10.36 c zirounding : 0.00 0 0
10.28/10.36 c rounding : 0.00 0 0
10.28/10.36 c shifting : 0.00 0 0
10.28/10.36 c intshifting : 0.00 0 0
10.28/10.36 c oneopt : 0.00 0 0
10.28/10.36 c twoopt : 0.00 0 0
10.28/10.36 c fixandinfer : 0.00 0 0
10.28/10.36 c feaspump : 0.00 0 0
10.28/10.36 c coefdiving : 0.00 0 0
10.28/10.36 c pscostdiving : 0.00 0 0
10.28/10.36 c fracdiving : 0.00 0 0
10.28/10.36 c veclendiving : 0.00 0 0
10.28/10.36 c intdiving : 0.00 0 0
10.28/10.36 c actconsdiving : 0.00 0 0
10.28/10.36 c objpscostdiving : 0.00 0 0
10.28/10.36 c rootsoldiving : 0.00 0 0
10.28/10.36 c linesearchdiving : 0.00 0 0
10.28/10.36 c guideddiving : 0.00 0 0
10.28/10.36 c octane : 0.00 0 0
10.28/10.36 c rens : 0.00 0 0
10.28/10.36 c rins : 0.00 0 0
10.28/10.36 c localbranching : 0.00 0 0
10.28/10.36 c mutation : 0.00 0 0
10.28/10.36 c crossover : 0.00 0 0
10.28/10.36 c dins : 0.00 0 0
10.28/10.36 c undercover : 0.00 0 0
10.28/10.36 c nlp : 0.00 0 0
10.28/10.36 c trysol : 0.00 0 0
10.28/10.36 c LP : Time Calls Iterations Iter/call Iter/sec
10.28/10.36 c primal LP : 0.05 0 0 0.00 0.00
10.28/10.36 c dual LP : 0.44 28 1632 58.29 3709.09
10.28/10.36 c lex dual LP : 0.00 0 0 0.00 -
10.28/10.36 c barrier LP : 0.00 0 0 0.00 -
10.28/10.36 c diving/probing LP: 0.00 0 0 0.00 -
10.28/10.36 c strong branching : 6.04 97 16470 169.79 2726.82
10.28/10.36 c (at root node) : - 9 8615 957.22 -
10.28/10.36 c conflict analysis: 0.00 0 0 0.00 -
10.28/10.36 c B&B Tree :
10.28/10.36 c number of runs : 1
10.28/10.36 c nodes : 9
10.28/10.36 c nodes (total) : 9
10.28/10.36 c nodes left : 0
10.28/10.36 c max depth : 8
10.28/10.36 c max depth (total): 8
10.28/10.36 c backtracks : 0 (0.0%)
10.28/10.36 c delayed cutoffs : 0
10.28/10.36 c repropagations : 0 (0 domain reductions, 0 cutoffs)
10.28/10.36 c avg switch length: 2.00
10.28/10.36 c switching time : 0.05
10.28/10.36 c Solution :
10.28/10.36 c Solutions found : 1 (1 improvements)
10.28/10.36 c First Solution : +0.00000000000000e+00 (in run 1, after 9 nodes, 9.84 seconds, depth 8, found by <relaxation>)
10.28/10.36 c Primal Bound : +0.00000000000000e+00 (in run 1, after 9 nodes, 9.84 seconds, depth 8, found by <relaxation>)
10.28/10.36 c Dual Bound : +0.00000000000000e+00
10.28/10.36 c Gap : 0.00 %
10.28/10.36 c Root Dual Bound : +0.00000000000000e+00
10.28/10.36 c Root Iterations : 608
10.28/10.38 c Time complete: 10.38.