0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1870718-1245216870.opb>
0.00/0.01 c original problem has 714 variables (714 bin, 0 int, 0 impl, 0 cont) and 766 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.10/0.14 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5012 impls, 100 clqs
0.10/0.14 c presolving (2 rounds):
0.10/0.14 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.14 c 5012 implications, 100 cliques
0.10/0.14 c presolved problem has 714 variables (714 bin, 0 int, 0 impl, 0 cont) and 766 constraints
0.10/0.14 c 1 constraints of type <knapsack>
0.10/0.14 c 100 constraints of type <setppc>
0.10/0.14 c 614 constraints of type <and>
0.10/0.14 c 1 constraints of type <linear>
0.10/0.14 c 50 constraints of type <logicor>
0.10/0.14 c transformed objective value is always integral (scale: 1)
0.10/0.14 c Presolving Time: 0.06
0.10/0.14 c SATUNSAT-NLC
0.10/0.14 c -----------------------------------------------------------------------------------------------
0.10/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.14 c separating/flowcover/freq = c -1
0.10/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.14 c separating/cmir/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/veclendiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/veclendiving/freq = c -1
0.10/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.14 c heuristics/simplerounding/freq = c -1
0.10/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/shifting/freq = c -1
0.10/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.14 c heuristics/rounding/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.14 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.10/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.14 c heuristics/rootsoldiving/freq = c -1
0.10/0.14 c # number of nodes added to the contingent of the total nodes
0.10/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.14 c heuristics/rens/nodesofs = c 2000
0.10/0.14 c # minimum percentage of integer variables that have to be fixable
0.10/0.14 c # [type: real, range: [0,1], default: 0.5]
0.10/0.14 c heuristics/rens/minfixingrate = c 0.3
0.10/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.14 c heuristics/rens/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/pscostdiving/freq = c -1
0.10/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.14 c heuristics/oneopt/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.14 c # [type: real, range: [0,1], default: 0.01]
0.10/0.14 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.10/0.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.14 c heuristics/objpscostdiving/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/linesearchdiving/freq = c -1
0.10/0.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/intshifting/freq = c -1
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/intdiving/maxlpiterquot = c 0.075
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/guideddiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/guideddiving/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/fracdiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/fracdiving/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/feaspump/maxlpiterofs = c 2000
0.10/0.14 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.14 c heuristics/feaspump/freq = c -1
0.10/0.14 c # minimum percentage of integer variables that have to be fixed
0.10/0.14 c # [type: real, range: [0,1], default: 0.666]
0.10/0.14 c heuristics/crossover/minfixingrate = c 0.5
0.10/0.14 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.14 c # [type: real, range: [0,1], default: 0.1]
0.10/0.14 c heuristics/crossover/nodesquot = c 0.15
0.10/0.14 c # number of nodes without incumbent change that heuristic should wait
0.10/0.14 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.14 c heuristics/crossover/nwaitingnodes = c 100
0.10/0.14 c # number of nodes added to the contingent of the total nodes
0.10/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.14 c heuristics/crossover/nodesofs = c 750
0.10/0.14 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.14 c heuristics/crossover/freq = c -1
0.10/0.14 c # additional number of allowed LP iterations
0.10/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.14 c heuristics/coefdiving/maxlpiterofs = c 1500
0.10/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.14 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.10/0.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.14 c heuristics/coefdiving/freq = c -1
0.10/0.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.14 c presolving/probing/maxrounds = c 0
0.10/0.14 c # should presolving try to simplify knapsacks
0.10/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.14 c constraints/knapsack/simplifyinequalities = c TRUE
0.10/0.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.14 c constraints/knapsack/disaggregation = c FALSE
0.10/0.14 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.14 c constraints/knapsack/maxnumcardlift = c 0
0.10/0.14 c # should presolving try to simplify inequalities
0.10/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.14 c constraints/linear/simplifyinequalities = c TRUE
0.10/0.14 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.14 c separating/maxroundsroot = c 5
0.10/0.14 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.14 c separating/maxrounds = c 1
0.10/0.14 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.14 c limits/solutions = c 1
0.10/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.14 c limits/memory = c 1620
0.10/0.14 c # maximal time in seconds to run
0.10/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.14 c limits/time = c 1791
0.10/0.14 c # frequency for displaying node information lines
0.10/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.14 c display/freq = c 10000
0.10/0.14 c -----------------------------------------------------------------------------------------------
0.10/0.15 c start solving problem
0.10/0.15 c
0.10/0.16 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.16 c 0.1s| 1 | 0 | 27 |3242k| 0 | 21 | 714 | 766 | 766 | 714 |1380 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.18/0.24 c 0.1s| 1 | 0 | 31 |3255k| 0 | 22 | 714 | 766 | 766 | 714 |1381 | 1 | 0 | 0 | 1.000000e+01 | -- | Inf
0.29/0.33 c 0.2s| 1 | 0 | 36 |3284k| 0 | 22 | 714 | 766 | 766 | 714 |1383 | 3 | 0 | 0 | 1.000000e+01 | -- | Inf
0.39/0.45 c 0.3s| 1 | 0 | 41 |3353k| 0 | 22 | 714 | 766 | 766 | 714 |1384 | 4 | 0 | 0 | 1.000000e+01 | -- | Inf
0.48/0.54 c 0.4s| 1 | 0 | 47 |3383k| 0 | 21 | 714 | 766 | 766 | 714 |1385 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
0.59/0.63 c 0.5s| 1 | 0 | 53 |3399k| 0 | 23 | 714 | 766 | 766 | 714 |1386 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
0.79/0.86 c 0.8s| 1 | 2 | 53 |3400k| 0 | 23 | 714 | 766 | 766 | 714 |1386 | 6 | 0 | 23 | 1.000000e+01 | -- | Inf
0.89/0.93 c * 0.8s| 8 | 0 | 148 |3444k| 7 | - | 714 | 766 | 654 | 714 | 202 | 47 | 0 | 70 | 1.000000e+01 | 1.000000e+01 | 0.00%
0.89/0.93 c
0.89/0.93 c SCIP Status : problem is solved [optimal solution found]
0.89/0.93 c Solving Time (sec) : 0.83
0.89/0.93 c Solving Nodes : 8
0.89/0.93 c Primal Bound : +1.00000000000000e+01 (1 solutions)
0.89/0.93 c Dual Bound : +1.00000000000000e+01
0.89/0.93 c Gap : 0.00 %
0.89/0.94 c NODE 8
0.89/0.94 c DUAL BOUND 10
0.89/0.94 c PRIMAL BOUND 10
0.89/0.94 c GAP 0
0.89/0.94 s SATISFIABLE
0.89/0.94 v -x85 -x63 -x78 -x89 -x97 -x60 -x87 -x72 -x56 -x82 -x99 -x94 -x93 -x91 -x61 -x57 -x81 -x71 -x83 -x73 -x98 -x90 -x74 -x70 -x66 -x62
0.89/0.94 v -x80 -x69 -x68 -x100 -x92 -x53 -x54 -x65 x55 x51 -x96 x67 x59 -x58 -x95 -x86 -x79 -x76 -x88 x64 -x77 -x75 -x84 -x52 -x50 -x49
0.89/0.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
0.89/0.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
0.89/0.94 c SCIP Status : problem is solved [optimal solution found]
0.89/0.94 c Solving Time : 0.83
0.89/0.94 c Original Problem :
0.89/0.94 c Problem name : HOME/instance-1870718-1245216870.opb
0.89/0.94 c Variables : 714 (714 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.94 c Constraints : 766 initial, 766 maximal
0.89/0.94 c Presolved Problem :
0.89/0.94 c Problem name : t_HOME/instance-1870718-1245216870.opb
0.89/0.94 c Variables : 714 (714 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.94 c Constraints : 766 initial, 766 maximal
0.89/0.94 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.94 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c setppc : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c and : 0.05 0 0 0 0 0 0 0 0
0.89/0.94 c linear : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.94 c root node : - 0 - - 0 - - - -
0.89/0.94 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.94 c integral : 0 0 0 14 0 0 0 0 0 14
0.89/0.94 c knapsack : 1 5 22 7 0 0 0 0 0 0
0.89/0.94 c setppc : 100 5 22 7 0 0 0 0 0 0
0.89/0.94 c and : 614 12 22 7 0 0 98 41 0 0
0.89/0.94 c linear : 1 5 22 1 0 0 0 0 0 0
0.89/0.94 c logicor : 50 5 8 1 0 0 7 0 0 0
0.89/0.94 c countsols : 0 0 0 1 0 0 0 0 0 0
0.89/0.94 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.94 c integral : 0.26 0.00 0.00 0.26 0.00
0.89/0.94 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c setppc : 0.01 0.00 0.01 0.00 0.00
0.89/0.94 c and : 0.01 0.01 0.00 0.00 0.00
0.89/0.94 c linear : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.94 c Propagators : Time Calls Cutoffs DomReds
0.89/0.94 c rootredcost : 0.00 0 0 0
0.89/0.94 c pseudoobj : 0.00 23 0 0
0.89/0.94 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.94 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.94 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.94 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.94 c applied globally : - - - 0 0.0 - - -
0.89/0.94 c applied locally : - - - 0 0.0 - - -
0.89/0.94 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.94 c cut pool : 0.00 4 - - 12 - (maximal pool size: 47)
0.89/0.94 c redcost : 0.00 12 0 0 0 0
0.89/0.94 c impliedbounds : 0.00 5 0 0 0 0
0.89/0.94 c intobj : 0.00 0 0 0 0 0
0.89/0.94 c gomory : 0.22 5 0 0 1460 0
0.89/0.94 c strongcg : 0.20 5 0 0 1782 0
0.89/0.94 c cmir : 0.00 0 0 0 0 0
0.89/0.94 c flowcover : 0.00 0 0 0 0 0
0.89/0.94 c clique : 0.00 5 0 0 0 0
0.89/0.94 c zerohalf : 0.00 0 0 0 0 0
0.89/0.94 c mcf : 0.00 1 0 0 0 0
0.89/0.94 c Pricers : Time Calls Vars
0.89/0.94 c problem variables: 0.00 0 0
0.89/0.94 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.94 c relpscost : 0.26 7 0 0 0 0 14
0.89/0.94 c pscost : 0.00 0 0 0 0 0 0
0.89/0.94 c inference : 0.00 0 0 0 0 0 0
0.89/0.94 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.94 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.94 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.94 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.94 c random : 0.00 0 0 0 0 0 0
0.89/0.94 c Primal Heuristics : Time Calls Found
0.89/0.94 c LP solutions : 0.00 - 1
0.89/0.94 c pseudo solutions : 0.00 - 0
0.89/0.94 c simplerounding : 0.00 0 0
0.89/0.94 c rounding : 0.00 0 0
0.89/0.94 c shifting : 0.00 0 0
0.89/0.94 c intshifting : 0.00 0 0
0.89/0.94 c oneopt : 0.00 0 0
0.89/0.94 c fixandinfer : 0.00 0 0
0.89/0.94 c feaspump : 0.00 0 0
0.89/0.94 c coefdiving : 0.00 0 0
0.89/0.94 c pscostdiving : 0.00 0 0
0.89/0.94 c fracdiving : 0.00 0 0
0.89/0.94 c veclendiving : 0.00 0 0
0.89/0.94 c intdiving : 0.00 0 0
0.89/0.94 c actconsdiving : 0.00 0 0
0.89/0.94 c objpscostdiving : 0.00 0 0
0.89/0.94 c rootsoldiving : 0.00 0 0
0.89/0.94 c linesearchdiving : 0.00 0 0
0.89/0.94 c guideddiving : 0.00 0 0
0.89/0.94 c octane : 0.00 0 0
0.89/0.94 c rens : 0.00 0 0
0.89/0.94 c rins : 0.00 0 0
0.89/0.94 c localbranching : 0.00 0 0
0.89/0.94 c mutation : 0.00 0 0
0.89/0.94 c crossover : 0.00 0 0
0.89/0.94 c dins : 0.00 0 0
0.89/0.94 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.94 c primal LP : 0.00 0 0 0.00 -
0.89/0.94 c dual LP : 0.03 25 148 5.92 4933.33
0.89/0.94 c barrier LP : 0.00 0 0 0.00 -
0.89/0.94 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.94 c strong branching : 0.26 70 1719 24.56 6611.54
0.89/0.94 c (at root node) : - 23 1188 51.65 -
0.89/0.94 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.94 c B&B Tree :
0.89/0.94 c number of runs : 1
0.89/0.94 c nodes : 8
0.89/0.94 c nodes (total) : 8
0.89/0.94 c nodes left : 0
0.89/0.94 c max depth : 7
0.89/0.94 c max depth (total): 7
0.89/0.94 c backtracks : 0 (0.0%)
0.89/0.94 c delayed cutoffs : 0
0.89/0.94 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.94 c avg switch length: 2.00
0.89/0.94 c switching time : 0.00
0.89/0.94 c Solution :
0.89/0.94 c Solutions found : 1 (1 improvements)
0.89/0.94 c Primal Bound : +1.00000000000000e+01 (in run 1, after 8 nodes, 0.83 seconds, depth 7, found by <relaxation>)
0.89/0.94 c Dual Bound : +1.00000000000000e+01
0.89/0.94 c Gap : 0.00 %
0.89/0.94 c Root Dual Bound : +1.00000000000000e+01
0.89/0.95 c Time complete: 0.94.