0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870617-1245213970.opb>
0.00/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.00/0.04 c No objective function, only one solution is needed.
0.00/0.04 c start presolving problem
0.00/0.04 c presolving:
0.09/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11828 impls, 100 clqs
0.30/0.31 c presolving (2 rounds):
0.30/0.31 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.30/0.31 c 11828 implications, 100 cliques
0.30/0.31 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.30/0.31 c 1 constraints of type <knapsack>
0.30/0.31 c 100 constraints of type <setppc>
0.30/0.31 c 1466 constraints of type <and>
0.30/0.31 c 1 constraints of type <linear>
0.30/0.31 c 50 constraints of type <logicor>
0.30/0.31 c transformed objective value is always integral (scale: 1)
0.30/0.31 c Presolving Time: 0.12
0.30/0.31 c SATUNSAT-NLC
0.30/0.31 c -----------------------------------------------------------------------------------------------
0.30/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.30/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.30/0.31 c separating/flowcover/freq = c -1
0.30/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.30/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.30/0.31 c separating/cmir/freq = c -1
0.30/0.31 c # additional number of allowed LP iterations
0.30/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.30/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.30/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.30/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.31 c heuristics/veclendiving/freq = c -1
0.30/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.30/0.32 c heuristics/simplerounding/freq = c -1
0.30/0.32 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/shifting/freq = c -1
0.30/0.32 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.30/0.32 c heuristics/rounding/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.30/0.32 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.30/0.32 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.30/0.32 c heuristics/rootsoldiving/freq = c -1
0.30/0.32 c # number of nodes added to the contingent of the total nodes
0.30/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.30/0.32 c heuristics/rens/nodesofs = c 2000
0.30/0.32 c # minimum percentage of integer variables that have to be fixable
0.30/0.32 c # [type: real, range: [0,1], default: 0.5]
0.30/0.32 c heuristics/rens/minfixingrate = c 0.3
0.30/0.32 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.30/0.32 c heuristics/rens/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.30/0.32 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/pscostdiving/freq = c -1
0.30/0.32 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.30/0.32 c heuristics/oneopt/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to total iteration number
0.30/0.32 c # [type: real, range: [0,1], default: 0.01]
0.30/0.32 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.30/0.32 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.30/0.32 c heuristics/objpscostdiving/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.30/0.32 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/linesearchdiving/freq = c -1
0.30/0.32 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/intshifting/freq = c -1
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/intdiving/maxlpiterquot = c 0.075
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/guideddiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.30/0.32 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/guideddiving/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/fracdiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.30/0.32 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/fracdiving/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/feaspump/maxlpiterofs = c 2000
0.30/0.32 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.30/0.32 c heuristics/feaspump/freq = c -1
0.30/0.32 c # minimum percentage of integer variables that have to be fixed
0.30/0.32 c # [type: real, range: [0,1], default: 0.666]
0.30/0.32 c heuristics/crossover/minfixingrate = c 0.5
0.30/0.32 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.30/0.32 c # [type: real, range: [0,1], default: 0.1]
0.30/0.32 c heuristics/crossover/nodesquot = c 0.15
0.30/0.32 c # number of nodes without incumbent change that heuristic should wait
0.30/0.32 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.30/0.32 c heuristics/crossover/nwaitingnodes = c 100
0.30/0.32 c # number of nodes added to the contingent of the total nodes
0.30/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.30/0.32 c heuristics/crossover/nodesofs = c 750
0.30/0.32 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 30]
0.30/0.32 c heuristics/crossover/freq = c -1
0.30/0.32 c # additional number of allowed LP iterations
0.30/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.30/0.32 c heuristics/coefdiving/maxlpiterofs = c 1500
0.30/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.30/0.32 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.30/0.32 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.30/0.32 c heuristics/coefdiving/freq = c -1
0.30/0.32 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.30/0.32 c presolving/probing/maxrounds = c 0
0.30/0.32 c # should presolving try to simplify knapsacks
0.30/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.30/0.32 c constraints/knapsack/simplifyinequalities = c TRUE
0.30/0.32 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.30/0.32 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.30/0.32 c constraints/knapsack/disaggregation = c FALSE
0.30/0.32 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.30/0.32 c constraints/knapsack/maxnumcardlift = c 0
0.30/0.32 c # should presolving try to simplify inequalities
0.30/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.30/0.32 c constraints/linear/simplifyinequalities = c TRUE
0.30/0.32 c # maximal number of separation rounds in the root node (-1: unlimited)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.30/0.32 c separating/maxroundsroot = c 5
0.30/0.32 c # maximal number of separation rounds per node (-1: unlimited)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 5]
0.30/0.32 c separating/maxrounds = c 1
0.30/0.32 c # solving stops, if the given number of solutions were found (-1: no limit)
0.30/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.30/0.32 c limits/solutions = c 1
0.30/0.32 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.30/0.32 c limits/memory = c 1620
0.30/0.32 c # maximal time in seconds to run
0.30/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.30/0.32 c limits/time = c 1791
0.30/0.32 c # frequency for displaying node information lines
0.30/0.32 c # [type: int, range: [-1,2147483647], default: 100]
0.30/0.32 c display/freq = c 10000
0.30/0.32 c -----------------------------------------------------------------------------------------------
0.30/0.32 c start solving problem
0.30/0.32 c
0.30/0.35 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.30/0.35 c 0.2s| 1 | 0 | 23 |7053k| 0 | 18 |1566 |1618 |1618 |1566 |3084 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.39/0.50 c 0.3s| 1 | 0 | 28 |7066k| 0 | 19 |1566 |1618 |1618 |1566 |3086 | 2 | 0 | 0 | 1.000000e+01 | -- | Inf
0.59/0.66 c 0.5s| 1 | 0 | 54 |7096k| 0 | 22 |1566 |1618 |1618 |1566 |3087 | 3 | 0 | 0 | 1.000000e+01 | -- | Inf
0.81/0.84 c 0.6s| 1 | 0 | 137 |7155k| 0 | 22 |1566 |1618 |1618 |1566 |3089 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
1.19/1.21 c 1.0s| 1 | 0 | 161 |7193k| 0 | 25 |1566 |1618 |1618 |1566 |3090 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
1.49/1.56 c 1.4s| 1 | 0 | 365 |7232k| 0 | 26 |1566 |1618 |1618 |1566 |3091 | 7 | 0 | 0 | 1.000000e+01 | -- | Inf
4.59/4.66 c 4.4s| 1 | 2 | 365 |7233k| 0 | 26 |1566 |1618 |1618 |1566 |3091 | 7 | 0 | 26 | 1.000000e+01 | -- | Inf
4.89/4.98 c * 4.8s| 12 | 5 | 849 |7835k| 5 | - |1566 |1618 | 187 |1566 | 351 | 371 | 0 | 103 | 1.000000e+01 | 1.400000e+01 | 40.00%
4.89/4.98 c
4.89/4.98 c SCIP Status : solving was interrupted [solution limit reached]
4.89/4.98 c Solving Time (sec) : 4.75
4.89/4.98 c Solving Nodes : 12
4.89/4.98 c Primal Bound : +1.40000000000001e+01 (1 solutions)
4.89/4.98 c Dual Bound : +1.00000000000001e+01
4.89/4.98 c Gap : 40.00 %
4.89/4.98 c NODE 12
4.89/4.98 c DUAL BOUND 10
4.89/4.98 c PRIMAL BOUND 14
4.89/4.98 c GAP 0.4
4.89/4.98 s SATISFIABLE
4.89/4.98 v -x59 x66 -x97 -x60 -x58 -x56 -x96 -x87 -x72 -x90 -x98 -x94 -x93 -x82 -x62 -x70 -x51 -x99 -x91 x89 -x85 x78 -x67 -x63 -x61 -x57
4.89/4.98 v -x81 -x71 -x83 -x73 -x74 -x80 -x69 -x68 -x100 x92 -x53 -x54 x65 -x55 -x95 -x86 -x79 -x76 -x88 -x64 -x77 -x75 -x84 -x52 -x50 -x49
4.89/4.98 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
4.89/4.98 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2 -x1
4.89/4.98 c SCIP Status : solving was interrupted [solution limit reached]
4.89/4.98 c Solving Time : 4.75
4.89/4.98 c Original Problem :
4.89/4.98 c Problem name : HOME/instance-1870617-1245213970.opb
4.89/4.98 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 1618 initial, 1618 maximal
4.89/4.98 c Presolved Problem :
4.89/4.98 c Problem name : t_HOME/instance-1870617-1245213970.opb
4.89/4.98 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 1618 initial, 1618 maximal
4.89/4.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.89/4.98 c trivial : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c implics : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c probing : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c knapsack : 0.01 0 0 0 0 0 0 0 0
4.89/4.98 c setppc : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c and : 0.10 0 0 0 0 0 0 0 0
4.89/4.98 c linear : 0.01 0 0 0 0 0 0 0 0
4.89/4.98 c logicor : 0.00 0 0 0 0 0 0 0 0
4.89/4.98 c root node : - 0 - - 0 - - - -
4.89/4.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.89/4.98 c integral : 0 0 0 36 0 0 1 0 0 16
4.89/4.98 c knapsack : 1 5 27 27 0 0 0 0 0 0
4.89/4.98 c setppc : 100 5 27 27 0 0 136 0 0 0
4.89/4.98 c and : 1466 16 27 27 0 0 2733 364 0 0
4.89/4.98 c linear : 1 5 27 1 0 0 0 0 0 0
4.89/4.98 c logicor : 50 5 10 1 0 0 4 0 0 0
4.89/4.98 c countsols : 0 0 0 1 0 0 0 0 0 0
4.89/4.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.89/4.98 c integral : 3.20 0.00 0.00 3.20 0.00
4.89/4.98 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c setppc : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c and : 0.04 0.03 0.01 0.00 0.00
4.89/4.98 c linear : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c logicor : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c countsols : 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c Propagators : Time Calls Cutoffs DomReds
4.89/4.98 c rootredcost : 0.00 0 0 0
4.89/4.98 c pseudoobj : 0.00 28 0 0
4.89/4.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.98 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.98 c infeasible LP : 0.00 3 0 0 0.0 0 0.0 0
4.89/4.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.98 c applied globally : - - - 0 0.0 - - -
4.89/4.98 c applied locally : - - - 0 0.0 - - -
4.89/4.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.98 c cut pool : 0.00 4 - - 0 - (maximal pool size: 50)
4.89/4.98 c redcost : 0.01 16 0 0 0 0
4.89/4.98 c impliedbounds : 0.00 5 0 0 0 0
4.89/4.98 c intobj : 0.00 0 0 0 0 0
4.89/4.98 c gomory : 0.51 5 0 0 2007 0
4.89/4.98 c strongcg : 0.48 5 0 0 2439 0
4.89/4.98 c cmir : 0.00 0 0 0 0 0
4.89/4.98 c flowcover : 0.00 0 0 0 0 0
4.89/4.98 c clique : 0.00 5 0 0 0 0
4.89/4.98 c zerohalf : 0.00 0 0 0 0 0
4.89/4.98 c mcf : 0.03 2 0 0 0 0
4.89/4.98 c Pricers : Time Calls Vars
4.89/4.98 c problem variables: 0.00 0 0
4.89/4.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.98 c relpscost : 3.20 9 0 1 0 0 16
4.89/4.98 c pscost : 0.00 0 0 0 0 0 0
4.89/4.98 c inference : 0.00 0 0 0 0 0 0
4.89/4.98 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.98 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.98 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c random : 0.00 0 0 0 0 0 0
4.89/4.98 c Primal Heuristics : Time Calls Found
4.89/4.98 c LP solutions : 0.00 - 1
4.89/4.98 c pseudo solutions : 0.00 - 0
4.89/4.98 c simplerounding : 0.00 0 0
4.89/4.98 c rounding : 0.00 0 0
4.89/4.98 c shifting : 0.00 0 0
4.89/4.98 c intshifting : 0.00 0 0
4.89/4.98 c oneopt : 0.00 0 0
4.89/4.98 c fixandinfer : 0.00 0 0
4.89/4.98 c feaspump : 0.00 0 0
4.89/4.98 c coefdiving : 0.00 0 0
4.89/4.98 c pscostdiving : 0.00 0 0
4.89/4.98 c fracdiving : 0.00 0 0
4.89/4.98 c veclendiving : 0.00 0 0
4.89/4.98 c intdiving : 0.00 0 0
4.89/4.98 c actconsdiving : 0.00 0 0
4.89/4.98 c objpscostdiving : 0.00 0 0
4.89/4.98 c rootsoldiving : 0.00 0 0
4.89/4.98 c linesearchdiving : 0.00 0 0
4.89/4.98 c guideddiving : 0.00 0 0
4.89/4.98 c octane : 0.00 0 0
4.89/4.98 c rens : 0.00 0 0
4.89/4.98 c rins : 0.00 0 0
4.89/4.98 c localbranching : 0.00 0 0
4.89/4.98 c mutation : 0.00 0 0
4.89/4.98 c crossover : 0.00 0 0
4.89/4.98 c dins : 0.00 0 0
4.89/4.98 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.98 c primal LP : 0.01 0 0 0.00 0.00
4.89/4.98 c dual LP : 0.25 55 849 15.44 3396.00
4.89/4.98 c barrier LP : 0.00 0 0 0.00 -
4.89/4.98 c diving/probing LP: 0.00 0 0 0.00 -
4.89/4.98 c strong branching : 3.20 103 7871 76.42 2459.69
4.89/4.98 c (at root node) : - 26 6109 234.96 -
4.89/4.98 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.98 c B&B Tree :
4.89/4.98 c number of runs : 1
4.89/4.98 c nodes : 12
4.89/4.98 c nodes (total) : 12
4.89/4.98 c nodes left : 5
4.89/4.98 c max depth : 5
4.89/4.98 c max depth (total): 5
4.89/4.98 c backtracks : 1 (8.3%)
4.89/4.98 c delayed cutoffs : 0
4.89/4.98 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.89/4.98 c avg switch length: 1.50
4.89/4.98 c switching time : 0.02
4.89/4.98 c Solution :
4.89/4.98 c Solutions found : 1 (1 improvements)
4.89/4.98 c Primal Bound : +1.40000000000001e+01 (in run 1, after 12 nodes, 4.75 seconds, depth 5, found by <relaxation>)
4.89/4.98 c Dual Bound : +1.00000000000001e+01
4.89/4.98 c Gap : 40.00 %
4.89/4.98 c Root Dual Bound : +1.00000000000000e+01
4.99/5.01 c Time complete: 5.