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-2664836-1276675109.opb>
0.00/0.02 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 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.00/0.04 c presolving:
0.19/0.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11940 impls, 100 clqs
0.39/0.41 c presolving (2 rounds):
0.39/0.41 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.41 c 11940 implications, 100 cliques
0.39/0.41 c presolved problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.39/0.41 c 1 constraints of type <knapsack>
0.39/0.41 c 100 constraints of type <setppc>
0.39/0.41 c 1480 constraints of type <and>
0.39/0.41 c 1 constraints of type <linear>
0.39/0.41 c 50 constraints of type <logicor>
0.39/0.41 c transformed objective value is always integral (scale: 1)
0.39/0.41 c Presolving Time: 0.20
0.39/0.41 c - non default parameters ----------------------------------------------------------------------
0.39/0.41 c # SCIP version 1.2.1.2
0.39/0.41 c
0.39/0.41 c # frequency for displaying node information lines
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.41 c display/freq = 10000
0.39/0.41 c
0.39/0.41 c # maximal time in seconds to run
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/time = 1799.99
0.39/0.41 c
0.39/0.41 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.41 c limits/memory = 1620
0.39/0.41 c
0.39/0.41 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c limits/solutions = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.41 c separating/maxrounds = 1
0.39/0.41 c
0.39/0.41 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c separating/maxroundsroot = 5
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify inequalities
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/linear/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.41 c constraints/knapsack/disaggregation = FALSE
0.39/0.41 c
0.39/0.41 c # should presolving try to simplify knapsacks
0.39/0.41 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.41 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.41 c
0.39/0.41 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c presolving/probing/maxrounds = 0
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 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.45 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.45 c 0.2s| 1 | 0 | 33 | - |7239k| 0 | 27 |1580 |1632 |1580 |3112 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.13 c 0.7s| 1 | 0 | 58 | - |7444k| 0 | 30 |1580 |1705 |1580 |3114 | 2 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.37 c 0.9s| 1 | 0 | 67 | - |7519k| 0 | 32 |1580 |1705 |1580 |3115 | 3 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.60 c 1.2s| 1 | 0 | 117 | - |7578k| 0 | 66 |1580 |1705 |1580 |3117 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.05 c 1.6s| 1 | 0 | 276 | - |7610k| 0 | 97 |1580 |1705 |1580 |3133 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
2.59/2.69 c 2.2s| 1 | 0 | 345 | - |7655k| 0 | 87 |1580 |1705 |1580 |3149 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.72 c 2.3s| 1 | 0 | 379 | - |7662k| 0 | 88 |1580 |1705 |1580 |3151 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
6.39/6.44 c 6.0s| 1 | 2 | 379 | - |7662k| 0 | 88 |1580 |1705 |1580 |3151 | 39 | 0 | 9 | 0.000000e+00 | -- | Inf
8.29/8.30 c * 7.8s| 10 | 0 | 1514 | 126.1 |8198k| 9 | - |1580 |1705 |1580 | 491 | 459 | 0 | 78 | 0.000000e+00 | 0.000000e+00 | 0.00%
8.29/8.31 c
8.29/8.31 c SCIP Status : problem is solved [optimal solution found]
8.29/8.31 c Solving Time (sec) : 7.80
8.29/8.31 c Solving Nodes : 10
8.29/8.31 c Primal Bound : +0.00000000000000e+00 (1 solutions)
8.29/8.31 c Dual Bound : +0.00000000000000e+00
8.29/8.31 c Gap : 0.00 %
8.29/8.31 s SATISFIABLE
8.29/8.31 v -x84 x71 -x52 -x90 -x85 -x82 -x77 -x75 -x54 -x56 -x95 -x98 -x83 -x87 -x51 -x86 -x79 -x72 -x69 -x67 -x63 -x60 -x59 -x58 -x57 -x64
8.29/8.31 v -x97 -x61 -x92 -x66 -x73 -x53 -x81 -x68 x74 -x55 -x88 -x94 -x100 -x80 -x93 x96 x78 -x65 x99 -x62 -x76 -x89 -x70 -x91 x50 -x49
8.29/8.31 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 -x23
8.29/8.31 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
8.29/8.31 c SCIP Status : problem is solved [optimal solution found]
8.29/8.31 c Solving Time : 7.80
8.29/8.31 c Original Problem :
8.29/8.31 c Problem name : HOME/instance-2664836-1276675109.opb
8.29/8.31 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
8.29/8.31 c Constraints : 1632 initial, 1632 maximal
8.29/8.31 c Presolved Problem :
8.29/8.31 c Problem name : t_HOME/instance-2664836-1276675109.opb
8.29/8.31 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
8.29/8.31 c Constraints : 1632 initial, 1705 maximal
8.29/8.31 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.29/8.31 c trivial : 0.01 0 0 0 0 0 0 0 0
8.29/8.31 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c implics : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c probing : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c knapsack : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c setppc : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c and : 0.18 0 0 0 0 0 0 0 0
8.29/8.31 c linear : 0.01 0 0 0 0 0 0 0 0
8.29/8.31 c logicor : 0.00 0 0 0 0 0 0 0 0
8.29/8.31 c root node : - 0 - - 0 - - - -
8.29/8.31 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.29/8.31 c integral : 0 0 0 10 0 0 0 0 0 18
8.29/8.31 c knapsack : 1 5 25 1 0 0 0 0 0 0
8.29/8.31 c setppc : 100 5 25 1 0 0 74 0 0 0
8.29/8.31 c and : 1480 14 25 1 0 0 1445 439 0 0
8.29/8.31 c linear : 1+ 6 25 1 0 0 0 0 0 0
8.29/8.31 c logicor : 50 5 7 1 0 0 4 0 0 0
8.29/8.31 c countsols : 0 0 0 1 0 0 0 0 0 0
8.29/8.31 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.29/8.31 c integral : 5.18 0.00 0.00 5.18 0.00
8.29/8.31 c knapsack : 0.00 0.00 0.00 0.00 0.00
8.29/8.31 c setppc : 0.00 0.00 0.00 0.00 0.00
8.29/8.31 c and : 0.03 0.01 0.02 0.00 0.00
8.29/8.31 c linear : 0.00 0.00 0.00 0.00 0.00
8.29/8.31 c logicor : 0.00 0.00 0.00 0.00 0.00
8.29/8.31 c countsols : 0.00 0.00 0.00 0.00 0.00
8.29/8.31 c Propagators : Time Calls Cutoffs DomReds
8.29/8.31 c vbounds : 0.00 1 0 0
8.29/8.31 c rootredcost : 0.00 0 0 0
8.29/8.31 c pseudoobj : 0.00 0 0 0
8.29/8.31 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.29/8.31 c propagation : 0.00 0 0 0 0.0 0 0.0 -
8.29/8.31 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
8.29/8.31 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.29/8.31 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.29/8.31 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.29/8.31 c applied globally : - - - 0 0.0 - - -
8.29/8.31 c applied locally : - - - 0 0.0 - - -
8.29/8.31 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.29/8.31 c cut pool : 0.00 4 - - 8 - (maximal pool size: 85)
8.29/8.31 c redcost : 0.00 14 0 0 0 0
8.29/8.31 c impliedbounds : 0.00 5 0 0 21 0
8.29/8.31 c intobj : 0.00 0 0 0 0 0
8.29/8.31 c cgmip : 0.00 0 0 0 0 0
8.29/8.31 c gomory : 0.88 5 0 0 887 0
8.29/8.31 c strongcg : 0.62 5 0 0 1553 0
8.29/8.31 c cmir : 0.00 0 0 0 0 0
8.29/8.31 c flowcover : 0.00 0 0 0 0 0
8.29/8.31 c clique : 0.02 5 0 0 13 0
8.29/8.31 c zerohalf : 0.00 0 0 0 0 0
8.29/8.31 c mcf : 0.03 2 0 0 6 0
8.29/8.31 c rapidlearning : 0.33 1 0 0 0 73
8.29/8.31 c Pricers : Time Calls Vars
8.29/8.31 c problem variables: 0.00 0 0
8.29/8.31 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.29/8.31 c relpscost : 5.18 9 0 0 0 0 18
8.29/8.31 c pscost : 0.00 0 0 0 0 0 0
8.29/8.31 c inference : 0.00 0 0 0 0 0 0
8.29/8.31 c mostinf : 0.00 0 0 0 0 0 0
8.29/8.31 c leastinf : 0.00 0 0 0 0 0 0
8.29/8.31 c fullstrong : 0.00 0 0 0 0 0 0
8.29/8.31 c allfullstrong : 0.00 0 0 0 0 0 0
8.29/8.31 c random : 0.00 0 0 0 0 0 0
8.29/8.31 c Primal Heuristics : Time Calls Found
8.29/8.31 c LP solutions : 0.00 - 1
8.29/8.31 c pseudo solutions : 0.00 - 0
8.29/8.31 c trivial : 0.00 1 0
8.29/8.31 c simplerounding : 0.00 0 0
8.29/8.31 c zirounding : 0.00 0 0
8.29/8.31 c rounding : 0.00 0 0
8.29/8.31 c shifting : 0.00 0 0
8.29/8.31 c intshifting : 0.00 0 0
8.29/8.31 c oneopt : 0.00 0 0
8.29/8.31 c twoopt : 0.00 0 0
8.29/8.31 c fixandinfer : 0.00 0 0
8.29/8.31 c feaspump : 0.00 0 0
8.29/8.31 c coefdiving : 0.00 0 0
8.29/8.31 c pscostdiving : 0.00 0 0
8.29/8.31 c fracdiving : 0.00 0 0
8.29/8.31 c veclendiving : 0.00 0 0
8.29/8.31 c intdiving : 0.00 0 0
8.29/8.31 c actconsdiving : 0.00 0 0
8.29/8.31 c objpscostdiving : 0.00 0 0
8.29/8.31 c rootsoldiving : 0.00 0 0
8.29/8.31 c linesearchdiving : 0.00 0 0
8.29/8.31 c guideddiving : 0.00 0 0
8.29/8.31 c octane : 0.00 0 0
8.29/8.31 c rens : 0.00 0 0
8.29/8.31 c rins : 0.00 0 0
8.29/8.31 c localbranching : 0.00 0 0
8.29/8.31 c mutation : 0.00 0 0
8.29/8.31 c crossover : 0.00 0 0
8.29/8.31 c dins : 0.00 0 0
8.29/8.31 c undercover : 0.00 0 0
8.29/8.31 c nlp : 0.00 0 0
8.29/8.31 c trysol : 0.00 0 0
8.29/8.31 c LP : Time Calls Iterations Iter/call Iter/sec
8.29/8.31 c primal LP : 0.05 0 0 0.00 0.00
8.29/8.31 c dual LP : 0.41 25 1514 60.56 3692.68
8.29/8.31 c lex dual LP : 0.00 0 0 0.00 -
8.29/8.31 c barrier LP : 0.00 0 0 0.00 -
8.29/8.31 c diving/probing LP: 0.00 0 0 0.00 -
8.29/8.31 c strong branching : 5.18 78 17687 226.76 3414.48
8.29/8.31 c (at root node) : - 9 8065 896.11 -
8.29/8.31 c conflict analysis: 0.00 0 0 0.00 -
8.29/8.31 c B&B Tree :
8.29/8.31 c number of runs : 1
8.29/8.31 c nodes : 10
8.29/8.31 c nodes (total) : 10
8.29/8.31 c nodes left : 0
8.29/8.31 c max depth : 9
8.29/8.31 c max depth (total): 9
8.29/8.31 c backtracks : 0 (0.0%)
8.29/8.31 c delayed cutoffs : 0
8.29/8.31 c repropagations : 0 (0 domain reductions, 0 cutoffs)
8.29/8.31 c avg switch length: 2.00
8.29/8.31 c switching time : 0.07
8.29/8.31 c Solution :
8.29/8.31 c Solutions found : 1 (1 improvements)
8.29/8.31 c First Solution : +0.00000000000000e+00 (in run 1, after 10 nodes, 7.79 seconds, depth 9, found by <relaxation>)
8.29/8.31 c Primal Bound : +0.00000000000000e+00 (in run 1, after 10 nodes, 7.79 seconds, depth 9, found by <relaxation>)
8.29/8.31 c Dual Bound : +0.00000000000000e+00
8.29/8.31 c Gap : 0.00 %
8.29/8.31 c Root Dual Bound : +0.00000000000000e+00
8.29/8.31 c Root Iterations : 379
8.29/8.33 c Time complete: 8.32.