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-1868452-1245126534.opb>
0.00/0.01 c original problem has 182 variables (182 bin, 0 int, 0 impl, 0 cont) and 154 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.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 154 upgd conss, 0 impls, 22 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 22 cliques
0.00/0.02 c presolved problem has 182 variables (182 bin, 0 int, 0 impl, 0 cont) and 154 constraints
0.00/0.02 c 22 constraints of type <setppc>
0.00/0.02 c 132 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = c 0.15
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = c 750
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = c -1
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = c 0
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = c FALSE
0.00/0.02 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = c 5
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = c 1
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = c 1
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 133 | 711k| 0 | 132 | 182 | 154 | 154 | 182 | 154 | 0 | 0 | 0 | 1.200000e+01 | -- | Inf
0.03/0.06 c 0.0s| 1 | 0 | 306 | 749k| 0 | 62 | 182 | 154 | 154 | 182 | 163 | 9 | 0 | 0 | 1.927273e+01 | -- | Inf
0.03/0.07 c 0.1s| 1 | 0 | 369 | 778k| 0 | 0 | 182 | 154 | 154 | 182 | 167 | 13 | 0 | 0 | 2.200000e+01 | -- | Inf
0.03/0.07 c * 0.1s| 1 | 0 | 369 | 781k| 0 | - | 182 | 154 | 154 | 182 | 167 | 13 | 0 | 0 | 2.200000e+01 | 2.200000e+01 | 0.00%
0.03/0.07 c
0.03/0.07 c SCIP Status : problem is solved [optimal solution found]
0.03/0.07 c Solving Time (sec) : 0.06
0.03/0.07 c Solving Nodes : 1
0.03/0.07 c Primal Bound : +2.20000000000000e+01 (1 solutions)
0.03/0.07 c Dual Bound : +2.20000000000000e+01
0.03/0.07 c Gap : 0.00 %
0.03/0.07 c NODE 1
0.03/0.07 c DUAL BOUND 22
0.03/0.07 c PRIMAL BOUND 22
0.03/0.07 c GAP 0
0.03/0.07 s SATISFIABLE
0.03/0.07 v -x106 -x103 -x101 x100 -x104 -x105 -x6 -x4 -x1 -x33 -x31 -x29 -x25 -x23 -x98 -x95 -x94 x93 -x28 -x3 -x32 -x102 -x43 -x41 -x39 -x37
0.03/0.07 v -x36 -x34 -x9 -x108 -x109 -x91 -x38 -x99 -x107 x42 -x7 -x110 -x27 -x97 -x8 x11 -x119 x117 -x116 -x113 -x112 x24 -x115 -x75
0.03/0.07 v -x73 x72 -x71 -x69 -x68 -x67 -x21 -x20 -x19 -x18 -x17 x14 -x12 -x89 -x120 -x15 -x22 -x77 -x10 -x16 -x176 x175 -x174 -x173 -x172
0.03/0.07 v -x171 -x76 -x121 x146 -x145 -x144 -x143 -x142 -x5 -x118 -x114 -x65 x63 -x62 -x61 -x60 -x59 -x58 -x56 -x90 -x88 x87 -x85
0.03/0.07 v -x84 -x82 -x79 -x70 -x13 -x30 -x86 -x111 -x92 -x74 -x55 -x54 -x52 -x51 -x49 x48 -x47 -x46 -x45 -x35 -x64 -x2 -x50 -x158 -x157
0.03/0.07 v -x156 x155 -x154 -x153 -x40 -x44 -x182 -x181 x180 -x179 -x178 -x177 -x66 -x170 -x169 -x168 -x167 -x166 x165 -x53 x164 -x163
0.03/0.07 v -x162 -x161 -x160 -x159 -x96 -x131 x130 -x129 -x128 -x127 -x57 -x26 -x136 -x135 -x134 x133 -x132 -x80 -x126 -x125 -x124 -x123
0.03/0.07 v x122 -x78 -x141 -x140 x139 -x138 -x137 -x81 -x152 -x151 -x150 -x149 x148 -x147 -x83
0.03/0.07 c SCIP Status : problem is solved [optimal solution found]
0.03/0.07 c Solving Time : 0.06
0.03/0.07 c Original Problem :
0.03/0.07 c Problem name : HOME/instance-1868452-1245126534.opb
0.03/0.07 c Variables : 182 (182 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.07 c Constraints : 154 initial, 154 maximal
0.03/0.07 c Presolved Problem :
0.03/0.07 c Problem name : t_HOME/instance-1868452-1245126534.opb
0.03/0.07 c Variables : 182 (182 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.07 c Constraints : 154 initial, 154 maximal
0.03/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.03/0.07 c trivial : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c implics : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c probing : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c setppc : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c logicor : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c root node : - 0 - - 0 - - - -
0.03/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.03/0.07 c integral : 0 0 0 1 0 0 0 0 0 0
0.03/0.07 c setppc : 22 3 1 1 0 0 0 0 0 0
0.03/0.07 c logicor : 132 3 1 1 0 0 0 0 0 0
0.03/0.07 c countsols : 0 0 0 1 0 0 0 0 0 0
0.03/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.03/0.07 c integral : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c setppc : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c Propagators : Time Calls Cutoffs DomReds
0.03/0.07 c rootredcost : 0.00 0 0 0
0.03/0.07 c pseudoobj : 0.00 4 0 0
0.03/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.03/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.07 c applied globally : - - - 0 0.0 - - -
0.03/0.07 c applied locally : - - - 0 0.0 - - -
0.03/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.03/0.07 c cut pool : 0.00 2 - - 0 - (maximal pool size: 42)
0.03/0.07 c redcost : 0.00 3 0 0 0 0
0.03/0.07 c impliedbounds : 0.00 2 0 0 0 0
0.03/0.07 c intobj : 0.00 0 0 0 0 0
0.03/0.07 c gomory : 0.01 3 0 0 217 0
0.03/0.07 c strongcg : 0.01 3 0 0 217 0
0.03/0.07 c cmir : 0.00 0 0 0 0 0
0.03/0.07 c flowcover : 0.00 0 0 0 0 0
0.03/0.07 c clique : 0.00 3 0 0 0 0
0.03/0.07 c zerohalf : 0.00 0 0 0 0 0
0.03/0.07 c mcf : 0.00 1 0 0 0 0
0.03/0.07 c Pricers : Time Calls Vars
0.03/0.07 c problem variables: 0.00 0 0
0.03/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.03/0.07 c pscost : 0.00 0 0 0 0 0 0
0.03/0.07 c inference : 0.00 0 0 0 0 0 0
0.03/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.03/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.03/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.03/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.03/0.07 c random : 0.00 0 0 0 0 0 0
0.03/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.03/0.07 c Primal Heuristics : Time Calls Found
0.03/0.07 c LP solutions : 0.00 - 1
0.03/0.07 c pseudo solutions : 0.00 - 0
0.03/0.07 c simplerounding : 0.00 0 0
0.03/0.07 c rounding : 0.00 0 0
0.03/0.07 c shifting : 0.00 0 0
0.03/0.07 c intshifting : 0.00 0 0
0.03/0.07 c oneopt : 0.00 0 0
0.03/0.07 c fixandinfer : 0.00 0 0
0.03/0.07 c feaspump : 0.00 0 0
0.03/0.07 c coefdiving : 0.00 0 0
0.03/0.07 c pscostdiving : 0.00 0 0
0.03/0.07 c fracdiving : 0.00 0 0
0.03/0.07 c veclendiving : 0.00 0 0
0.03/0.07 c intdiving : 0.00 0 0
0.03/0.07 c actconsdiving : 0.00 0 0
0.03/0.07 c objpscostdiving : 0.00 0 0
0.03/0.07 c rootsoldiving : 0.00 0 0
0.03/0.07 c linesearchdiving : 0.00 0 0
0.03/0.07 c guideddiving : 0.00 0 0
0.03/0.07 c octane : 0.00 0 0
0.03/0.07 c rens : 0.00 0 0
0.03/0.07 c rins : 0.00 0 0
0.03/0.07 c localbranching : 0.00 0 0
0.03/0.07 c mutation : 0.00 0 0
0.03/0.07 c crossover : 0.00 0 0
0.03/0.07 c dins : 0.00 0 0
0.03/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.03/0.07 c primal LP : 0.00 0 0 0.00 -
0.03/0.07 c dual LP : 0.03 3 369 123.00 12300.00
0.03/0.07 c barrier LP : 0.00 0 0 0.00 -
0.03/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.03/0.07 c strong branching : 0.00 0 0 0.00 -
0.03/0.07 c (at root node) : - 0 0 0.00 -
0.03/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.03/0.07 c B&B Tree :
0.03/0.07 c number of runs : 1
0.03/0.07 c nodes : 1
0.03/0.07 c nodes (total) : 1
0.03/0.07 c nodes left : 0
0.03/0.07 c max depth : 0
0.03/0.07 c max depth (total): 0
0.03/0.07 c backtracks : 0 (0.0%)
0.03/0.07 c delayed cutoffs : 0
0.03/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.03/0.07 c avg switch length: 2.00
0.03/0.07 c switching time : 0.00
0.03/0.07 c Solution :
0.03/0.07 c Solutions found : 1 (1 improvements)
0.03/0.07 c Primal Bound : +2.20000000000000e+01 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <relaxation>)
0.03/0.07 c Dual Bound : +2.20000000000000e+01
0.03/0.07 c Gap : 0.00 %
0.03/0.07 c Root Dual Bound : +2.20000000000000e+01
0.03/0.08 c Time complete: 0.07.