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-1868702-1245133791.opb>
0.00/0.01 c original problem has 33 variables (33 bin, 0 int, 0 impl, 0 cont) and 15 constraints
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 2 del vars, 1 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 0 upgd conss, 4 impls, 3 clqs
0.00/0.01 c (round 2) 3 del vars, 2 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 11 upgd conss, 4 impls, 3 clqs
0.00/0.02 c (round 3) 3 del vars, 2 del conss, 0 chg bounds, 4 chg sides, 12 chg coeffs, 12 upgd conss, 4 impls, 3 clqs
0.00/0.02 c presolving (4 rounds):
0.00/0.02 c 3 deleted vars, 2 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 12 changed coefficients
0.00/0.02 c 4 implications, 3 cliques
0.00/0.02 c presolved problem has 30 variables (30 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.02 c 5 constraints of type <knapsack>
0.00/0.02 c 3 constraints of type <setppc>
0.00/0.02 c 1 constraints of type <linear>
0.00/0.02 c 4 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 OPT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
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.02 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 32 | 193k| 0 | 7 | 30 | 13 | 13 | 30 | 13 | 0 | 0 | 0 | 2.838547e+03 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 60 | 206k| 0 | 9 | 30 | 13 | 13 | 30 | 17 | 4 | 0 | 0 | 2.889830e+03 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 68 | 218k| 0 | 12 | 30 | 13 | 13 | 30 | 22 | 9 | 0 | 0 | 2.914296e+03 | -- | Inf
0.00/0.02 o 3347
0.00/0.02 c R 0.0s| 1 | 0 | 68 | 218k| 0 | 12 | 30 | 13 | 13 | 30 | 22 | 9 | 0 | 0 | 2.914296e+03 | 3.347000e+03 | 14.85%
0.00/0.03 c 0.0s| 1 | 0 | 75 | 238k| 0 | 14 | 30 | 13 | 13 | 30 | 26 | 13 | 0 | 0 | 2.914296e+03 | 3.347000e+03 | 14.85%
0.00/0.03 c 0.0s| 1 | 0 | 80 | 248k| 0 | 2 | 30 | 13 | 13 | 30 | 29 | 16 | 0 | 0 | 2.941400e+03 | 3.347000e+03 | 13.79%
0.00/0.03 c 0.0s| 1 | 0 | 97 | 255k| 0 | 6 | 30 | 13 | 13 | 30 | 32 | 19 | 0 | 0 | 2.950960e+03 | 3.347000e+03 | 13.42%
0.00/0.03 c 0.0s| 1 | 0 | 105 | 264k| 0 | 6 | 30 | 13 | 13 | 30 | 34 | 21 | 0 | 0 | 2.972946e+03 | 3.347000e+03 | 12.58%
0.00/0.04 c 0.0s| 1 | 0 | 109 | 279k| 0 | 7 | 30 | 13 | 13 | 30 | 37 | 24 | 0 | 0 | 2.973710e+03 | 3.347000e+03 | 12.55%
0.00/0.04 c 0.0s| 1 | 0 | 116 | 298k| 0 | 8 | 30 | 13 | 13 | 30 | 39 | 26 | 0 | 0 | 2.981196e+03 | 3.347000e+03 | 12.27%
0.00/0.05 c 0.0s| 1 | 0 | 133 | 310k| 0 | 12 | 30 | 13 | 13 | 30 | 42 | 29 | 0 | 0 | 3.005162e+03 | 3.347000e+03 | 11.38%
0.05/0.05 c 0.0s| 1 | 0 | 146 | 323k| 0 | 11 | 30 | 13 | 13 | 30 | 44 | 31 | 0 | 0 | 3.017702e+03 | 3.347000e+03 | 10.91%
0.05/0.06 c 0.0s| 1 | 0 | 148 | 323k| 0 | 14 | 30 | 13 | 13 | 30 | 46 | 33 | 0 | 0 | 3.018255e+03 | 3.347000e+03 | 10.89%
0.05/0.06 c 0.0s| 1 | 0 | 150 | 323k| 0 | 15 | 30 | 13 | 13 | 30 | 46 | 35 | 0 | 0 | 3.019483e+03 | 3.347000e+03 | 10.85%
0.05/0.06 c 0.1s| 1 | 0 | 152 | 325k| 0 | 15 | 30 | 13 | 13 | 30 | 48 | 37 | 0 | 0 | 3.020741e+03 | 3.347000e+03 | 10.80%
0.05/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.06 c 0.1s| 1 | 0 | 155 | 328k| 0 | 14 | 30 | 13 | 13 | 30 | 50 | 39 | 0 | 0 | 3.026472e+03 | 3.347000e+03 | 10.59%
0.05/0.07 o 3164
0.05/0.07 c k 0.1s| 1 | 0 | 155 | 329k| 0 | 14 | 30 | 13 | 13 | 30 | 50 | 39 | 0 | 0 | 3.026472e+03 | 3.164000e+03 | 4.54%
0.05/0.09 o 3095
0.05/0.09 c E 0.1s| 1 | 0 | 155 | 329k| 0 | 14 | 30 | 13 | 13 | 30 | 50 | 39 | 0 | 0 | 3.026472e+03 | 3.095000e+03 | 2.26%
0.05/0.09 c 0.1s| 1 | 0 | 155 | 329k| 0 | 14 | 30 | 13 | 13 | 30 | 50 | 39 | 0 | 0 | 3.026472e+03 | 3.095000e+03 | 2.26%
0.09/0.10 c 0.1s| 1 | 0 | 155 | 329k| 0 | 14 | 30 | 12 | 12 | 30 | 50 | 39 | 0 | 0 | 3.026472e+03 | 3.095000e+03 | 2.26%
0.09/0.11 c 0.1s| 1 | 0 | 155 | 329k| 0 | - | 30 | 12 | 12 | 30 | 50 | 39 | 0 | 14 | 3.026472e+03 | 3.095000e+03 | 2.26%
0.09/0.11 c (run 1, node 1) restarting after 9 global fixings of integer variables
0.09/0.11 c
0.09/0.11 (restart) converted 37 cuts from the global cut pool into linear constraints
0.09/0.11 c
0.09/0.11 presolving:
0.09/0.11 c (round 1) 9 del vars, 3 del conss, 0 chg bounds, 2 chg sides, 10 chg coeffs, 0 upgd conss, 14 impls, 6 clqs
0.09/0.11 c (round 2) 9 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 11 chg coeffs, 0 upgd conss, 14 impls, 6 clqs
0.09/0.11 c (round 3) 9 del vars, 4 del conss, 0 chg bounds, 5 chg sides, 18 chg coeffs, 34 upgd conss, 26 impls, 6 clqs
0.09/0.12 c (round 4) 9 del vars, 5 del conss, 0 chg bounds, 9 chg sides, 38 chg coeffs, 34 upgd conss, 26 impls, 6 clqs
0.09/0.12 c (round 5) 9 del vars, 6 del conss, 0 chg bounds, 9 chg sides, 45 chg coeffs, 34 upgd conss, 28 impls, 6 clqs
0.09/0.12 c presolving (6 rounds):
0.09/0.12 c 9 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 9 changed sides, 45 changed coefficients
0.09/0.12 c 28 implications, 6 cliques
0.09/0.12 c presolved problem has 21 variables (21 bin, 0 int, 0 impl, 0 cont) and 47 constraints
0.09/0.12 c 30 constraints of type <knapsack>
0.09/0.12 c 6 constraints of type <setppc>
0.09/0.12 c 1 constraints of type <linear>
0.09/0.12 c 10 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.02
0.09/0.12 c
0.09/0.12 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c 0.1s| 1 | 0 | 185 | 257k| 0 | 0 | 21 | 47 | 47 | 21 | 47 | 0 | 0 | 14 | 3.089000e+03 | 3.095000e+03 | 0.19%
0.09/0.12 c 0.1s| 1 | 0 | 185 | 253k| 0 | 0 | 21 | 41 | 41 | 21 | 42 | 0 | 0 | 14 | 3.089000e+03 | 3.095000e+03 | 0.19%
0.09/0.12 c (run 2, node 1) restarting after 9 global fixings of integer variables
0.09/0.12 c
0.09/0.12 presolving:
0.09/0.12 c (round 1) 9 del vars, 36 del conss, 0 chg bounds, 52 chg sides, 163 chg coeffs, 0 upgd conss, 42 impls, 6 clqs
0.09/0.12 c (round 2) 9 del vars, 56 del conss, 0 chg bounds, 55 chg sides, 189 chg coeffs, 0 upgd conss, 42 impls, 6 clqs
0.09/0.12 c presolving (3 rounds):
0.09/0.12 c 9 deleted vars, 56 deleted constraints, 0 tightened bounds, 0 added holes, 55 changed sides, 189 changed coefficients
0.09/0.12 c 42 implications, 6 cliques
0.09/0.12 c presolved problem has 12 variables (12 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.09/0.12 c 10 constraints of type <knapsack>
0.09/0.12 c 5 constraints of type <setppc>
0.09/0.12 c 1 constraints of type <linear>
0.09/0.12 c 7 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.03
0.09/0.13 c
0.09/0.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 210 | 224k| 0 | 0 | 12 | 23 | 23 | 12 | 23 | 0 | 0 | 14 | 3.089000e+03 | 3.095000e+03 | 0.19%
0.09/0.13 c 0.1s| 1 | 0 | 210 | 224k| 0 | 0 | 12 | 22 | 22 | 12 | 23 | 0 | 0 | 14 | 3.089000e+03 | 3.095000e+03 | 0.19%
0.09/0.13 c (run 3, node 1) restarting after 2 global fixings of integer variables
0.09/0.13 c
0.09/0.13 presolving:
0.09/0.13 c (round 1) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 42 impls, 5 clqs
0.09/0.13 c presolving (2 rounds):
0.09/0.13 c 2 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.13 c 42 implications, 5 cliques
0.09/0.13 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 22 constraints
0.09/0.13 c 10 constraints of type <knapsack>
0.09/0.13 c 4 constraints of type <setppc>
0.09/0.13 c 1 constraints of type <linear>
0.09/0.13 c 7 constraints of type <logicor>
0.09/0.13 c transformed objective value is always integral (scale: 1)
0.09/0.13 c Presolving Time: 0.03
0.09/0.13 c
0.09/0.13 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 231 | 221k| 0 | 0 | 10 | 22 | 22 | 10 | 22 | 0 | 0 | 14 | 3.089000e+03 | 3.095000e+03 | 0.19%
0.09/0.13 o 3089
0.09/0.13 c * 0.1s| 1 | 0 | 231 | 222k| 0 | - | 10 | 22 | 22 | 10 | 22 | 0 | 0 | 14 | 3.089000e+03 | 3.089000e+03 | 0.00%
0.09/0.13 c
0.09/0.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Solving Time (sec) : 0.10
0.09/0.13 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.09/0.13 c Primal Bound : +3.08900000000000e+03 (7 solutions)
0.09/0.13 c Dual Bound : +3.08900000000000e+03
0.09/0.13 c Gap : 0.00 %
0.09/0.13 c NODE 1
0.09/0.13 c DUAL BOUND 3089
0.09/0.13 c PRIMAL BOUND 3089
0.09/0.13 c GAP 0
0.09/0.13 s OPTIMUM FOUND
0.09/0.13 v -x33 -x32 -x31 x30 x29 x28 x27 x26 x25 -x24 x23 -x22 -x21 x20 x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 x10 -x9 x8 x7 -x6 -x5
0.09/0.13 v -x4 -x3 -x2 x1
0.09/0.13 c SCIP Status : problem is solved [optimal solution found]
0.09/0.13 c Solving Time : 0.10
0.09/0.13 c Original Problem :
0.09/0.13 c Problem name : HOME/instance-1868702-1245133791.opb
0.09/0.13 c Variables : 33 (33 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 15 initial, 15 maximal
0.09/0.13 c Presolved Problem :
0.09/0.13 c Problem name : t_HOME/instance-1868702-1245133791.opb
0.09/0.13 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 22 initial, 22 maximal
0.09/0.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.13 c trivial : 0.00 20 0 0 0 0 0 0 0
0.09/0.13 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.09/0.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c knapsack : 0.00 0 0 0 0 0 21 63 232
0.09/0.13 c setppc : 0.00 0 0 0 0 0 36 0 0
0.09/0.13 c linear : 0.00 0 1 0 0 0 5 5 14
0.09/0.13 c logicor : 0.00 0 0 0 0 0 2 0 0
0.09/0.13 c root node : - 20 - - 20 - - - -
0.09/0.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.13 c integral : 0 0 0 4 0 0 3 0 0 0
0.09/0.13 c knapsack : 10 19 69 3 0 0 0 26 0 0
0.09/0.13 c setppc : 4 19 69 3 0 0 2 0 0 0
0.09/0.13 c linear : 1 19 69 3 0 0 0 3 0 0
0.09/0.13 c logicor : 7 19 17 3 0 0 2 0 0 0
0.09/0.13 c countsols : 0 0 0 3 0 0 0 0 0 0
0.09/0.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.13 c integral : 0.01 0.00 0.00 0.01 0.00
0.09/0.13 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c setppc : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c linear : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c Propagators : Time Calls Cutoffs DomReds
0.09/0.13 c rootredcost : 0.00 0 0 0
0.09/0.13 c pseudoobj : 0.00 27 0 0
0.09/0.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.13 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c applied globally : - - - 0 0.0 - - -
0.09/0.13 c applied locally : - - - 0 0.0 - - -
0.09/0.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.13 c redcost : 0.00 19 0 13 0 0
0.09/0.13 c impliedbounds : 0.00 16 0 0 0 0
0.09/0.13 c intobj : 0.00 0 0 0 0 0
0.09/0.13 c gomory : 0.01 19 0 0 31 0
0.09/0.13 c strongcg : 0.00 19 0 0 35 0
0.09/0.13 c cmir : 0.01 13 0 0 56 0
0.09/0.13 c flowcover : 0.00 13 0 0 105 0
0.09/0.13 c clique : 0.00 19 0 0 0 0
0.09/0.13 c zerohalf : 0.00 0 0 0 0 0
0.09/0.13 c mcf : 0.00 4 0 0 0 0
0.09/0.13 c Pricers : Time Calls Vars
0.09/0.13 c problem variables: 0.00 0 0
0.09/0.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.13 c relpscost : 0.01 1 0 3 0 0 0
0.09/0.13 c pscost : 0.00 0 0 0 0 0 0
0.09/0.13 c inference : 0.00 0 0 0 0 0 0
0.09/0.13 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.13 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.13 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c random : 0.00 0 0 0 0 0 0
0.09/0.13 c Primal Heuristics : Time Calls Found
0.09/0.13 c LP solutions : 0.00 - 1
0.09/0.13 c pseudo solutions : 0.00 - 0
0.09/0.13 c simplerounding : 0.00 5 0
0.09/0.13 c rounding : 0.00 15 1
0.09/0.13 c shifting : 0.00 15 3
0.09/0.13 c intshifting : 0.00 0 0
0.09/0.13 c oneopt : 0.00 1 1
0.09/0.13 c fixandinfer : 0.00 0 0
0.09/0.13 c feaspump : 0.00 1 0
0.09/0.13 c coefdiving : 0.00 0 0
0.09/0.13 c pscostdiving : 0.00 0 0
0.09/0.13 c fracdiving : 0.00 0 0
0.09/0.13 c veclendiving : 0.00 0 0
0.09/0.13 c intdiving : 0.00 0 0
0.09/0.13 c actconsdiving : 0.00 0 0
0.09/0.13 c objpscostdiving : 0.00 0 0
0.09/0.13 c rootsoldiving : 0.00 0 0
0.09/0.13 c linesearchdiving : 0.00 0 0
0.09/0.13 c guideddiving : 0.00 0 0
0.09/0.13 c octane : 0.00 0 0
0.09/0.13 c rens : 0.02 1 1
0.09/0.13 c rins : 0.00 0 0
0.09/0.13 c localbranching : 0.00 0 0
0.09/0.13 c mutation : 0.00 0 0
0.09/0.13 c crossover : 0.00 0 0
0.09/0.13 c dins : 0.00 0 0
0.09/0.13 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.13 c primal LP : 0.00 0 0 0.00 -
0.09/0.13 c dual LP : 0.02 18 208 11.56 10400.00
0.09/0.13 c barrier LP : 0.00 0 0 0.00 -
0.09/0.13 c diving/probing LP: 0.00 11 23 2.09 -
0.09/0.13 c strong branching : 0.01 14 208 14.86 20800.00
0.09/0.13 c (at root node) : - 14 208 14.86 -
0.09/0.13 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.13 c B&B Tree :
0.09/0.13 c number of runs : 4
0.09/0.13 c nodes : 1
0.09/0.13 c nodes (total) : 4
0.09/0.13 c nodes left : 0
0.09/0.13 c max depth : 0
0.09/0.13 c max depth (total): 0
0.09/0.13 c backtracks : 0 (0.0%)
0.09/0.13 c delayed cutoffs : 0
0.09/0.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.13 c avg switch length: 2.00
0.09/0.13 c switching time : 0.00
0.09/0.13 c Solution :
0.09/0.13 c Solutions found : 7 (4 improvements)
0.09/0.13 c Primal Bound : +3.08900000000000e+03 (in run 4, after 1 nodes, 0.10 seconds, depth 0, found by <relaxation>)
0.09/0.13 c Dual Bound : +3.08900000000000e+03
0.09/0.13 c Gap : 0.00 %
0.09/0.13 c Root Dual Bound : +3.08900000000000e+03
0.09/0.14 c Time complete: 0.13.