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