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-1870670-1245215365.opb>
0.00/0.01 c original problem has 706 variables (706 bin, 0 int, 0 impl, 0 cont) and 758 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.09/0.15 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 4948 impls, 100 clqs
0.09/0.15 c presolving (2 rounds):
0.09/0.15 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 4948 implications, 100 cliques
0.09/0.15 c presolved problem has 706 variables (706 bin, 0 int, 0 impl, 0 cont) and 758 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 100 constraints of type <setppc>
0.09/0.15 c 606 constraints of type <and>
0.09/0.15 c 1 constraints of type <linear>
0.09/0.15 c 50 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c SATUNSAT-NLC
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = c -1
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = c -1
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = c -1
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = c -1
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = c -1
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = c 2000
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = c 0.3
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = c -1
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = c -1
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = c -1
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = c -1
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = c 0.15
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = c 750
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = c -1
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = c -1
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = c 0
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = c FALSE
0.09/0.15 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = c 5
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = c 1
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = c 1
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = c 1620
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = c 1791
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = c 10000
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving problem
0.09/0.15 c
0.09/0.17 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.17 c 0.1s| 1 | 0 | 33 |3205k| 0 | 21 | 706 | 758 | 758 | 706 |1364 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 35 |3228k| 0 | 20 | 706 | 758 | 758 | 706 |1365 | 1 | 0 | 0 | 1.000000e+01 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 39 |3264k| 0 | 22 | 706 | 758 | 758 | 706 |1367 | 3 | 0 | 0 | 1.000000e+01 | -- | Inf
0.49/0.51 c 0.4s| 1 | 0 | 46 |3345k| 0 | 23 | 706 | 758 | 758 | 706 |1369 | 5 | 0 | 0 | 1.000000e+01 | -- | Inf
0.59/0.60 c 0.5s| 1 | 0 | 59 |3350k| 0 | 22 | 706 | 758 | 758 | 706 |1370 | 6 | 0 | 0 | 1.000000e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 2 | 59 |3351k| 0 | 22 | 706 | 758 | 758 | 706 |1370 | 6 | 0 | 22 | 1.000000e+01 | -- | Inf
0.89/0.96 c * 0.8s| 8 | 5 | 106 |3491k| 7 | - | 706 | 758 | 345 | 706 | 183 | 22 | 0 | 78 | 1.000000e+01 | 1.100000e+01 | 10.00%
0.89/0.96 c
0.89/0.96 c SCIP Status : solving was interrupted [solution limit reached]
0.89/0.96 c Solving Time (sec) : 0.85
0.89/0.96 c Solving Nodes : 8
0.89/0.96 c Primal Bound : +1.10000000000000e+01 (1 solutions)
0.89/0.96 c Dual Bound : +1.00000000000000e+01
0.89/0.96 c Gap : 10.00 %
0.89/0.96 c NODE 8
0.89/0.96 c DUAL BOUND 10
0.89/0.96 c PRIMAL BOUND 11
0.89/0.96 c GAP 0.1
0.89/0.96 s SATISFIABLE
0.89/0.96 v -x92 -x75 -x70 -x69 -x90 -x54 -x96 -x81 -x57 -x86 -x64 -x72 -x91 -x62 -x53 -x94 -x93 -x89 -x58 -x59 -x78 -x97 -x84 -x52 -x98 -x68
0.89/0.96 v -x63 -x55 -x80 -x65 -x87 -x79 -x99 -x51 -x95 -x88 x85 x67 -x60 x56 -x82 -x74 x100 -x71 x83 -x77 -x73 -x61 -x66 -x76 -x50 -x49
0.89/0.96 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.96 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.96 c SCIP Status : solving was interrupted [solution limit reached]
0.89/0.96 c Solving Time : 0.85
0.89/0.96 c Original Problem :
0.89/0.96 c Problem name : HOME/instance-1870670-1245215365.opb
0.89/0.96 c Variables : 706 (706 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.96 c Constraints : 758 initial, 758 maximal
0.89/0.96 c Presolved Problem :
0.89/0.96 c Problem name : t_HOME/instance-1870670-1245215365.opb
0.89/0.96 c Variables : 706 (706 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.96 c Constraints : 758 initial, 758 maximal
0.89/0.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.96 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c probing : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c setppc : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c and : 0.05 0 0 0 0 0 0 0 0
0.89/0.96 c linear : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.96 c root node : - 0 - - 0 - - - -
0.89/0.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.96 c integral : 0 0 0 9 0 0 0 0 0 14
0.89/0.96 c knapsack : 1 5 20 2 0 0 0 0 0 0
0.89/0.96 c setppc : 100 5 20 2 0 0 29 0 0 0
0.89/0.96 c and : 606 12 20 2 0 0 371 16 0 0
0.89/0.96 c linear : 1 5 20 1 0 0 0 0 0 0
0.89/0.96 c logicor : 50 5 5 1 0 0 4 0 0 0
0.89/0.96 c countsols : 0 0 0 1 0 0 0 0 0 0
0.89/0.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.96 c integral : 0.26 0.00 0.00 0.26 0.00
0.89/0.96 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c and : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c linear : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.96 c Propagators : Time Calls Cutoffs DomReds
0.89/0.96 c rootredcost : 0.00 0 0 0
0.89/0.96 c pseudoobj : 0.00 21 0 0
0.89/0.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.96 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.96 c applied globally : - - - 0 0.0 - - -
0.89/0.96 c applied locally : - - - 0 0.0 - - -
0.89/0.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.96 c cut pool : 0.00 4 - - 1 - (maximal pool size: 41)
0.89/0.96 c redcost : 0.00 12 0 0 0 0
0.89/0.96 c impliedbounds : 0.01 5 0 0 0 0
0.89/0.96 c intobj : 0.00 0 0 0 0 0
0.89/0.96 c gomory : 0.27 5 0 0 1388 0
0.89/0.96 c strongcg : 0.21 5 0 0 1117 0
0.89/0.96 c cmir : 0.00 0 0 0 0 0
0.89/0.96 c flowcover : 0.00 0 0 0 0 0
0.89/0.96 c clique : 0.00 5 0 0 0 0
0.89/0.96 c zerohalf : 0.00 0 0 0 0 0
0.89/0.96 c mcf : 0.00 1 0 0 0 0
0.89/0.96 c Pricers : Time Calls Vars
0.89/0.96 c problem variables: 0.00 0 0
0.89/0.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.96 c relpscost : 0.26 7 0 0 0 0 14
0.89/0.96 c pscost : 0.00 0 0 0 0 0 0
0.89/0.96 c inference : 0.00 0 0 0 0 0 0
0.89/0.96 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.96 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.96 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.96 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.96 c random : 0.00 0 0 0 0 0 0
0.89/0.96 c Primal Heuristics : Time Calls Found
0.89/0.96 c LP solutions : 0.00 - 1
0.89/0.96 c pseudo solutions : 0.00 - 0
0.89/0.96 c simplerounding : 0.00 0 0
0.89/0.96 c rounding : 0.00 0 0
0.89/0.96 c shifting : 0.00 0 0
0.89/0.96 c intshifting : 0.00 0 0
0.89/0.96 c oneopt : 0.00 0 0
0.89/0.96 c fixandinfer : 0.00 0 0
0.89/0.96 c feaspump : 0.00 0 0
0.89/0.96 c coefdiving : 0.00 0 0
0.89/0.96 c pscostdiving : 0.00 0 0
0.89/0.96 c fracdiving : 0.00 0 0
0.89/0.96 c veclendiving : 0.00 0 0
0.89/0.96 c intdiving : 0.00 0 0
0.89/0.96 c actconsdiving : 0.00 0 0
0.89/0.96 c objpscostdiving : 0.00 0 0
0.89/0.96 c rootsoldiving : 0.00 0 0
0.89/0.96 c linesearchdiving : 0.00 0 0
0.89/0.96 c guideddiving : 0.00 0 0
0.89/0.96 c octane : 0.00 0 0
0.89/0.96 c rens : 0.00 0 0
0.89/0.96 c rins : 0.00 0 0
0.89/0.96 c localbranching : 0.00 0 0
0.89/0.96 c mutation : 0.00 0 0
0.89/0.96 c crossover : 0.00 0 0
0.89/0.96 c dins : 0.00 0 0
0.89/0.96 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.96 c primal LP : 0.00 0 0 0.00 -
0.89/0.96 c dual LP : 0.01 17 106 6.24 10600.00
0.89/0.96 c barrier LP : 0.00 0 0 0.00 -
0.89/0.96 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.96 c strong branching : 0.26 78 1251 16.04 4811.54
0.89/0.96 c (at root node) : - 22 932 42.36 -
0.89/0.96 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.96 c B&B Tree :
0.89/0.96 c number of runs : 1
0.89/0.96 c nodes : 8
0.89/0.96 c nodes (total) : 8
0.89/0.96 c nodes left : 5
0.89/0.96 c max depth : 7
0.89/0.96 c max depth (total): 7
0.89/0.96 c backtracks : 0 (0.0%)
0.89/0.96 c delayed cutoffs : 0
0.89/0.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.96 c avg switch length: 1.00
0.89/0.96 c switching time : 0.00
0.89/0.96 c Solution :
0.89/0.96 c Solutions found : 1 (1 improvements)
0.89/0.96 c Primal Bound : +1.10000000000000e+01 (in run 1, after 8 nodes, 0.85 seconds, depth 7, found by <relaxation>)
0.89/0.96 c Dual Bound : +1.00000000000000e+01
0.89/0.96 c Gap : 10.00 %
0.89/0.96 c Root Dual Bound : +1.00000000000000e+01
0.89/0.97 c Time complete: 0.97.