0.00/0.00 c SCIP version 2.0.1.4 [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-3484746-1307788423.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, 11812 impls, 100 clqs
0.04/0.06 c presolving (2 rounds):
0.04/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.04/0.06 c 11812 implications, 100 cliques
0.04/0.06 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.04/0.06 c 1 constraints of type <knapsack>
0.04/0.06 c 150 constraints of type <setppc>
0.04/0.06 c 1464 constraints of type <and>
0.04/0.06 c 1 constraints of type <linear>
0.04/0.06 c transformed objective value is always integral (scale: 1)
0.04/0.06 c Presolving Time: 0.05
0.04/0.06 c - non default parameters ----------------------------------------------------------------------
0.04/0.06 c # SCIP version 2.0.1.4
0.04/0.06 c
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = 10000
0.04/0.06 c
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = 1797
0.04/0.06 c
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = 13950
0.04/0.06 c
0.04/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c limits/solutions = 1
0.04/0.06 c
0.04/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.04/0.06 c separating/maxrounds = 1
0.04/0.06 c
0.04/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/maxroundsroot = 5
0.04/0.06 c
0.04/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.04/0.06 c # [type: int, range: [1,2], default: 1]
0.04/0.06 c timing/clocktype = 2
0.04/0.06 c
0.04/0.06 c # belongs reading time to solving time?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c timing/reading = TRUE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/indicator/addCouplingCons = TRUE
0.04/0.06 c
0.04/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.04/0.06 c constraints/knapsack/disaggregation = FALSE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c presolving/probing/maxrounds = 0
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/coefdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.04/0.06 c heuristics/crossover/freq = -1
0.04/0.06 c
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/crossover/nodesofs = 750
0.04/0.06 c
0.04/0.06 c # number of nodes without incumbent change that heuristic should wait
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.04/0.06 c heuristics/crossover/nwaitingnodes = 100
0.04/0.06 c
0.04/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.04/0.06 c # [type: real, range: [0,1], default: 0.1]
0.04/0.06 c heuristics/crossover/nodesquot = 0.15
0.04/0.06 c
0.04/0.06 c # minimum percentage of integer variables that have to be fixed
0.04/0.06 c # [type: real, range: [0,1], default: 0.666]
0.04/0.06 c heuristics/crossover/minfixingrate = 0.5
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/feaspump/freq = -1
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/fracdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/guideddiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/intshifting/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/linesearchdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/objpscostdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.04/0.06 c # [type: real, range: [0,1], default: 0.01]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/oneopt/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/pscostdiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/rens/freq = -1
0.04/0.06 c
0.04/0.06 c # minimum percentage of integer variables that have to be fixable
0.04/0.06 c # [type: real, range: [0,1], default: 0.5]
0.04/0.06 c heuristics/rens/minfixingrate = 0.3
0.04/0.06 c
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/rens/nodesofs = 2000
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/rootsoldiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/rounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/shiftandpropagate/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/shifting/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/simplerounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/subnlp/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/trivial/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/trysol/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/undercover/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/veclendiving/freq = -1
0.04/0.06 c
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.04/0.06 c
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/zirounding/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/cmir/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/flowcover/freq = -1
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/rapidlearning/freq = 0
0.04/0.06 c
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving
0.04/0.06 c
0.04/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.07 c 0.1s| 1 | 0 | 55 | - |6643k| 0 | 47 |1564 |1616 |1564 |3080 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.3s| 1 | 0 | 108 | - |6873k| 0 | 80 |1564 |1656 |1564 |3089 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 131 | - |7071k| 0 | 85 |1564 |1656 |1564 |3098 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 153 | - |7141k| 0 | 89 |1564 |1656 |1564 |3100 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 187 | - |7199k| 0 | 82 |1564 |1656 |1564 |3102 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.11 c 1.1s| 1 | 0 | 203 | - |7208k| 0 | 79 |1564 |1656 |1564 |3105 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.59 c 2.6s| 1 | 2 | 203 | - |7209k| 0 | 79 |1564 |1656 |1564 |3105 | 25 | 0 | 16 | 0.000000e+00 | -- | Inf
2.69/2.70 c * 2.7s| 11 | 0 | 557 | 35.4 |7735k| 8 | - |1564 |1659 |1564 | 279 | 191 | 3 | 79 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.69/2.70 c
2.69/2.70 c SCIP Status : problem is solved [optimal solution found]
2.69/2.70 c Solving Time (sec) : 2.71
2.69/2.70 c Solving Nodes : 11
2.69/2.70 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.69/2.70 c Dual Bound : +0.00000000000000e+00
2.69/2.70 c Gap : 0.00 %
2.69/2.70 s SATISFIABLE
2.69/2.70 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 -x62
2.69/2.70 v -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
2.69/2.70 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.69/2.70 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.69/2.70 c SCIP Status : problem is solved [optimal solution found]
2.69/2.70 c Total Time : 2.71
2.69/2.70 c solving : 2.71
2.69/2.70 c presolving : 0.05 (included in solving)
2.69/2.70 c reading : 0.00 (included in solving)
2.69/2.70 c Original Problem :
2.69/2.70 c Problem name : HOME/instance-3484746-1307788423.opb
2.69/2.70 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 152 initial, 152 maximal
2.69/2.70 c Presolved Problem :
2.69/2.70 c Problem name : t_HOME/instance-3484746-1307788423.opb
2.69/2.70 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 1616 initial, 1659 maximal
2.69/2.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.69/2.70 c trivial : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c setppc : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c and : 0.04 0 0 0 0 0 0 0 0 0
2.69/2.70 c linear : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c logicor : 0.00 0 0 0 0 0 0 0 0 0
2.69/2.70 c root node : - 0 - - 0 - - - - -
2.69/2.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.69/2.70 c integral : 0 0 0 10 0 3 0 0 1 0 0 16
2.69/2.70 c knapsack : 1 5 32 1 0 0 0 0 0 0 0 0
2.69/2.70 c setppc : 150 5 32 1 0 0 77 1 99 0 0 0
2.69/2.70 c and : 1464 13 30 1 0 0 70 0 1480 167 0 0
2.69/2.70 c linear : 1+ 6 31 1 0 0 1 0 1 0 0 0
2.69/2.70 c logicor : 0+ 0 2 0 0 0 1 0 2 0 0 0
2.69/2.70 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
2.69/2.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.69/2.70 c integral : 1.57 0.00 0.00 1.57 0.00 0.00 0.00
2.69/2.70 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.69/2.70 c vbounds : 0 0 0 0
2.69/2.70 c rootredcost : 0 0 0 0
2.69/2.70 c pseudoobj : 0 0 0 0
2.69/2.70 c Propagator Timings : TotalTime Propagate Resprop
2.69/2.70 c vbounds : 0.00 0.00 0.00
2.69/2.70 c rootredcost : 0.00 0.00 0.00
2.69/2.70 c pseudoobj : 0.00 0.00 0.00
2.69/2.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.70 c propagation : 0.00 1 1 1 3.0 0 0.0 -
2.69/2.70 c infeasible LP : 0.00 1 1 6 52.3 0 0.0 0
2.69/2.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.71 c applied globally : - - - 3 33.0 - - -
2.69/2.71 c applied locally : - - - 0 0.0 - - -
2.69/2.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.71 c cut pool : 0.00 4 - - 51 - (maximal pool size: 158)
2.69/2.71 c redcost : 0.00 13 0 0 0 0
2.69/2.71 c impliedbounds : 0.00 5 0 0 2 0
2.69/2.71 c intobj : 0.00 0 0 0 0 0
2.69/2.71 c gomory : 0.54 5 0 0 123 0
2.69/2.71 c cgmip : 0.00 0 0 0 0 0
2.69/2.71 c closecuts : 0.00 0 0 0 0 0
2.69/2.71 c strongcg : 0.40 5 0 0 1749 0
2.69/2.71 c cmir : 0.00 0 0 0 0 0
2.69/2.71 c flowcover : 0.00 0 0 0 0 0
2.69/2.71 c clique : 0.01 5 0 0 15 0
2.69/2.71 c zerohalf : 0.00 0 0 0 0 0
2.69/2.71 c mcf : 0.01 2 0 0 0 0
2.69/2.71 c oddcycle : 0.00 0 0 0 0 0
2.69/2.71 c rapidlearning : 0.06 1 0 0 0 40
2.69/2.71 c Pricers : Time Calls Vars
2.69/2.71 c problem variables: 0.00 0 0
2.69/2.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.71 c relpscost : 1.57 9 0 1 0 0 16
2.69/2.71 c pscost : 0.00 0 0 0 0 0 0
2.69/2.71 c inference : 0.00 0 0 0 0 0 0
2.69/2.71 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.71 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.71 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.71 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.71 c random : 0.00 0 0 0 0 0 0
2.69/2.71 c Primal Heuristics : Time Calls Found
2.69/2.71 c LP solutions : 0.00 - 1
2.69/2.71 c pseudo solutions : 0.00 - 0
2.69/2.71 c trivial : 0.00 1 0
2.69/2.71 c shiftandpropagate: 0.00 0 0
2.69/2.71 c simplerounding : 0.00 0 0
2.69/2.71 c zirounding : 0.00 0 0
2.69/2.71 c rounding : 0.00 0 0
2.69/2.71 c shifting : 0.00 0 0
2.69/2.71 c intshifting : 0.00 0 0
2.69/2.71 c oneopt : 0.00 0 0
2.69/2.71 c twoopt : 0.00 0 0
2.69/2.71 c fixandinfer : 0.00 0 0
2.69/2.71 c feaspump : 0.00 0 0
2.69/2.71 c clique : 0.00 0 0
2.69/2.71 c coefdiving : 0.00 0 0
2.69/2.71 c pscostdiving : 0.00 0 0
2.69/2.71 c fracdiving : 0.00 0 0
2.69/2.71 c veclendiving : 0.00 0 0
2.69/2.71 c intdiving : 0.00 0 0
2.69/2.71 c actconsdiving : 0.00 0 0
2.69/2.71 c objpscostdiving : 0.00 0 0
2.69/2.71 c rootsoldiving : 0.00 0 0
2.69/2.71 c linesearchdiving : 0.00 0 0
2.69/2.71 c guideddiving : 0.00 0 0
2.69/2.71 c octane : 0.00 0 0
2.69/2.71 c rens : 0.00 0 0
2.69/2.71 c rins : 0.00 0 0
2.69/2.71 c localbranching : 0.00 0 0
2.69/2.71 c mutation : 0.00 0 0
2.69/2.71 c crossover : 0.00 0 0
2.69/2.71 c dins : 0.00 0 0
2.69/2.71 c vbounds : 0.00 0 0
2.69/2.71 c undercover : 0.00 0 0
2.69/2.71 c subnlp : 0.00 0 0
2.69/2.71 c trysol : 0.00 0 0
2.69/2.71 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.71 c primal LP : 0.00 0 0 0.00 -
2.69/2.71 c dual LP : 0.04 24 557 23.21 12783.15
2.69/2.71 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.71 c barrier LP : 0.00 0 0 0.00 -
2.69/2.71 c diving/probing LP: 0.00 0 0 0.00 -
2.69/2.71 c strong branching : 1.57 79 13344 168.91 8524.18
2.69/2.71 c (at root node) : - 16 11753 734.56 -
2.69/2.71 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.71 c B&B Tree :
2.69/2.71 c number of runs : 1
2.69/2.71 c nodes : 11
2.69/2.71 c nodes (total) : 11
2.69/2.71 c nodes left : 0
2.69/2.71 c max depth : 8
2.69/2.71 c max depth (total): 8
2.69/2.71 c backtracks : 0 (0.0%)
2.69/2.71 c delayed cutoffs : 0
2.69/2.71 c repropagations : 2 (18 domain reductions, 0 cutoffs)
2.69/2.71 c avg switch length: 2.00
2.69/2.71 c switching time : 0.00
2.69/2.71 c Solution :
2.69/2.71 c Solutions found : 1 (1 improvements)
2.69/2.71 c First Solution : +0.00000000000000e+00 (in run 1, after 11 nodes, 2.70 seconds, depth 8, found by <relaxation>)
2.69/2.71 c Primal Bound : +0.00000000000000e+00 (in run 1, after 11 nodes, 2.70 seconds, depth 8, found by <relaxation>)
2.69/2.71 c Dual Bound : +0.00000000000000e+00
2.69/2.71 c Gap : 0.00 %
2.69/2.71 c Root Dual Bound : +0.00000000000000e+00
2.69/2.71 c Root Iterations : 203
2.69/2.71 c Time complete: 2.71.