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-1870681-1245215629.opb>
0.00/0.02 c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 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.17 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 100 clqs
0.29/0.30 c presolving (2 rounds):
0.29/0.30 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.30 c 12084 implications, 100 cliques
0.29/0.30 c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.29/0.30 c 1 constraints of type <knapsack>
0.29/0.30 c 100 constraints of type <setppc>
0.29/0.30 c 1498 constraints of type <and>
0.29/0.30 c 1 constraints of type <linear>
0.29/0.30 c 50 constraints of type <logicor>
0.29/0.30 c transformed objective value is always integral (scale: 1)
0.29/0.30 c Presolving Time: 0.11
0.29/0.30 c SATUNSAT-NLC
0.29/0.30 c -----------------------------------------------------------------------------------------------
0.29/0.30 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c separating/flowcover/freq = c -1
0.29/0.30 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c separating/cmir/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/veclendiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/simplerounding/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/shifting/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/rounding/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.30 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.30 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/rootsoldiving/freq = c -1
0.29/0.30 c # number of nodes added to the contingent of the total nodes
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.30 c heuristics/rens/nodesofs = c 2000
0.29/0.30 c # minimum percentage of integer variables that have to be fixable
0.29/0.30 c # [type: real, range: [0,1], default: 0.5]
0.29/0.30 c heuristics/rens/minfixingrate = c 0.3
0.29/0.30 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c heuristics/rens/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/pscostdiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/oneopt/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.30 c # [type: real, range: [0,1], default: 0.01]
0.29/0.30 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.30 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/objpscostdiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/linesearchdiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/intshifting/freq = c -1
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/guideddiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/fracdiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.30 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/feaspump/freq = c -1
0.29/0.30 c # minimum percentage of integer variables that have to be fixed
0.29/0.30 c # [type: real, range: [0,1], default: 0.666]
0.29/0.30 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.30 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.30 c # [type: real, range: [0,1], default: 0.1]
0.29/0.30 c heuristics/crossover/nodesquot = c 0.15
0.29/0.30 c # number of nodes without incumbent change that heuristic should wait
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.30 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.30 c # number of nodes added to the contingent of the total nodes
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.30 c heuristics/crossover/nodesofs = c 750
0.29/0.30 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.30 c heuristics/crossover/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/coefdiving/freq = c -1
0.29/0.30 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c presolving/probing/maxrounds = c 0
0.29/0.30 c # should presolving try to simplify knapsacks
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.30 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.30 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.30 c constraints/knapsack/disaggregation = c FALSE
0.29/0.30 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.30 c # should presolving try to simplify inequalities
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c separating/maxroundsroot = c 5
0.29/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.30 c separating/maxrounds = c 1
0.29/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c limits/solutions = c 1
0.29/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.30 c limits/memory = c 1620
0.29/0.30 c # maximal time in seconds to run
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.30 c limits/time = c 1791
0.29/0.30 c # frequency for displaying node information lines
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.30 c display/freq = c 10000
0.29/0.30 c -----------------------------------------------------------------------------------------------
0.29/0.30 c start solving problem
0.29/0.30 c
0.29/0.33 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.33 c 0.1s| 1 | 0 | 21 |7192k| 0 | 18 |1598 |1650 |1650 |1598 |3148 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.38/0.48 c 0.3s| 1 | 0 | 27 |7205k| 0 | 21 |1598 |1650 |1650 |1598 |3150 | 2 | 0 | 0 | 1.000000e+01 | -- | Inf
0.58/0.64 c 0.4s| 1 | 0 | 37 |7241k| 0 | 22 |1598 |1650 |1650 |1598 |3151 | 3 | 0 | 0 | 1.000000e+01 | -- | Inf
0.79/0.80 c 0.6s| 1 | 0 | 50 |7302k| 0 | 22 |1598 |1650 |1650 |1598 |3153 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
1.08/1.14 c 0.9s| 1 | 0 | 58 |7347k| 0 | 23 |1598 |1650 |1650 |1598 |3154 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
1.38/1.44 c 1.2s| 1 | 0 | 62 |7367k| 0 | 22 |1598 |1650 |1650 |1598 |3155 | 7 | 0 | 0 | 1.000000e+01 | -- | Inf
1.78/1.83 c 1.6s| 1 | 2 | 62 |7367k| 0 | 22 |1598 |1650 |1650 |1598 |3155 | 7 | 0 | 22 | 1.000000e+01 | -- | Inf
1.88/1.94 c * 1.7s| 10 | 4 | 233 |7891k| 7 | - |1598 |1651 | 180 |1598 | 231 | 131 | 1 | 65 | 1.000000e+01 | 1.400000e+01 | 40.00%
1.88/1.94 c
1.88/1.94 c SCIP Status : solving was interrupted [solution limit reached]
1.88/1.94 c Solving Time (sec) : 1.71
1.88/1.94 c Solving Nodes : 10
1.88/1.94 c Primal Bound : +1.40000000000000e+01 (1 solutions)
1.88/1.94 c Dual Bound : +1.00000000000000e+01
1.88/1.94 c Gap : 40.00 %
1.88/1.94 c NODE 10
1.88/1.94 c DUAL BOUND 10
1.88/1.94 c PRIMAL BOUND 14
1.88/1.94 c GAP 0.4
1.88/1.94 s SATISFIABLE
1.88/1.94 v -x95 -x89 -x79 -x96 -x52 -x98 -x58 -x55 -x54 -x71 -x75 -x99 -x88 x85 -x57 x51 -x97 -x92 -x90 -x82 -x76 -x67 -x65 -x61 -x56 -x70
1.88/1.94 v x59 -x53 -x74 -x81 -x83 -x80 -x68 -x69 -x62 -x73 x77 -x64 -x60 -x91 -x63 -x72 -x100 x93 -x86 -x94 -x66 -x78 -x87 -x84 -x50 x49
1.88/1.94 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
1.88/1.94 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
1.88/1.94 c SCIP Status : solving was interrupted [solution limit reached]
1.88/1.94 c Solving Time : 1.71
1.88/1.94 c Original Problem :
1.88/1.94 c Problem name : HOME/instance-1870681-1245215629.opb
1.88/1.94 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
1.88/1.94 c Constraints : 1650 initial, 1650 maximal
1.88/1.94 c Presolved Problem :
1.88/1.94 c Problem name : t_HOME/instance-1870681-1245215629.opb
1.88/1.94 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
1.88/1.94 c Constraints : 1650 initial, 1651 maximal
1.88/1.94 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.88/1.94 c trivial : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c implics : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c probing : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c setppc : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c and : 0.09 0 0 0 0 0 0 0 0
1.88/1.94 c linear : 0.01 0 0 0 0 0 0 0 0
1.88/1.94 c logicor : 0.00 0 0 0 0 0 0 0 0
1.88/1.94 c root node : - 0 - - 0 - - - -
1.88/1.94 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.88/1.94 c integral : 0 0 0 16 0 0 0 0 0 14
1.88/1.94 c knapsack : 1 5 25 9 0 0 0 0 0 0
1.88/1.94 c setppc : 100 5 25 9 0 1 89 0 0 0
1.88/1.94 c and : 1498 13 24 9 0 0 1491 124 0 0
1.88/1.94 c linear : 1 5 24 1 0 0 0 0 0 0
1.88/1.94 c logicor : 50+ 5 9 1 0 0 5 0 0 0
1.88/1.94 c countsols : 0 0 0 1 0 0 0 0 0 0
1.88/1.94 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.88/1.94 c integral : 0.40 0.00 0.00 0.40 0.00
1.88/1.94 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.88/1.94 c setppc : 0.00 0.00 0.00 0.00 0.00
1.88/1.94 c and : 0.02 0.00 0.01 0.01 0.00
1.88/1.94 c linear : 0.00 0.00 0.00 0.00 0.00
1.88/1.94 c logicor : 0.00 0.00 0.00 0.00 0.00
1.88/1.94 c countsols : 0.00 0.00 0.00 0.00 0.00
1.88/1.94 c Propagators : Time Calls Cutoffs DomReds
1.88/1.94 c rootredcost : 0.00 0 0 0
1.88/1.94 c pseudoobj : 0.01 26 0 0
1.88/1.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.88/1.94 c propagation : 0.00 1 1 1 3.0 0 0.0 -
1.88/1.94 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
1.88/1.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.88/1.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.88/1.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.88/1.94 c applied globally : - - - 1 3.0 - - -
1.88/1.94 c applied locally : - - - 0 0.0 - - -
1.88/1.94 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.88/1.94 c cut pool : 0.00 4 - - 9 - (maximal pool size: 46)
1.88/1.94 c redcost : 0.00 13 0 0 0 0
1.88/1.94 c impliedbounds : 0.01 5 0 0 0 0
1.88/1.94 c intobj : 0.00 0 0 0 0 0
1.88/1.94 c gomory : 0.54 5 0 0 1606 0
1.88/1.94 c strongcg : 0.46 5 0 0 2024 0
1.88/1.94 c cmir : 0.00 0 0 0 0 0
1.88/1.94 c flowcover : 0.00 0 0 0 0 0
1.88/1.94 c clique : 0.00 5 0 0 0 0
1.88/1.94 c zerohalf : 0.00 0 0 0 0 0
1.88/1.94 c mcf : 0.03 2 0 0 0 0
1.88/1.94 c Pricers : Time Calls Vars
1.88/1.94 c problem variables: 0.00 0 0
1.88/1.94 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.88/1.94 c relpscost : 0.40 7 0 0 0 0 14
1.88/1.94 c pscost : 0.00 0 0 0 0 0 0
1.88/1.94 c inference : 0.00 0 0 0 0 0 0
1.88/1.94 c mostinf : 0.00 0 0 0 0 0 0
1.88/1.94 c leastinf : 0.00 0 0 0 0 0 0
1.88/1.94 c fullstrong : 0.00 0 0 0 0 0 0
1.88/1.94 c allfullstrong : 0.00 0 0 0 0 0 0
1.88/1.94 c random : 0.00 0 0 0 0 0 0
1.88/1.94 c Primal Heuristics : Time Calls Found
1.88/1.94 c LP solutions : 0.00 - 1
1.88/1.94 c pseudo solutions : 0.00 - 0
1.88/1.94 c simplerounding : 0.00 0 0
1.88/1.94 c rounding : 0.00 0 0
1.88/1.94 c shifting : 0.00 0 0
1.88/1.94 c intshifting : 0.00 0 0
1.88/1.94 c oneopt : 0.00 0 0
1.88/1.94 c fixandinfer : 0.00 0 0
1.88/1.94 c feaspump : 0.00 0 0
1.88/1.94 c coefdiving : 0.00 0 0
1.88/1.94 c pscostdiving : 0.00 0 0
1.88/1.94 c fracdiving : 0.00 0 0
1.88/1.94 c veclendiving : 0.00 0 0
1.88/1.94 c intdiving : 0.00 0 0
1.88/1.94 c actconsdiving : 0.00 0 0
1.88/1.94 c objpscostdiving : 0.00 0 0
1.88/1.94 c rootsoldiving : 0.00 0 0
1.88/1.94 c linesearchdiving : 0.00 0 0
1.88/1.94 c guideddiving : 0.00 0 0
1.88/1.94 c octane : 0.00 0 0
1.88/1.94 c rens : 0.00 0 0
1.88/1.94 c rins : 0.00 0 0
1.88/1.94 c localbranching : 0.00 0 0
1.88/1.94 c mutation : 0.00 0 0
1.88/1.94 c crossover : 0.00 0 0
1.88/1.94 c dins : 0.00 0 0
1.88/1.94 c LP : Time Calls Iterations Iter/call Iter/sec
1.88/1.94 c primal LP : 0.02 0 0 0.00 0.00
1.88/1.94 c dual LP : 0.06 30 233 7.77 3883.33
1.88/1.94 c barrier LP : 0.00 0 0 0.00 -
1.88/1.94 c diving/probing LP: 0.00 0 0 0.00 -
1.88/1.94 c strong branching : 0.40 65 1760 27.08 4400.00
1.88/1.94 c (at root node) : - 22 1538 69.91 -
1.88/1.94 c conflict analysis: 0.00 0 0 0.00 -
1.88/1.94 c B&B Tree :
1.88/1.94 c number of runs : 1
1.88/1.94 c nodes : 10
1.88/1.94 c nodes (total) : 10
1.88/1.94 c nodes left : 4
1.88/1.94 c max depth : 7
1.88/1.94 c max depth (total): 7
1.88/1.94 c backtracks : 0 (0.0%)
1.88/1.94 c delayed cutoffs : 0
1.88/1.94 c repropagations : 1 (9 domain reductions, 0 cutoffs)
1.88/1.94 c avg switch length: 1.20
1.88/1.94 c switching time : 0.03
1.88/1.94 c Solution :
1.88/1.94 c Solutions found : 1 (1 improvements)
1.88/1.94 c Primal Bound : +1.40000000000000e+01 (in run 1, after 10 nodes, 1.71 seconds, depth 7, found by <relaxation>)
1.88/1.94 c Dual Bound : +1.00000000000000e+01
1.88/1.94 c Gap : 40.00 %
1.88/1.94 c Root Dual Bound : +1.00000000000000e+01
1.88/1.97 c Time complete: 1.95.