0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666380-1276646162.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 205 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.04 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (round 2) 18 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 5 upgd conss, 1480 impls, 0 clqs
0.00/0.04 c (round 3) 32 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1816 impls, 0 clqs
0.00/0.05 c (round 4) 46 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.05 c (round 5) 60 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.06/0.06 c (0.0s) probing: 144/220 (65.5%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.06/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.06/0.06 c presolving (6 rounds):
0.06/0.06 c 60 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 73 changed coefficients
0.06/0.06 c 2000 implications, 0 cliques
0.06/0.06 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.06/0.06 c 144 constraints of type <and>
0.06/0.06 c 4 constraints of type <linear>
0.06/0.06 c 5 constraints of type <logicor>
0.06/0.06 c transformed objective value is always integral (scale: 2)
0.06/0.06 c Presolving Time: 0.03
0.06/0.06 c - non default parameters ----------------------------------------------------------------------
0.06/0.06 c # SCIP version 1.2.1.2
0.06/0.06 c
0.06/0.06 c # frequency for displaying node information lines
0.06/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.06/0.06 c display/freq = 10000
0.06/0.06 c
0.06/0.06 c # maximal time in seconds to run
0.06/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.06 c limits/time = 1800
0.06/0.06 c
0.06/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.06/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.06/0.06 c limits/memory = 1620
0.06/0.06 c
0.06/0.06 c # should presolving try to simplify inequalities
0.06/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.06 c constraints/linear/simplifyinequalities = TRUE
0.06/0.06 c
0.06/0.06 c # should presolving try to simplify knapsacks
0.06/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.06/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.06/0.06 c
0.06/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c heuristics/undercover/freq = 0
0.06/0.07 c
0.06/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.06/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.06/0.07 c separating/rapidlearning/freq = 0
0.06/0.07 c
0.06/0.07 c -----------------------------------------------------------------------------------------------
0.06/0.07 c start solving
0.06/0.07 c
0.06/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.06/0.07 c 0.0s| 1 | 0 | 12 | - |1091k| 0 | 7 | 220 | 153 | 220 | 297 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.60/0.60 c 0.4s| 1 | 0 | 284 | - |1107k| 0 | 16 | 220 | 153 | 220 | 300 | 3 | 0 | 0 | 3.000000e+00 | -- | Inf
0.60/0.62 c 0.4s| 1 | 0 | 292 | - |1127k| 0 | 22 | 220 | 153 | 220 | 306 | 9 | 0 | 0 | 3.000000e+00 | -- | Inf
0.60/0.65 c 0.4s| 1 | 0 | 311 | - |1156k| 0 | 33 | 220 | 153 | 220 | 315 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
0.60/0.69 c 0.5s| 1 | 0 | 336 | - |1180k| 0 | 39 | 220 | 153 | 220 | 328 | 31 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.74 c 0.5s| 1 | 0 | 362 | - |1203k| 0 | 46 | 220 | 153 | 220 | 340 | 43 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.79 c 0.6s| 1 | 0 | 399 | - |1215k| 0 | 51 | 220 | 153 | 220 | 349 | 52 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.10 c 0.9s| 1 | 2 | 399 | - |1215k| 0 | 51 | 220 | 153 | 220 | 349 | 52 | 0 | 18 | 3.000000e+00 | -- | Inf
2.29/2.37 o 3
2.29/2.37 c * 2.1s| 193 | 0 | 1881 | 7.7 |1318k| 38 | - | 220 | 225 | 220 | 108 | 545 | 72 | 850 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.29/2.37 c
2.29/2.37 c SCIP Status : problem is solved [optimal solution found]
2.29/2.37 c Solving Time (sec) : 2.07
2.29/2.37 c Solving Nodes : 193
2.29/2.37 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.29/2.37 c Dual Bound : +3.00000000000000e+00
2.29/2.37 c Gap : 0.00 %
2.29/2.37 s OPTIMUM FOUND
2.29/2.37 v -x84 -x83 -x82 -x81 x80 x79 x78 -x77 -x76 -x75 -x74 x73 x72 -x71 -x56 x55 x54 -x53 -x52 -x51 x50 x70 -x69 x68 -x67 x66 x65 x64
2.29/2.37 v -x49 -x48 x47 -x46 -x45 x44 x43 -x63 -x62 -x61 -x60 -x59 -x58 x57 x42 x41 x40 -x39 -x38 x37 x36 -x35 -x34 x33 -x32 -x31 x30 x29
2.29/2.37 v -x28 x27 -x26 x25 -x24 x23 x22 x21 x20 -x19 -x18 -x17 -x16 x15 x14 -x13 x12 -x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
2.29/2.37 c SCIP Status : problem is solved [optimal solution found]
2.29/2.37 c Solving Time : 2.07
2.29/2.37 c Original Problem :
2.29/2.37 c Problem name : HOME/instance-2666380-1276646162.opb
2.29/2.37 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.37 c Constraints : 205 initial, 205 maximal
2.29/2.37 c Presolved Problem :
2.29/2.37 c Problem name : t_HOME/instance-2666380-1276646162.opb
2.29/2.37 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.37 c Constraints : 153 initial, 225 maximal
2.29/2.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.29/2.37 c trivial : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c implics : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c probing : 0.01 0 0 0 0 0 0 0 0
2.29/2.37 c and : 0.00 8 48 0 0 0 48 0 48
2.29/2.37 c linear : 0.00 1 3 0 0 0 0 0 25
2.29/2.37 c logicor : 0.00 0 0 0 0 0 0 0 0
2.29/2.37 c root node : - 0 - - 0 - - - -
2.29/2.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.29/2.37 c integral : 0 0 0 169 0 1 24 0 0 294
2.29/2.37 c and : 144 342 906 0 0 13 786 507 0 0
2.29/2.37 c linear : 4 6 892 0 0 44 368 0 0 0
2.29/2.37 c logicor : 5+ 6 171 0 0 0 32 0 0 0
2.29/2.37 c countsols : 0 0 0 1 0 0 0 0 0 0
2.29/2.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.29/2.37 c integral : 1.18 0.00 0.00 1.18 0.00
2.29/2.37 c and : 0.02 0.01 0.01 0.00 0.00
2.29/2.37 c linear : 0.00 0.00 0.00 0.00 0.00
2.29/2.37 c logicor : 0.00 0.00 0.00 0.00 0.00
2.29/2.37 c countsols : 0.00 0.00 0.00 0.00 0.00
2.29/2.37 c Propagators : Time Calls Cutoffs DomReds
2.29/2.37 c vbounds : 0.01 2 0 0
2.29/2.37 c rootredcost : 0.00 0 0 0
2.29/2.37 c pseudoobj : 0.00 613 0 0
2.29/2.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.37 c propagation : 0.01 57 54 486 33.0 3 33.0 -
2.29/2.37 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.37 c applied globally : - - - 72 15.8 - - -
2.29/2.37 c applied locally : - - - 0 0.0 - - -
2.29/2.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.37 c cut pool : 0.00 5 - - 30 - (maximal pool size: 81)
2.29/2.37 c redcost : 0.00 343 0 0 0 0
2.29/2.37 c impliedbounds : 0.00 6 0 0 13 0
2.29/2.37 c intobj : 0.00 0 0 0 0 0
2.29/2.37 c cgmip : 0.00 0 0 0 0 0
2.29/2.37 c gomory : 0.05 6 0 0 43 0
2.29/2.37 c strongcg : 0.05 6 0 0 35 0
2.29/2.37 c cmir : 0.03 6 0 0 42 0
2.29/2.37 c flowcover : 0.05 6 0 0 57 0
2.29/2.37 c clique : 0.00 1 0 0 0 0
2.29/2.37 c zerohalf : 0.00 0 0 0 0 0
2.29/2.37 c mcf : 0.00 1 0 0 0 0
2.29/2.37 c rapidlearning : 0.02 1 0 0 0 0
2.29/2.37 c Pricers : Time Calls Vars
2.29/2.37 c problem variables: 0.00 0 0
2.29/2.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.37 c relpscost : 1.18 168 1 24 0 0 294
2.29/2.37 c pscost : 0.00 0 0 0 0 0 0
2.29/2.37 c inference : 0.00 0 0 0 0 0 0
2.29/2.37 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.37 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.37 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.37 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.37 c random : 0.00 0 0 0 0 0 0
2.29/2.37 c Primal Heuristics : Time Calls Found
2.29/2.37 c LP solutions : 0.00 - 1
2.29/2.37 c pseudo solutions : 0.00 - 0
2.29/2.37 c oneopt : 0.00 0 0
2.29/2.37 c crossover : 0.00 0 0
2.29/2.37 c fracdiving : 0.00 0 0
2.29/2.37 c veclendiving : 0.00 0 0
2.29/2.37 c objpscostdiving : 0.00 0 0
2.29/2.37 c rootsoldiving : 0.00 0 0
2.29/2.37 c linesearchdiving : 0.00 0 0
2.29/2.37 c guideddiving : 0.00 0 0
2.29/2.37 c intshifting : 0.00 0 0
2.29/2.37 c coefdiving : 0.00 1 0
2.29/2.37 c pscostdiving : 0.00 1 0
2.29/2.37 c feaspump : 0.00 1 0
2.29/2.37 c trivial : 0.01 2 0
2.29/2.37 c simplerounding : 0.00 0 0
2.29/2.37 c zirounding : 0.00 148 0
2.29/2.37 c rounding : 0.04 207 0
2.29/2.37 c shifting : 0.03 48 0
2.29/2.37 c twoopt : 0.00 0 0
2.29/2.37 c fixandinfer : 0.00 0 0
2.29/2.37 c intdiving : 0.00 0 0
2.29/2.37 c actconsdiving : 0.00 0 0
2.29/2.37 c octane : 0.00 0 0
2.29/2.37 c rens : 0.04 1 0
2.29/2.37 c rins : 0.00 0 0
2.29/2.37 c localbranching : 0.00 0 0
2.29/2.37 c mutation : 0.00 0 0
2.29/2.37 c dins : 0.00 0 0
2.29/2.37 c undercover : 0.32 1 0
2.29/2.37 c nlp : 0.00 0 0
2.29/2.37 c trysol : 0.00 0 0
2.29/2.37 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.37 c primal LP : 0.01 0 0 0.00 0.00
2.29/2.37 c dual LP : 0.15 352 1584 4.50 10560.00
2.29/2.37 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.37 c barrier LP : 0.00 0 0 0.00 -
2.29/2.37 c diving/probing LP: 0.00 26 297 11.42 -
2.29/2.37 c strong branching : 1.18 850 16237 19.10 13760.17
2.29/2.37 c (at root node) : - 18 2110 117.22 -
2.29/2.37 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.37 c B&B Tree :
2.29/2.37 c number of runs : 1
2.29/2.37 c nodes : 193
2.29/2.37 c nodes (total) : 193
2.29/2.37 c nodes left : 0
2.29/2.37 c max depth : 38
2.29/2.37 c max depth (total): 38
2.29/2.37 c backtracks : 18 (9.3%)
2.29/2.37 c delayed cutoffs : 10
2.29/2.37 c repropagations : 43 (173 domain reductions, 10 cutoffs)
2.29/2.37 c avg switch length: 2.37
2.29/2.37 c switching time : 0.02
2.29/2.37 c Solution :
2.29/2.37 c Solutions found : 1 (1 improvements)
2.29/2.37 c First Solution : +3.00000000000000e+00 (in run 1, after 193 nodes, 2.07 seconds, depth 35, found by <relaxation>)
2.29/2.37 c Primal Bound : +3.00000000000000e+00 (in run 1, after 193 nodes, 2.07 seconds, depth 35, found by <relaxation>)
2.29/2.37 c Dual Bound : +3.00000000000000e+00
2.29/2.37 c Gap : 0.00 %
2.29/2.37 c Root Dual Bound : +3.00000000000000e+00
2.29/2.37 c Root Iterations : 399
2.29/2.37 c Time complete: 2.37.