0.01/0.02 c SCIP version 1.1.0.7
0.01/0.02 c LP-Solver SoPlex 1.4.1
0.01/0.02 c user parameter file <scip.set> not found - using default parameters
0.01/0.02 c read problem <HOME/instance-1870596-1245213322.opb>
0.01/0.02 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.01/0.03 c No objective function, only one solution is needed.
0.01/0.03 c start presolving problem
0.01/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, 11812 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 11812 implications, 100 cliques
0.29/0.31 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 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 1464 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.11
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.1s| 1 | 0 | 26 |7044k| 0 | 20 |1564 |1616 |1616 |1564 |3080 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.39/0.50 c 0.3s| 1 | 0 | 31 |7053k| 0 | 21 |1564 |1616 |1616 |1564 |3081 | 1 | 0 | 0 | 1.000000e+01 | -- | Inf
0.59/0.64 c 0.4s| 1 | 0 | 34 |7067k| 0 | 21 |1564 |1616 |1616 |1564 |3083 | 3 | 0 | 0 | 1.000000e+01 | -- | Inf
0.79/0.81 c 0.6s| 1 | 0 | 37 |7097k| 0 | 22 |1564 |1616 |1616 |1564 |3084 | 4 | 0 | 0 | 1.000000e+01 | -- | Inf
1.09/1.10 c 0.9s| 1 | 0 | 65 |7119k| 0 | 22 |1564 |1616 |1616 |1564 |3085 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
1.39/1.46 c 1.2s| 1 | 0 | 119 |7143k| 0 | 24 |1564 |1616 |1616 |1564 |3086 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
3.19/3.29 c 3.1s| 1 | 2 | 119 |7144k| 0 | 24 |1564 |1616 |1616 |1564 |3086 | 6 | 0 | 24 | 1.000000e+01 | -- | Inf
3.39/3.46 c * 3.2s| 11 | 6 | 355 |7663k| 8 | - |1564 |1620 | 183 |1564 | 278 | 161 | 4 | 81 | 1.000000e+01 | 1.400000e+01 | 40.00%
3.39/3.46 c
3.39/3.46 c SCIP Status : solving was interrupted [solution limit reached]
3.39/3.46 c Solving Time (sec) : 3.22
3.39/3.46 c Solving Nodes : 11
3.39/3.46 c Primal Bound : +1.40000000000000e+01 (1 solutions)
3.39/3.46 c Dual Bound : +1.00000000000000e+01
3.39/3.46 c Gap : 40.00 %
3.39/3.46 c NODE 11
3.39/3.46 c DUAL BOUND 10
3.39/3.46 c PRIMAL BOUND 14
3.39/3.46 c GAP 0.4
3.39/3.46 s SATISFIABLE
3.39/3.46 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
3.39/3.46 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
3.39/3.46 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
3.39/3.46 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 -x1
3.39/3.46 c SCIP Status : solving was interrupted [solution limit reached]
3.39/3.46 c Solving Time : 3.22
3.39/3.46 c Original Problem :
3.39/3.46 c Problem name : HOME/instance-1870596-1245213322.opb
3.39/3.46 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.46 c Constraints : 1616 initial, 1616 maximal
3.39/3.46 c Presolved Problem :
3.39/3.46 c Problem name : t_HOME/instance-1870596-1245213322.opb
3.39/3.46 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.46 c Constraints : 1616 initial, 1620 maximal
3.39/3.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.39/3.46 c trivial : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c implics : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c probing : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c setppc : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c and : 0.09 0 0 0 0 0 0 0 0
3.39/3.46 c linear : 0.01 0 0 0 0 0 0 0 0
3.39/3.46 c logicor : 0.00 0 0 0 0 0 0 0 0
3.39/3.46 c root node : - 0 - - 0 - - - -
3.39/3.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.39/3.46 c integral : 0 0 0 18 0 0 0 0 0 16
3.39/3.46 c knapsack : 1 5 32 10 0 0 0 0 0 0
3.39/3.46 c setppc : 100 5 32 10 0 1 86 0 0 0
3.39/3.46 c and : 1464 14 31 10 0 0 1467 155 0 0
3.39/3.46 c linear : 1 5 31 1 0 0 0 0 0 0
3.39/3.46 c logicor : 50+ 5 11 1 0 0 7 0 0 0
3.39/3.46 c countsols : 0 0 0 1 0 0 0 0 0 0
3.39/3.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.39/3.46 c integral : 1.92 0.00 0.00 1.92 0.00
3.39/3.46 c knapsack : 0.01 0.01 0.00 0.00 0.00
3.39/3.46 c setppc : 0.00 0.00 0.00 0.00 0.00
3.39/3.46 c and : 0.00 0.00 0.00 0.00 0.00
3.39/3.46 c linear : 0.00 0.00 0.00 0.00 0.00
3.39/3.46 c logicor : 0.00 0.00 0.00 0.00 0.00
3.39/3.46 c countsols : 0.00 0.00 0.00 0.00 0.00
3.39/3.46 c Propagators : Time Calls Cutoffs DomReds
3.39/3.46 c rootredcost : 0.00 0 0 0
3.39/3.46 c pseudoobj : 0.00 33 0 0
3.39/3.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.46 c propagation : 0.00 1 1 1 3.0 0 0.0 -
3.39/3.46 c infeasible LP : 0.00 1 1 5 21.0 0 0.0 0
3.39/3.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.46 c applied globally : - - - 4 23.2 - - -
3.39/3.46 c applied locally : - - - 0 0.0 - - -
3.39/3.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.46 c cut pool : 0.00 4 - - 11 - (maximal pool size: 27)
3.39/3.46 c redcost : 0.00 14 0 0 0 0
3.39/3.46 c impliedbounds : 0.00 5 0 0 0 0
3.39/3.46 c intobj : 0.00 0 0 0 0 0
3.39/3.46 c gomory : 0.52 5 0 0 1567 0
3.39/3.46 c strongcg : 0.48 5 0 0 2400 0
3.39/3.46 c cmir : 0.00 0 0 0 0 0
3.39/3.46 c flowcover : 0.00 0 0 0 0 0
3.39/3.46 c clique : 0.00 5 0 0 0 0
3.39/3.46 c zerohalf : 0.00 0 0 0 0 0
3.39/3.46 c mcf : 0.03 2 0 0 0 0
3.39/3.46 c Pricers : Time Calls Vars
3.39/3.46 c problem variables: 0.00 0 0
3.39/3.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.46 c relpscost : 1.92 8 0 0 0 0 16
3.39/3.46 c pscost : 0.00 0 0 0 0 0 0
3.39/3.46 c inference : 0.00 0 0 0 0 0 0
3.39/3.46 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.46 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.46 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.46 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.46 c random : 0.00 0 0 0 0 0 0
3.39/3.46 c Primal Heuristics : Time Calls Found
3.39/3.46 c LP solutions : 0.00 - 1
3.39/3.46 c pseudo solutions : 0.00 - 0
3.39/3.46 c simplerounding : 0.00 0 0
3.39/3.46 c rounding : 0.00 0 0
3.39/3.46 c shifting : 0.00 0 0
3.39/3.46 c intshifting : 0.00 0 0
3.39/3.46 c oneopt : 0.00 0 0
3.39/3.46 c fixandinfer : 0.00 0 0
3.39/3.46 c feaspump : 0.00 0 0
3.39/3.46 c coefdiving : 0.00 0 0
3.39/3.46 c pscostdiving : 0.00 0 0
3.39/3.46 c fracdiving : 0.00 0 0
3.39/3.46 c veclendiving : 0.00 0 0
3.39/3.46 c intdiving : 0.00 0 0
3.39/3.46 c actconsdiving : 0.00 0 0
3.39/3.46 c objpscostdiving : 0.00 0 0
3.39/3.46 c rootsoldiving : 0.00 0 0
3.39/3.46 c linesearchdiving : 0.00 0 0
3.39/3.46 c guideddiving : 0.00 0 0
3.39/3.46 c octane : 0.00 0 0
3.39/3.46 c rens : 0.00 0 0
3.39/3.46 c rins : 0.00 0 0
3.39/3.46 c localbranching : 0.00 0 0
3.39/3.46 c mutation : 0.00 0 0
3.39/3.46 c crossover : 0.00 0 0
3.39/3.46 c dins : 0.00 0 0
3.39/3.46 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.46 c primal LP : 0.00 0 0 0.00 -
3.39/3.46 c dual LP : 0.11 32 355 11.09 3227.27
3.39/3.46 c barrier LP : 0.00 0 0 0.00 -
3.39/3.46 c diving/probing LP: 0.00 0 0 0.00 -
3.39/3.46 c strong branching : 1.92 81 4343 53.62 2261.98
3.39/3.46 c (at root node) : - 24 3826 159.42 -
3.39/3.46 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.46 c B&B Tree :
3.39/3.46 c number of runs : 1
3.39/3.46 c nodes : 11
3.39/3.46 c nodes (total) : 11
3.39/3.46 c nodes left : 6
3.39/3.46 c max depth : 8
3.39/3.46 c max depth (total): 8
3.39/3.46 c backtracks : 0 (0.0%)
3.39/3.46 c delayed cutoffs : 0
3.39/3.46 c repropagations : 4 (19 domain reductions, 0 cutoffs)
3.39/3.46 c avg switch length: 1.55
3.39/3.46 c switching time : 0.00
3.39/3.46 c Solution :
3.39/3.46 c Solutions found : 1 (1 improvements)
3.39/3.46 c Primal Bound : +1.40000000000000e+01 (in run 1, after 11 nodes, 3.22 seconds, depth 8, found by <relaxation>)
3.39/3.46 c Dual Bound : +1.00000000000000e+01
3.39/3.46 c Gap : 40.00 %
3.39/3.46 c Root Dual Bound : +1.00000000000000e+01
3.39/3.48 c Time complete: 3.47.