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-2665094-1276649513.opb>
0.00/0.01 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 163 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.03 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 1012 impls, 0 clqs
0.02/0.03 c (round 2) 19 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 0 upgd conss, 1463 impls, 0 clqs
0.02/0.04 c (round 3) 30 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 7 upgd conss, 1783 impls, 0 clqs
0.02/0.04 c (round 4) 40 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 7 upgd conss, 2023 impls, 0 clqs
0.02/0.04 c (round 5) 50 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 7 upgd conss, 2183 impls, 0 clqs
0.02/0.05 c (round 6) 60 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.02/0.05 c (round 7) 70 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.02/0.07 c (0.0s) probing: 144/170 (84.7%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.02/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.07 c presolving (8 rounds):
0.02/0.07 c 70 deleted vars, 49 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 70 changed coefficients
0.02/0.07 c 2287 implications, 0 cliques
0.02/0.07 c presolved problem has 170 variables (170 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.02/0.07 c 94 constraints of type <and>
0.02/0.07 c 6 constraints of type <linear>
0.02/0.07 c 8 constraints of type <logicor>
0.02/0.07 c transformed objective value is always integral (scale: 2)
0.02/0.07 c Presolving Time: 0.04
0.02/0.07 c - non default parameters ----------------------------------------------------------------------
0.02/0.07 c # SCIP version 1.2.1.2
0.02/0.07 c
0.02/0.07 c # frequency for displaying node information lines
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.07 c display/freq = 10000
0.02/0.07 c
0.02/0.07 c # maximal time in seconds to run
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/time = 1800
0.02/0.07 c
0.02/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/memory = 1620
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify inequalities
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/linear/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify knapsacks
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c heuristics/undercover/freq = 0
0.02/0.07 c
0.02/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c separating/rapidlearning/freq = 0
0.02/0.07 c
0.02/0.07 c -----------------------------------------------------------------------------------------------
0.02/0.07 c start solving
0.02/0.07 c
0.02/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c 0.0s| 1 | 0 | 15 | - | 890k| 0 | 8 | 170 | 108 | 170 | 201 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 26 | - | 916k| 0 | 22 | 170 | 108 | 170 | 210 | 9 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 40 | - | 951k| 0 | 30 | 170 | 108 | 170 | 222 | 21 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 71 | - | 996k| 0 | 46 | 170 | 108 | 170 | 233 | 32 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 105 | - |1074k| 0 | 63 | 170 | 108 | 170 | 253 | 52 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 134 | - |1143k| 0 | 64 | 170 | 108 | 170 | 268 | 67 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 179 | - |1175k| 0 | 52 | 170 | 108 | 170 | 290 | 89 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.37 c 0.3s| 1 | 2 | 179 | - |1176k| 0 | 52 | 170 | 108 | 170 | 290 | 89 | 0 | 17 | 3.000000e+00 | -- | Inf
1.69/1.70 o 3
1.69/1.70 c * 1.4s| 210 | 0 | 2505 | 11.1 |1278k| 36 | - | 170 | 183 | 170 | 165 | 567 | 75 | 930 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.69/1.70 c
1.69/1.70 c SCIP Status : problem is solved [optimal solution found]
1.69/1.70 c Solving Time (sec) : 1.45
1.69/1.70 c Solving Nodes : 210
1.69/1.70 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.69/1.70 c Dual Bound : +3.00000000000000e+00
1.69/1.70 c Gap : 0.00 %
1.69/1.70 s OPTIMUM FOUND
1.69/1.70 v -x90 -x89 x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 x60 -x59 -x58 x57 x56 x80 -x79 -x78 x77 x76 -x55 -x54 -x53 -x52 x51 -x75 -x74 -x73
1.69/1.70 v -x72 -x71 x50 -x49 x48 -x47 x46 -x70 x69 -x68 x67 -x66 -x45 -x44 -x43 x42 x41 -x65 -x64 -x63 x62 -x61 x40 -x39 -x38 -x37
1.69/1.70 v x36 -x35 x34 -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
1.69/1.70 v x7 x6 -x5 -x4 -x3 x2 x1
1.69/1.70 c SCIP Status : problem is solved [optimal solution found]
1.69/1.70 c Solving Time : 1.45
1.69/1.70 c Original Problem :
1.69/1.70 c Problem name : HOME/instance-2665094-1276649513.opb
1.69/1.70 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.70 c Constraints : 163 initial, 163 maximal
1.69/1.70 c Presolved Problem :
1.69/1.70 c Problem name : t_HOME/instance-2665094-1276649513.opb
1.69/1.70 c Variables : 170 (170 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.70 c Constraints : 108 initial, 183 maximal
1.69/1.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.70 c trivial : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.70 c probing : 0.01 0 0 0 0 0 0 0 0
1.69/1.70 c and : 0.01 12 49 0 0 0 49 0 49
1.69/1.70 c linear : 0.00 2 7 0 0 0 0 0 21
1.69/1.70 c logicor : 0.01 0 0 0 0 0 0 0 0
1.69/1.70 c root node : - 0 - - 0 - - - -
1.69/1.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.70 c integral : 0 0 0 195 0 2 40 0 0 344
1.69/1.70 c and : 94 421 916 0 0 21 643 500 0 0
1.69/1.70 c linear : 6 6 894 0 0 27 300 0 0 0
1.69/1.70 c logicor : 8+ 6 234 0 0 5 47 0 0 0
1.69/1.70 c countsols : 0 0 0 1 0 0 0 0 0 0
1.69/1.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.70 c integral : 0.82 0.00 0.00 0.82 0.00
1.69/1.70 c and : 0.01 0.00 0.01 0.00 0.00
1.69/1.70 c linear : 0.02 0.00 0.02 0.00 0.00
1.69/1.70 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.70 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.70 c Propagators : Time Calls Cutoffs DomReds
1.69/1.70 c vbounds : 0.00 2 0 0
1.69/1.70 c rootredcost : 0.00 0 0 0
1.69/1.70 c pseudoobj : 0.00 619 0 0
1.69/1.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.70 c propagation : 0.00 53 50 219 15.7 6 9.7 -
1.69/1.70 c infeasible LP : 0.00 4 4 14 11.6 0 0.0 0
1.69/1.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.70 c applied globally : - - - 75 10.9 - - -
1.69/1.70 c applied locally : - - - 0 0.0 - - -
1.69/1.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.70 c cut pool : 0.00 5 - - 46 - (maximal pool size: 238)
1.69/1.70 c redcost : 0.01 422 0 0 0 0
1.69/1.70 c impliedbounds : 0.00 6 0 0 35 0
1.69/1.70 c intobj : 0.00 0 0 0 0 0
1.69/1.70 c cgmip : 0.00 0 0 0 0 0
1.69/1.70 c gomory : 0.05 6 0 0 137 0
1.69/1.70 c strongcg : 0.04 6 0 0 327 0
1.69/1.70 c cmir : 0.01 6 0 0 65 0
1.69/1.70 c flowcover : 0.04 6 0 0 113 0
1.69/1.70 c clique : 0.00 6 0 0 3 0
1.69/1.70 c zerohalf : 0.00 0 0 0 0 0
1.69/1.70 c mcf : 0.00 1 0 0 0 0
1.69/1.70 c rapidlearning : 0.01 1 0 0 0 0
1.69/1.70 c Pricers : Time Calls Vars
1.69/1.70 c problem variables: 0.00 0 0
1.69/1.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.70 c relpscost : 0.82 194 2 40 0 0 344
1.69/1.70 c pscost : 0.00 0 0 0 0 0 0
1.69/1.70 c inference : 0.00 0 0 0 0 0 0
1.69/1.70 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.70 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.70 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.70 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.70 c random : 0.00 0 0 0 0 0 0
1.69/1.70 c Primal Heuristics : Time Calls Found
1.69/1.70 c LP solutions : 0.00 - 1
1.69/1.70 c pseudo solutions : 0.00 - 0
1.69/1.70 c oneopt : 0.00 0 0
1.69/1.70 c crossover : 0.00 0 0
1.69/1.70 c guideddiving : 0.00 0 0
1.69/1.70 c intshifting : 0.00 0 0
1.69/1.70 c coefdiving : 0.00 1 0
1.69/1.70 c pscostdiving : 0.00 1 0
1.69/1.70 c veclendiving : 0.00 1 0
1.69/1.70 c fracdiving : 0.00 1 0
1.69/1.70 c linesearchdiving : 0.01 1 0
1.69/1.70 c feaspump : 0.00 1 0
1.69/1.70 c objpscostdiving : 0.02 1 0
1.69/1.70 c rootsoldiving : 0.01 1 0
1.69/1.70 c trivial : 0.01 2 0
1.69/1.70 c simplerounding : 0.00 0 0
1.69/1.70 c zirounding : 0.00 173 0
1.69/1.70 c rounding : 0.00 247 0
1.69/1.70 c shifting : 0.05 51 0
1.69/1.70 c twoopt : 0.00 0 0
1.69/1.70 c fixandinfer : 0.00 0 0
1.69/1.70 c intdiving : 0.00 0 0
1.69/1.70 c actconsdiving : 0.00 0 0
1.69/1.70 c octane : 0.00 0 0
1.69/1.70 c rens : 0.01 1 0
1.69/1.70 c rins : 0.00 0 0
1.69/1.70 c localbranching : 0.00 0 0
1.69/1.70 c mutation : 0.00 0 0
1.69/1.70 c dins : 0.00 0 0
1.69/1.70 c undercover : 0.01 1 0
1.69/1.70 c nlp : 0.00 0 0
1.69/1.70 c trysol : 0.00 0 0
1.69/1.70 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.70 c primal LP : 0.01 0 0 0.00 0.00
1.69/1.70 c dual LP : 0.25 439 2107 4.80 8428.00
1.69/1.70 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.70 c barrier LP : 0.00 0 0 0.00 -
1.69/1.70 c diving/probing LP: 0.04 48 398 8.29 9950.00
1.69/1.70 c strong branching : 0.80 930 9302 10.00 11627.50
1.69/1.70 c (at root node) : - 17 865 50.88 -
1.69/1.70 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.70 c B&B Tree :
1.69/1.70 c number of runs : 1
1.69/1.70 c nodes : 210
1.69/1.70 c nodes (total) : 210
1.69/1.70 c nodes left : 0
1.69/1.70 c max depth : 36
1.69/1.70 c max depth (total): 36
1.69/1.70 c backtracks : 21 (10.0%)
1.69/1.70 c delayed cutoffs : 12
1.69/1.70 c repropagations : 56 (188 domain reductions, 8 cutoffs)
1.69/1.70 c avg switch length: 2.58
1.69/1.70 c switching time : 0.02
1.69/1.70 c Solution :
1.69/1.70 c Solutions found : 1 (1 improvements)
1.69/1.70 c First Solution : +3.00000000000000e+00 (in run 1, after 210 nodes, 1.45 seconds, depth 33, found by <relaxation>)
1.69/1.70 c Primal Bound : +3.00000000000000e+00 (in run 1, after 210 nodes, 1.45 seconds, depth 33, found by <relaxation>)
1.69/1.70 c Dual Bound : +3.00000000000000e+00
1.69/1.70 c Gap : 0.00 %
1.69/1.70 c Root Dual Bound : +3.00000000000000e+00
1.69/1.70 c Root Iterations : 179
1.69/1.71 c Time complete: 1.7.