0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868711-1245134029.opb>
0.00/0.01 c original problem has 89 variables (89 bin, 0 int, 0 impl, 0 cont) and 28 constraints
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 0 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 0 upgd conss, 4 impls, 15 clqs
0.00/0.02 c (round 2) 2 del vars, 1 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 22 upgd conss, 4 impls, 15 clqs
0.00/0.02 c (round 3) 2 del vars, 1 del conss, 0 chg bounds, 2 chg sides, 25 chg coeffs, 26 upgd conss, 4 impls, 15 clqs
0.00/0.02 c presolving (4 rounds):
0.00/0.02 c 2 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 2 changed sides, 25 changed coefficients
0.00/0.02 c 4 implications, 15 cliques
0.00/0.02 c presolved problem has 87 variables (87 bin, 0 int, 0 impl, 0 cont) and 27 constraints
0.00/0.02 c 6 constraints of type <knapsack>
0.00/0.02 c 15 constraints of type <setppc>
0.00/0.02 c 1 constraints of type <linear>
0.00/0.02 c 5 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 | 27 | 402k| 0 | 9 | 87 | 27 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | -- | Inf
0.00/0.03 o 1136
0.00/0.03 c F 0.0s| 1 | 0 | 122 | 408k| 0 | 0 | 87 | 27 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | 1.136000e+03 | 19.84%
0.00/0.04 c 0.0s| 1 | 0 | 151 | 448k| 0 | 13 | 87 | 27 | 27 | 87 | 34 | 7 | 0 | 0 | 1.001879e+03 | 1.136000e+03 | 13.39%
0.00/0.04 c 0.0s| 1 | 0 | 160 | 468k| 0 | 16 | 87 | 26 | 26 | 87 | 37 | 12 | 0 | 0 | 1.004226e+03 | 1.136000e+03 | 13.12%
0.00/0.05 c 0.0s| 1 | 0 | 177 | 482k| 0 | 19 | 87 | 26 | 26 | 87 | 42 | 17 | 0 | 0 | 1.023308e+03 | 1.136000e+03 | 11.01%
0.00/0.06 c 0.1s| 1 | 0 | 182 | 491k| 0 | 21 | 87 | 25 | 25 | 87 | 45 | 21 | 0 | 0 | 1.027436e+03 | 1.136000e+03 | 10.57%
0.00/0.07 c 0.1s| 1 | 0 | 184 | 496k| 0 | 22 | 87 | 25 | 25 | 87 | 47 | 23 | 0 | 0 | 1.029837e+03 | 1.136000e+03 | 10.31%
0.00/0.08 c 0.1s| 1 | 0 | 186 | 503k| 0 | 22 | 87 | 25 | 25 | 87 | 49 | 25 | 0 | 0 | 1.030769e+03 | 1.136000e+03 | 10.21%
0.00/0.10 c 0.1s| 1 | 0 | 189 | 507k| 0 | 23 | 87 | 25 | 25 | 87 | 50 | 26 | 0 | 0 | 1.030899e+03 | 1.136000e+03 | 10.20%
0.09/0.11 c 0.1s| 1 | 0 | 195 | 515k| 0 | 23 | 87 | 25 | 25 | 87 | 52 | 28 | 0 | 0 | 1.032976e+03 | 1.136000e+03 | 9.97%
0.19/0.22 c 0.2s| 1 | 2 | 195 | 518k| 0 | 23 | 87 | 25 | 25 | 87 | 52 | 28 | 0 | 22 | 1.032976e+03 | 1.136000e+03 | 9.97%
0.19/0.22 c (run 1, node 1) restarting after 18 global fixings of integer variables
0.19/0.22 c
0.19/0.22 (restart) converted 19 cuts from the global cut pool into linear constraints
0.19/0.22 c
0.19/0.22 presolving:
0.19/0.22 c (round 1) 18 del vars, 1 del conss, 0 chg bounds, 5 chg sides, 6 chg coeffs, 0 upgd conss, 6 impls, 13 clqs
0.19/0.22 c (round 2) 18 del vars, 1 del conss, 0 chg bounds, 5 chg sides, 6 chg coeffs, 19 upgd conss, 6 impls, 13 clqs
0.19/0.22 c presolving (3 rounds):
0.19/0.22 c 18 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 5 changed sides, 6 changed coefficients
0.19/0.22 c 6 implications, 13 cliques
0.19/0.22 c presolved problem has 69 variables (69 bin, 0 int, 0 impl, 0 cont) and 43 constraints
0.19/0.22 c 22 constraints of type <knapsack>
0.19/0.22 c 13 constraints of type <setppc>
0.19/0.22 c 1 constraints of type <linear>
0.19/0.22 c 7 constraints of type <logicor>
0.19/0.22 c transformed objective value is always integral (scale: 1)
0.19/0.22 c Presolving Time: 0.01
0.19/0.22 c
0.19/0.23 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.23 c 0.2s| 1 | 0 | 253 | 470k| 0 | 23 | 69 | 43 | 43 | 69 | 43 | 0 | 0 | 22 | 1.033403e+03 | 1.136000e+03 | 9.93%
0.19/0.24 c 0.2s| 1 | 2 | 253 | 470k| 0 | 23 | 69 | 43 | 43 | 69 | 43 | 0 | 0 | 40 | 1.033403e+03 | 1.136000e+03 | 9.93%
0.29/0.31 o 1128
0.29/0.31 c * 0.3s| 20 | 5 | 443 | 482k| 6 | - | 69 | 44 | 34 | 69 | 37 | 0 | 1 | 199 | 1.055400e+03 | 1.128000e+03 | 6.88%
0.39/0.43 o 1120
0.39/0.43 c * 0.4s| 101 | 7 | 1030 | 490k| 12 | - | 69 | 46 | 35 | 69 | 37 | 0 | 3 | 359 | 1.068712e+03 | 1.120000e+03 | 4.80%
0.39/0.46 c
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time (sec) : 0.42
0.39/0.46 c Solving Nodes : 140 (total of 141 nodes in 2 runs)
0.39/0.46 c Primal Bound : +1.12000000000000e+03 (12 solutions)
0.39/0.46 c Dual Bound : +1.12000000000000e+03
0.39/0.46 c Gap : 0.00 %
0.39/0.46 c NODE 140
0.39/0.46 c DUAL BOUND 1120
0.39/0.46 c PRIMAL BOUND 1120
0.39/0.46 c GAP 0
0.39/0.46 s OPTIMUM FOUND
0.39/0.46 v -x10 -x9 x7 -x6 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67
0.39/0.46 v x66 -x65 x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41
0.39/0.46 v -x40 x39 -x38 -x37 -x36 x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16
0.39/0.46 v -x15 x14 -x13 -x12 -x11 -x8 -x5 -x4 -x3 x2 x1
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time : 0.42
0.39/0.46 c Original Problem :
0.39/0.46 c Problem name : HOME/instance-1868711-1245134029.opb
0.39/0.46 c Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 28 initial, 28 maximal
0.39/0.46 c Presolved Problem :
0.39/0.46 c Problem name : t_HOME/instance-1868711-1245134029.opb
0.39/0.46 c Variables : 69 (69 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 43 initial, 47 maximal
0.39/0.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.46 c trivial : 0.00 18 0 0 0 0 0 0 0
0.39/0.46 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.39/0.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c probing : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c knapsack : 0.00 0 0 0 0 0 0 5 5
0.39/0.46 c setppc : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c linear : 0.00 0 0 0 0 0 1 2 26
0.39/0.46 c logicor : 0.01 0 0 0 0 0 1 0 0
0.39/0.46 c root node : - 24 - - 24 - - - -
0.39/0.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.46 c integral : 0 0 0 149 0 17 82 0 0 144
0.39/0.46 c knapsack : 22 10 622 2 0 3 45 10 0 0
0.39/0.46 c setppc : 13 10 619 2 0 0 173 0 0 0
0.39/0.46 c linear : 1 10 619 2 0 8 34 4 0 0
0.39/0.46 c logicor : 7+ 10 173 2 0 0 42 0 0 0
0.39/0.46 c countsols : 0 0 0 2 0 0 0 0 0 0
0.39/0.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.46 c integral : 0.14 0.00 0.00 0.14 0.00
0.39/0.46 c knapsack : 0.01 0.00 0.01 0.00 0.00
0.39/0.46 c setppc : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c linear : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.46 c Propagators : Time Calls Cutoffs DomReds
0.39/0.46 c rootredcost : 0.00 2 0 5
0.39/0.46 c pseudoobj : 0.00 467 0 1
0.39/0.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.46 c propagation : 0.00 11 5 16 32.7 0 0.0 -
0.39/0.46 c infeasible LP : 0.00 51 0 0 0.0 0 0.0 0
0.39/0.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.46 c applied globally : - - - 4 26.0 - - -
0.39/0.46 c applied locally : - - - 2 37.0 - - -
0.39/0.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.46 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.46 c redcost : 0.00 229 0 553 0 0
0.39/0.46 c impliedbounds : 0.00 10 0 0 0 0
0.39/0.46 c intobj : 0.00 0 0 0 0 0
0.39/0.46 c gomory : 0.03 10 0 0 9 0
0.39/0.46 c strongcg : 0.01 10 0 0 4 0
0.39/0.46 c cmir : 0.04 10 0 0 26 0
0.39/0.46 c flowcover : 0.02 10 0 0 34 0
0.39/0.46 c clique : 0.00 10 0 0 0 0
0.39/0.46 c zerohalf : 0.00 0 0 0 0 0
0.39/0.46 c mcf : 0.00 2 0 0 0 0
0.39/0.46 c Pricers : Time Calls Vars
0.39/0.46 c problem variables: 0.00 0 0
0.39/0.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.46 c relpscost : 0.14 147 17 82 0 0 144
0.39/0.46 c pscost : 0.00 0 0 0 0 0 0
0.39/0.46 c inference : 0.00 0 0 0 0 0 0
0.39/0.46 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.46 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.46 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.46 c random : 0.00 0 0 0 0 0 0
0.39/0.46 c Primal Heuristics : Time Calls Found
0.39/0.46 c LP solutions : 0.00 - 2
0.39/0.46 c pseudo solutions : 0.00 - 0
0.39/0.46 c guideddiving : 0.00 0 0
0.39/0.46 c crossover : 0.00 0 0
0.39/0.46 c oneopt : 0.00 3 0
0.39/0.46 c pscostdiving : 0.00 1 0
0.39/0.46 c veclendiving : 0.00 1 0
0.39/0.46 c fracdiving : 0.00 1 0
0.39/0.46 c coefdiving : 0.00 1 0
0.39/0.46 c linesearchdiving : 0.00 1 0
0.39/0.46 c objpscostdiving : 0.00 1 1
0.39/0.46 c rootsoldiving : 0.00 1 0
0.39/0.46 c simplerounding : 0.00 78 0
0.39/0.46 c rounding : 0.00 132 0
0.39/0.46 c shifting : 0.00 17 7
0.39/0.46 c intshifting : 0.00 0 0
0.39/0.46 c fixandinfer : 0.00 0 0
0.39/0.46 c feaspump : 0.01 1 1
0.39/0.46 c intdiving : 0.00 0 0
0.39/0.46 c actconsdiving : 0.00 0 0
0.39/0.46 c octane : 0.00 0 0
0.39/0.46 c rens : 0.07 1 1
0.39/0.46 c rins : 0.00 0 0
0.39/0.46 c localbranching : 0.00 0 0
0.39/0.46 c mutation : 0.00 0 0
0.39/0.46 c dins : 0.00 0 0
0.39/0.46 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.46 c primal LP : 0.00 0 0 0.00 -
0.39/0.46 c dual LP : 0.05 203 1032 5.08 20640.00
0.39/0.46 c barrier LP : 0.00 0 0 0.00 -
0.39/0.46 c diving/probing LP: 0.01 48 177 3.69 17700.00
0.39/0.46 c strong branching : 0.14 380 3717 9.78 26550.00
0.39/0.46 c (at root node) : - 40 628 15.70 -
0.39/0.46 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.46 c B&B Tree :
0.39/0.46 c number of runs : 2
0.39/0.46 c nodes : 140
0.39/0.46 c nodes (total) : 141
0.39/0.46 c nodes left : 0
0.39/0.46 c max depth : 12
0.39/0.46 c max depth (total): 12
0.39/0.46 c backtracks : 29 (20.7%)
0.39/0.46 c delayed cutoffs : 0
0.39/0.46 c repropagations : 4 (3 domain reductions, 0 cutoffs)
0.39/0.46 c avg switch length: 2.86
0.39/0.46 c switching time : 0.00
0.39/0.46 c Solution :
0.39/0.46 c Solutions found : 12 (3 improvements)
0.39/0.46 c Primal Bound : +1.12000000000000e+03 (in run 2, after 101 nodes, 0.40 seconds, depth 10, found by <relaxation>)
0.39/0.46 c Dual Bound : +1.12000000000000e+03
0.39/0.46 c Gap : 0.00 %
0.39/0.46 c Root Dual Bound : +1.03340333732626e+03
0.39/0.46 c Time complete: 0.46.