0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870616-1245213968.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.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 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.29/0.31 c presolving (2 rounds):
0.29/0.31 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.31 c 11828 implications, 100 cliques
0.29/0.31 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.29/0.31 c 1 constraints of type <knapsack>
0.29/0.31 c 100 constraints of type <setppc>
0.29/0.31 c 1466 constraints of type <and>
0.29/0.31 c 1 constraints of type <linear>
0.29/0.31 c 50 constraints of type <logicor>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.12
0.29/0.31 c SATUNSAT-NLC
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = c -1
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = c -1
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/rens/nodesofs = c 2000
0.29/0.31 c # minimum percentage of integer variables that have to be fixable
0.29/0.31 c # [type: real, range: [0,1], default: 0.5]
0.29/0.31 c heuristics/rens/minfixingrate = c 0.3
0.29/0.31 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/rens/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/pscostdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/oneopt/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.31 c # [type: real, range: [0,1], default: 0.01]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/objpscostdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/linesearchdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/intshifting/freq = c -1
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/guideddiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/fracdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.31 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/feaspump/freq = c -1
0.29/0.31 c # minimum percentage of integer variables that have to be fixed
0.29/0.31 c # [type: real, range: [0,1], default: 0.666]
0.29/0.31 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.31 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.31 c # [type: real, range: [0,1], default: 0.1]
0.29/0.31 c heuristics/crossover/nodesquot = c 0.15
0.29/0.31 c # number of nodes without incumbent change that heuristic should wait
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.31 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/crossover/nodesofs = c 750
0.29/0.31 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.31 c heuristics/crossover/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/coefdiving/freq = c -1
0.29/0.31 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c presolving/probing/maxrounds = c 0
0.29/0.31 c # should presolving try to simplify knapsacks
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.31 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.31 c constraints/knapsack/disaggregation = c FALSE
0.29/0.31 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.31 c # should presolving try to simplify inequalities
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.31 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c separating/maxroundsroot = c 5
0.29/0.31 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.31 c separating/maxrounds = c 1
0.29/0.31 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c limits/solutions = c 1
0.29/0.31 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/memory = c 1620
0.29/0.31 c # maximal time in seconds to run
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/time = c 1791
0.29/0.31 c # frequency for displaying node information lines
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.31 c display/freq = c 10000
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c start solving problem
0.29/0.31 c
0.29/0.34 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.2s| 1 | 0 | 29 |7053k| 0 | 20 |1566 |1618 |1618 |1566 |3084 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.49/0.51 c 0.3s| 1 | 0 | 34 |7065k| 0 | 21 |1566 |1618 |1618 |1566 |3085 | 1 | 0 | 0 | 1.000000e+01 | -- | Inf
0.59/0.66 c 0.5s| 1 | 0 | 38 |7089k| 0 | 22 |1566 |1618 |1618 |1566 |3086 | 2 | 0 | 0 | 1.000000e+01 | -- | Inf
0.79/0.82 c 0.6s| 1 | 0 | 47 |7128k| 0 | 23 |1566 |1618 |1618 |1566 |3088 | 4 | 0 | 0 | 1.000000e+01 | -- | Inf
1.09/1.15 c 0.9s| 1 | 0 | 59 |7156k| 0 | 23 |1566 |1618 |1618 |1566 |3089 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
1.39/1.48 c 1.3s| 1 | 0 | 73 |7195k| 0 | 23 |1566 |1618 |1618 |1566 |3090 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
2.29/2.31 c 2.1s| 1 | 2 | 73 |7196k| 0 | 23 |1566 |1618 |1618 |1566 |3090 | 6 | 0 | 23 | 1.000000e+01 | -- | Inf
2.39/2.43 c * 2.2s| 9 | 5 | 260 |7683k| 7 | - |1566 |1619 | 172 |1566 | 231 | 125 | 1 | 67 | 1.000000e+01 | 1.300000e+01 | 30.00%
2.39/2.43 c
2.39/2.43 c SCIP Status : solving was interrupted [solution limit reached]
2.39/2.43 c Solving Time (sec) : 2.21
2.39/2.43 c Solving Nodes : 9
2.39/2.43 c Primal Bound : +1.30000000000000e+01 (1 solutions)
2.39/2.43 c Dual Bound : +1.00000000000000e+01
2.39/2.43 c Gap : 30.00 %
2.39/2.43 c NODE 9
2.39/2.43 c DUAL BOUND 10
2.39/2.43 c PRIMAL BOUND 13
2.39/2.43 c GAP 0.3
2.39/2.43 s SATISFIABLE
2.39/2.43 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
2.39/2.43 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
2.39/2.43 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.39/2.43 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.39/2.43 c SCIP Status : solving was interrupted [solution limit reached]
2.39/2.43 c Solving Time : 2.21
2.39/2.43 c Original Problem :
2.39/2.43 c Problem name : HOME/instance-1870616-1245213968.opb
2.39/2.43 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 1618 initial, 1618 maximal
2.39/2.43 c Presolved Problem :
2.39/2.43 c Problem name : t_HOME/instance-1870616-1245213968.opb
2.39/2.43 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 1618 initial, 1619 maximal
2.39/2.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.43 c trivial : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c probing : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c setppc : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c and : 0.10 0 0 0 0 0 0 0 0
2.39/2.43 c linear : 0.01 0 0 0 0 0 0 0 0
2.39/2.43 c logicor : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c root node : - 0 - - 0 - - - -
2.39/2.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.43 c integral : 0 0 0 17 0 0 0 0 0 14
2.39/2.43 c knapsack : 1 5 26 10 0 0 0 0 0 0
2.39/2.43 c setppc : 100 5 26 10 0 1 63 0 0 0
2.39/2.43 c and : 1466 12 25 10 0 0 1369 119 0 0
2.39/2.43 c linear : 1 5 25 1 0 0 0 0 0 0
2.39/2.43 c logicor : 50+ 5 9 1 0 0 7 0 0 0
2.39/2.43 c countsols : 0 0 0 1 0 0 0 0 0 0
2.39/2.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.43 c integral : 0.88 0.00 0.00 0.88 0.00
2.39/2.43 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c setppc : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c and : 0.01 0.00 0.01 0.00 0.00
2.39/2.43 c linear : 0.01 0.00 0.01 0.00 0.00
2.39/2.43 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c Propagators : Time Calls Cutoffs DomReds
2.39/2.43 c rootredcost : 0.00 0 0 0
2.39/2.43 c pseudoobj : 0.00 27 0 0
2.39/2.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.43 c propagation : 0.00 1 1 1 3.0 0 0.0 -
2.39/2.43 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.43 c applied globally : - - - 1 3.0 - - -
2.39/2.43 c applied locally : - - - 0 0.0 - - -
2.39/2.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.43 c cut pool : 0.00 4 - - 13 - (maximal pool size: 43)
2.39/2.43 c redcost : 0.00 12 0 0 0 0
2.39/2.43 c impliedbounds : 0.00 5 0 0 0 0
2.39/2.43 c intobj : 0.00 0 0 0 0 0
2.39/2.43 c gomory : 0.55 5 0 0 1502 0
2.39/2.43 c strongcg : 0.49 5 0 0 2500 0
2.39/2.43 c cmir : 0.00 0 0 0 0 0
2.39/2.43 c flowcover : 0.00 0 0 0 0 0
2.39/2.43 c clique : 0.00 5 0 0 0 0
2.39/2.43 c zerohalf : 0.00 0 0 0 0 0
2.39/2.43 c mcf : 0.03 2 0 0 0 0
2.39/2.43 c Pricers : Time Calls Vars
2.39/2.43 c problem variables: 0.00 0 0
2.39/2.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.43 c relpscost : 0.88 7 0 0 0 0 14
2.39/2.43 c pscost : 0.00 0 0 0 0 0 0
2.39/2.43 c inference : 0.00 0 0 0 0 0 0
2.39/2.43 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.43 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.43 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c random : 0.00 0 0 0 0 0 0
2.39/2.43 c Primal Heuristics : Time Calls Found
2.39/2.43 c LP solutions : 0.01 - 1
2.39/2.43 c pseudo solutions : 0.00 - 0
2.39/2.43 c simplerounding : 0.00 0 0
2.39/2.43 c rounding : 0.00 0 0
2.39/2.43 c shifting : 0.00 0 0
2.39/2.43 c intshifting : 0.00 0 0
2.39/2.43 c oneopt : 0.00 0 0
2.39/2.43 c fixandinfer : 0.00 0 0
2.39/2.43 c feaspump : 0.00 0 0
2.39/2.43 c coefdiving : 0.00 0 0
2.39/2.43 c pscostdiving : 0.00 0 0
2.39/2.43 c fracdiving : 0.00 0 0
2.39/2.43 c veclendiving : 0.00 0 0
2.39/2.43 c intdiving : 0.00 0 0
2.39/2.43 c actconsdiving : 0.00 0 0
2.39/2.43 c objpscostdiving : 0.00 0 0
2.39/2.43 c rootsoldiving : 0.00 0 0
2.39/2.43 c linesearchdiving : 0.00 0 0
2.39/2.43 c guideddiving : 0.00 0 0
2.39/2.43 c octane : 0.00 0 0
2.39/2.43 c rens : 0.00 0 0
2.39/2.43 c rins : 0.00 0 0
2.39/2.43 c localbranching : 0.00 0 0
2.39/2.43 c mutation : 0.00 0 0
2.39/2.43 c crossover : 0.00 0 0
2.39/2.43 c dins : 0.00 0 0
2.39/2.43 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.43 c primal LP : 0.00 0 0 0.00 -
2.39/2.43 c dual LP : 0.04 29 260 8.97 6500.00
2.39/2.43 c barrier LP : 0.00 0 0 0.00 -
2.39/2.43 c diving/probing LP: 0.00 0 0 0.00 -
2.39/2.43 c strong branching : 0.88 67 2584 38.57 2936.36
2.39/2.43 c (at root node) : - 23 2258 98.17 -
2.39/2.43 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.43 c B&B Tree :
2.39/2.43 c number of runs : 1
2.39/2.43 c nodes : 9
2.39/2.43 c nodes (total) : 9
2.39/2.43 c nodes left : 5
2.39/2.43 c max depth : 7
2.39/2.43 c max depth (total): 7
2.39/2.43 c backtracks : 0 (0.0%)
2.39/2.43 c delayed cutoffs : 0
2.39/2.43 c repropagations : 1 (15 domain reductions, 0 cutoffs)
2.39/2.43 c avg switch length: 1.11
2.39/2.43 c switching time : 0.00
2.39/2.43 c Solution :
2.39/2.43 c Solutions found : 1 (1 improvements)
2.39/2.43 c Primal Bound : +1.30000000000000e+01 (in run 1, after 9 nodes, 2.20 seconds, depth 7, found by <relaxation>)
2.39/2.43 c Dual Bound : +1.00000000000000e+01
2.39/2.43 c Gap : 30.00 %
2.39/2.43 c Root Dual Bound : +1.00000000000000e+01
2.39/2.46 c Time complete: 2.45.