0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666031-1276356525.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 problem read
0.00/0.01 c presolving settings loaded
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, 6 chg sides, 47 chg coeffs, 26 upgd conss, 4 impls, 15 clqs
0.00/0.03 c presolving (4 rounds):
0.00/0.03 c 2 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 6 changed sides, 47 changed coefficients
0.00/0.03 c 4 implications, 15 cliques
0.00/0.03 c presolved problem has 87 variables (87 bin, 0 int, 0 impl, 0 cont) and 27 constraints
0.00/0.03 c 6 constraints of type <knapsack>
0.00/0.03 c 15 constraints of type <setppc>
0.00/0.03 c 1 constraints of type <linear>
0.00/0.03 c 5 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 27 | - | 428k| 0 | 9 | 87 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | -- | Inf
0.09/0.13 o 2949
0.09/0.13 c y 0.1s| 1 | 0 | 27 | - | 481k| 0 | 9 | 87 | 27 | 87 | 27 | 0 | 0 | 0 | 9.479572e+02 | 2.949000e+03 | 211.09%
0.09/0.14 c 0.1s| 1 | 0 | 50 | - | 618k| 0 | 13 | 87 | 140 | 87 | 34 | 7 | 0 | 0 | 1.001879e+03 | 2.949000e+03 | 194.35%
0.09/0.15 c 0.1s| 1 | 0 | 58 | - | 636k| 0 | 16 | 87 | 140 | 87 | 39 | 12 | 0 | 0 | 1.004226e+03 | 2.949000e+03 | 193.66%
0.09/0.16 c 0.1s| 1 | 0 | 77 | - | 652k| 0 | 20 | 87 | 140 | 87 | 44 | 17 | 0 | 0 | 1.023156e+03 | 2.949000e+03 | 188.23%
0.09/0.17 c 0.1s| 1 | 0 | 82 | - | 662k| 0 | 21 | 87 | 140 | 87 | 48 | 21 | 0 | 0 | 1.025159e+03 | 2.949000e+03 | 187.66%
0.09/0.17 o 2397
0.09/0.17 c s 0.1s| 1 | 0 | 82 | - | 663k| 0 | 21 | 87 | 140 | 87 | 48 | 21 | 0 | 0 | 1.025159e+03 | 2.397000e+03 | 133.82%
0.09/0.18 c 0.1s| 1 | 0 | 84 | - | 664k| 0 | 22 | 87 | 140 | 87 | 49 | 22 | 0 | 0 | 1.027693e+03 | 2.397000e+03 | 133.24%
0.09/0.19 c 0.1s| 1 | 0 | 87 | - | 672k| 0 | 21 | 87 | 140 | 87 | 50 | 23 | 0 | 0 | 1.028631e+03 | 2.397000e+03 | 133.03%
0.19/0.27 o 1148
0.19/0.27 c E 0.2s| 1 | 0 | 87 | - | 674k| 0 | 21 | 87 | 140 | 87 | 50 | 23 | 0 | 0 | 1.028631e+03 | 1.148000e+03 | 11.60%
0.19/0.27 c 0.2s| 1 | 0 | 87 | - | 674k| 0 | 21 | 87 | 140 | 87 | 50 | 23 | 0 | 0 | 1.028631e+03 | 1.148000e+03 | 11.60%
0.19/0.28 c 0.2s| 1 | 0 | 87 | - | 575k| 0 | 21 | 87 | 30 | 87 | 48 | 23 | 0 | 0 | 1.028631e+03 | 1.148000e+03 | 11.60%
0.19/0.29 c 0.2s| 1 | 2 | 87 | - | 576k| 0 | 21 | 87 | 30 | 87 | 48 | 23 | 0 | 11 | 1.028631e+03 | 1.148000e+03 | 11.60%
0.19/0.29 c (run 1, node 1) restarting after 15 global fixings of integer variables
0.19/0.29 c
0.19/0.29 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.19/0.29 c
0.19/0.29 c presolving:
0.29/0.30 c (round 1) 15 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 8 impls, 13 clqs
0.29/0.30 c (round 2) 15 del vars, 4 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 7 upgd conss, 8 impls, 13 clqs
0.29/0.30 c presolving (3 rounds):
0.29/0.30 c 15 deleted vars, 4 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.29/0.30 c 8 implications, 13 cliques
0.29/0.30 c presolved problem has 72 variables (72 bin, 0 int, 0 impl, 0 cont) and 32 constraints
0.29/0.30 c 12 constraints of type <knapsack>
0.29/0.30 c 14 constraints of type <setppc>
0.29/0.30 c 1 constraints of type <linear>
0.29/0.30 c 5 constraints of type <logicor>
0.29/0.30 c transformed objective value is always integral (scale: 1)
0.29/0.30 c Presolving Time: 0.02
0.29/0.31 c
0.29/0.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.31 c 0.2s| 1 | 0 | 120 | - | 496k| 0 | 14 | 72 | 32 | 72 | 31 | 0 | 0 | 11 | 9.550797e+02 | 1.148000e+03 | 20.20%
0.29/0.31 c 0.2s| 1 | 0 | 137 | - | 514k| 0 | 16 | 72 | 32 | 72 | 36 | 5 | 0 | 11 | 9.913524e+02 | 1.148000e+03 | 15.80%
0.29/0.33 c 0.2s| 1 | 2 | 137 | - | 515k| 0 | 16 | 72 | 32 | 72 | 36 | 5 | 0 | 27 | 9.913524e+02 | 1.148000e+03 | 15.80%
0.29/0.36 o 1143
0.29/0.36 c * 0.3s| 15 | 8 | 206 | 4.9 | 527k| 6 | - | 72 | 32 | 72 | 32 | 5 | 0 | 88 | 1.002283e+03 | 1.143000e+03 | 14.04%
0.59/0.67 o 1136
0.59/0.67 c C 0.5s| 215 | 73 | 1001 | 4.0 | 641k| 18 | 6 | 72 | 76 | 72 | 32 | 5 | 60 | 371 | 1.029127e+03 | 1.136000e+03 | 10.38%
1.20/1.27 o 1128
1.20/1.27 c * 1.0s| 783 | 218 | 4067 | 5.0 | 976k| 18 | - | 72 | 247 | 72 | 32 | 5 | 301 | 522 | 1.068304e+03 | 1.128000e+03 | 5.59%
1.39/1.41 o 1120
1.39/1.41 c z 1.1s| 969 | 169 | 4737 | 4.8 | 966k| 18 | 1 | 72 | 282 | 72 | 32 | 5 | 358 | 532 | 1.083302e+03 | 1.120000e+03 | 3.39%
1.59/1.60 c
1.59/1.60 c SCIP Status : problem is solved [optimal solution found]
1.59/1.60 c Solving Time (sec) : 1.28
1.59/1.60 c Solving Nodes : 1235 (total of 1236 nodes in 2 runs)
1.59/1.60 c Primal Bound : +1.12000000000000e+03 (129 solutions)
1.59/1.60 c Dual Bound : +1.12000000000000e+03
1.59/1.60 c Gap : 0.00 %
1.59/1.60 s OPTIMUM FOUND
1.59/1.60 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
1.59/1.60 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
1.59/1.60 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
1.59/1.60 v -x15 x14 -x13 -x12 -x11 -x8 -x5 -x4 -x3 x2 x1
1.59/1.60 c SCIP Status : problem is solved [optimal solution found]
1.59/1.60 c Solving Time : 1.28
1.59/1.60 c Original Problem :
1.59/1.60 c Problem name : HOME/instance-2666031-1276356525.opb
1.59/1.60 c Variables : 89 (89 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.60 c Constraints : 28 initial, 28 maximal
1.59/1.60 c Presolved Problem :
1.59/1.60 c Problem name : t_HOME/instance-2666031-1276356525.opb
1.59/1.60 c Variables : 72 (72 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.60 c Constraints : 32 initial, 338 maximal
1.59/1.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.60 c trivial : 0.00 15 0 0 0 0 0 0 0
1.59/1.60 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.59/1.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c probing : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c knapsack : 0.00 0 0 0 0 0 0 4 22
1.59/1.60 c setppc : 0.01 0 0 0 0 0 0 0 0
1.59/1.60 c linear : 0.01 0 0 0 0 0 4 2 26
1.59/1.60 c logicor : 0.00 0 0 0 0 0 1 0 0
1.59/1.60 c root node : - 18 - - 18 - - - -
1.59/1.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.60 c integral : 0 0 0 835 0 8 163 0 0 1338
1.59/1.60 c knapsack : 12 9 4551 2 0 101 1100 37 0 0
1.59/1.60 c setppc : 14 9 4394 0 0 30 2582 0 0 0
1.59/1.60 c linear : 1 10 4405 0 0 134 535 5 0 0
1.59/1.60 c logicor : 5+ 9 2300 0 0 45 557 0 0 0
1.59/1.60 c countsols : 0 0 0 2 0 0 0 0 0 0
1.59/1.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.60 c integral : 0.24 0.00 0.00 0.24 0.00
1.59/1.60 c knapsack : 0.03 0.01 0.02 0.00 0.00
1.59/1.60 c setppc : 0.00 0.00 0.00 0.00 0.00
1.59/1.60 c linear : 0.03 0.00 0.03 0.00 0.00
1.59/1.60 c logicor : 0.06 0.00 0.06 0.00 0.00
1.59/1.60 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.60 c Propagators : Time Calls Cutoffs DomReds
1.59/1.60 c vbounds : 0.00 3 0 0
1.59/1.60 c rootredcost : 0.01 4 0 2
1.59/1.60 c pseudoobj : 0.01 4482 41 398
1.59/1.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.60 c propagation : 0.02 350 272 1208 35.0 1 18.0 -
1.59/1.60 c infeasible LP : 0.00 34 32 64 20.3 0 0.0 0
1.59/1.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.60 c applied globally : - - - 306 23.6 - - -
1.59/1.60 c applied locally : - - - 149 37.3 - - -
1.59/1.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.60 c cut pool : 0.00 0 - - 0 - (maximal pool size: 18)
1.59/1.60 c redcost : 0.04 1512 0 3772 0 0
1.59/1.60 c impliedbounds : 0.00 9 0 0 0 0
1.59/1.60 c intobj : 0.00 0 0 0 0 0
1.59/1.60 c cgmip : 0.00 0 0 0 0 0
1.59/1.60 c gomory : 0.01 9 0 0 9 0
1.59/1.60 c strongcg : 0.04 9 0 0 5 0
1.59/1.60 c cmir : 0.00 9 0 0 30 0
1.59/1.60 c flowcover : 0.00 9 0 0 50 0
1.59/1.60 c clique : 0.00 9 0 0 0 0
1.59/1.60 c zerohalf : 0.00 0 0 0 0 0
1.59/1.60 c mcf : 0.00 2 0 0 0 0
1.59/1.60 c rapidlearning : 0.07 1 0 0 0 113
1.59/1.60 c Pricers : Time Calls Vars
1.59/1.60 c problem variables: 0.00 0 0
1.59/1.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.60 c relpscost : 0.24 833 8 163 0 0 1338
1.59/1.60 c pscost : 0.00 0 0 0 0 0 0
1.59/1.60 c inference : 0.00 0 0 0 0 0 0
1.59/1.60 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.60 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.60 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.60 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.60 c random : 0.00 0 0 0 0 0 0
1.59/1.60 c Primal Heuristics : Time Calls Found
1.59/1.60 c LP solutions : 0.00 - 2
1.59/1.60 c pseudo solutions : 0.00 - 0
1.59/1.60 c oneopt : 0.00 7 0
1.59/1.60 c guideddiving : 0.01 12 0
1.59/1.60 c coefdiving : 0.00 13 0
1.59/1.60 c pscostdiving : 0.00 13 0
1.59/1.60 c fracdiving : 0.00 13 0
1.59/1.60 c veclendiving : 0.04 13 0
1.59/1.60 c linesearchdiving : 0.04 13 0
1.59/1.60 c trivial : 0.00 2 0
1.59/1.60 c simplerounding : 0.00 671 0
1.59/1.60 c zirounding : 0.01 677 10
1.59/1.60 c rounding : 0.01 405 0
1.59/1.60 c shifting : 0.06 144 111
1.59/1.60 c intshifting : 0.00 0 0
1.59/1.60 c twoopt : 0.00 0 0
1.59/1.60 c fixandinfer : 0.00 0 0
1.59/1.60 c feaspump : 0.00 1 0
1.59/1.60 c intdiving : 0.00 0 0
1.59/1.60 c actconsdiving : 0.00 0 0
1.59/1.60 c objpscostdiving : 0.00 3 0
1.59/1.60 c rootsoldiving : 0.02 7 3
1.59/1.60 c octane : 0.00 0 0
1.59/1.60 c rens : 0.05 1 1
1.59/1.60 c rins : 0.00 0 0
1.59/1.60 c localbranching : 0.00 0 0
1.59/1.60 c mutation : 0.00 0 0
1.59/1.60 c crossover : 0.02 1 1
1.59/1.60 c dins : 0.00 0 0
1.59/1.60 c undercover : 0.00 0 0
1.59/1.60 c nlp : 0.00 0 0
1.59/1.60 c trysol : 0.00 0 0
1.59/1.60 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.60 c primal LP : 0.00 0 0 0.00 -
1.59/1.60 c dual LP : 0.30 1365 4459 3.27 14863.33
1.59/1.60 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.60 c barrier LP : 0.00 0 0 0.00 -
1.59/1.60 c diving/probing LP: 0.06 399 1057 2.65 17616.67
1.59/1.60 c strong branching : 0.23 543 4023 7.41 17491.30
1.59/1.60 c (at root node) : - 27 363 13.44 -
1.59/1.60 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.60 c B&B Tree :
1.59/1.60 c number of runs : 2
1.59/1.60 c nodes : 1235
1.59/1.60 c nodes (total) : 1236
1.59/1.60 c nodes left : 0
1.59/1.60 c max depth : 19
1.59/1.60 c max depth (total): 19
1.59/1.60 c backtracks : 512 (41.5%)
1.59/1.60 c delayed cutoffs : 45
1.59/1.60 c repropagations : 114 (452 domain reductions, 40 cutoffs)
1.59/1.60 c avg switch length: 8.08
1.59/1.60 c switching time : 0.07
1.59/1.60 c Solution :
1.59/1.60 c Solutions found : 129 (7 improvements)
1.59/1.60 c First Solution : +2.94900000000000e+03 (in run 1, after 1 nodes, 0.09 seconds, depth 0, found by <trysol>)
1.59/1.60 c Primal Bound : +1.12000000000000e+03 (in run 2, after 969 nodes, 1.12 seconds, depth 18, found by <zirounding>)
1.59/1.60 c Dual Bound : +1.12000000000000e+03
1.59/1.60 c Gap : 0.00 %
1.59/1.60 c Root Dual Bound : +9.91352376842428e+02
1.59/1.60 c Root Iterations : 137
1.59/1.61 c Time complete: 1.6.