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-2664964-1276646558.opb>
0.00/0.01 c original problem has 320 variables (320 bin, 0 int, 0 impl, 0 cont) and 217 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) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 1476 impls, 0 clqs
0.00/0.04 c (round 2) 22 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 0 upgd conss, 2127 impls, 0 clqs
0.00/0.04 c (round 3) 32 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 9 upgd conss, 2607 impls, 0 clqs
0.00/0.04 c (round 4) 42 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 9 upgd conss, 3007 impls, 0 clqs
0.00/0.05 c (round 5) 52 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 9 upgd conss, 3327 impls, 0 clqs
0.00/0.05 c (round 6) 62 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 9 upgd conss, 3567 impls, 0 clqs
0.00/0.05 c (round 7) 72 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 9 upgd conss, 3727 impls, 0 clqs
0.00/0.06 c (round 8) 82 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 84 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.00/0.06 c (round 9) 92 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.00/0.08 c (0.0s) probing: 161/228 (70.6%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.00/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (10 rounds):
0.00/0.08 c 92 deleted vars, 65 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 92 changed coefficients
0.00/0.08 c 3839 implications, 0 cliques
0.00/0.08 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.00/0.08 c 126 constraints of type <and>
0.00/0.08 c 8 constraints of type <linear>
0.00/0.08 c 10 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 2)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1800
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c heuristics/undercover/freq = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/0.08 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.08 c 0.0s| 1 | 0 | 18 | - |1156k| 0 | 9 | 228 | 144 | 228 | 269 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 33 | - |1188k| 0 | 31 | 228 | 144 | 228 | 280 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 54 | - |1231k| 0 | 33 | 228 | 144 | 228 | 292 | 23 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 103 | - |1290k| 0 | 56 | 228 | 144 | 228 | 308 | 39 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 154 | - |1373k| 0 | 83 | 228 | 144 | 228 | 336 | 67 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 210 | - |1525k| 0 | 95 | 228 | 144 | 228 | 360 | 91 | 0 | 0 | 3.000000e+00 | -- | Inf
0.30/0.35 c 0.3s| 1 | 0 | 276 | - |1572k| 0 | 99 | 228 | 144 | 228 | 381 | 112 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.51 c 0.4s| 1 | 2 | 276 | - |1572k| 0 | 99 | 228 | 144 | 228 | 381 | 112 | 0 | 16 | 3.000000e+00 | -- | Inf
2.39/2.43 o 3
2.39/2.43 c * 2.1s| 235 | 0 | 2964 | 11.5 |1751k| 39 | - | 228 | 323 | 228 | 227 | 791 | 179 |1185 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.39/2.43 c
2.39/2.43 c SCIP Status : problem is solved [optimal solution found]
2.39/2.43 c Solving Time (sec) : 2.10
2.39/2.43 c Solving Nodes : 235
2.39/2.43 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.39/2.43 c Dual Bound : +3.00000000000000e+00
2.39/2.43 c Gap : 0.00 %
2.39/2.43 s OPTIMUM FOUND
2.39/2.43 v -x120 -x119 x118 x117 -x116 -x115 -x114 x113 -x112 -x111 x80 -x79 -x78 -x77 x76 -x110 x109 -x108 x107 -x106 -x75 -x74 x73 -x72
2.39/2.43 v x71 -x105 -x104 -x103 x102 x101 x70 x69 -x68 -x67 x66 -x100 -x99 x98 x97 -x96 -x65 x64 -x63 x62 x61 -x95 -x94 x93 -x92 -x91 -x60
2.39/2.43 v -x59 x58 x57 x56 x90 -x89 x88 x87 -x86 -x55 x54 -x53 -x52 x51 -x85 -x84 -x83 x82 -x81 x50 -x49 x48 x47 x46 -x45 x44 x43 -x42
2.39/2.43 v x41 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 x15 x14 x13
2.39/2.43 v x12 x11 x10 x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
2.39/2.43 c SCIP Status : problem is solved [optimal solution found]
2.39/2.43 c Solving Time : 2.10
2.39/2.43 c Original Problem :
2.39/2.43 c Problem name : HOME/instance-2664964-1276646558.opb
2.39/2.43 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 217 initial, 217 maximal
2.39/2.43 c Presolved Problem :
2.39/2.43 c Problem name : t_HOME/instance-2664964-1276646558.opb
2.39/2.43 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.43 c Constraints : 144 initial, 323 maximal
2.39/2.43 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.43 c trivial : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.43 c probing : 0.01 0 0 0 0 0 0 0 0
2.39/2.43 c and : 0.01 16 65 0 0 0 65 0 65
2.39/2.43 c linear : 0.00 2 9 0 0 0 0 0 27
2.39/2.43 c logicor : 0.01 0 0 0 0 0 0 0 0
2.39/2.43 c root node : - 0 - - 0 - - - -
2.39/2.43 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.43 c integral : 0 0 0 228 0 5 124 0 0 350
2.39/2.43 c and : 126 512 1108 0 0 20 674 710 0 0
2.39/2.43 c linear : 8 6 1088 0 0 62 433 0 0 0
2.39/2.43 c logicor : 10+ 6 321 1 0 1 59 0 0 0
2.39/2.43 c countsols : 0 0 0 1 0 0 0 0 0 0
2.39/2.43 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.43 c integral : 1.10 0.00 0.00 1.10 0.00
2.39/2.43 c and : 0.02 0.00 0.02 0.00 0.00
2.39/2.43 c linear : 0.01 0.00 0.01 0.00 0.00
2.39/2.43 c logicor : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.43 c Propagators : Time Calls Cutoffs DomReds
2.39/2.43 c vbounds : 0.00 2 0 0
2.39/2.43 c rootredcost : 0.00 0 0 0
2.39/2.43 c pseudoobj : 0.00 774 0 0
2.39/2.43 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.43 c propagation : 0.00 83 80 587 24.7 2 31.0 -
2.39/2.43 c infeasible LP : 0.00 3 3 21 22.9 0 0.0 0
2.39/2.43 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.43 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.43 c applied globally : - - - 179 17.1 - - -
2.39/2.43 c applied locally : - - - 0 0.0 - - -
2.39/2.43 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.43 c cut pool : 0.00 5 - - 38 - (maximal pool size: 329)
2.39/2.43 c redcost : 0.01 513 0 0 0 0
2.39/2.43 c impliedbounds : 0.00 6 0 0 40 0
2.39/2.43 c intobj : 0.00 0 0 0 0 0
2.39/2.43 c cgmip : 0.00 0 0 0 0 0
2.39/2.43 c gomory : 0.05 6 0 0 168 0
2.39/2.43 c strongcg : 0.06 6 0 0 451 0
2.39/2.43 c cmir : 0.01 6 0 0 78 0
2.39/2.43 c flowcover : 0.05 6 0 0 147 0
2.39/2.43 c clique : 0.00 6 0 0 1 0
2.39/2.43 c zerohalf : 0.00 0 0 0 0 0
2.39/2.43 c mcf : 0.00 1 0 0 0 0
2.39/2.43 c rapidlearning : 0.03 1 0 0 0 0
2.39/2.43 c Pricers : Time Calls Vars
2.39/2.43 c problem variables: 0.00 0 0
2.39/2.43 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.43 c relpscost : 1.10 227 5 124 0 0 350
2.39/2.43 c pscost : 0.00 0 0 0 0 0 0
2.39/2.43 c inference : 0.00 0 0 0 0 0 0
2.39/2.43 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.43 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.43 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.43 c random : 0.00 0 0 0 0 0 0
2.39/2.43 c Primal Heuristics : Time Calls Found
2.39/2.43 c LP solutions : 0.00 - 1
2.39/2.43 c pseudo solutions : 0.00 - 0
2.39/2.43 c oneopt : 0.00 0 0
2.39/2.43 c crossover : 0.00 0 0
2.39/2.43 c guideddiving : 0.00 0 0
2.39/2.43 c linesearchdiving : 0.00 1 0
2.39/2.43 c objpscostdiving : 0.01 1 0
2.39/2.43 c pscostdiving : 0.01 2 0
2.39/2.43 c fracdiving : 0.00 2 0
2.39/2.43 c veclendiving : 0.00 2 0
2.39/2.43 c trivial : 0.00 2 0
2.39/2.43 c simplerounding : 0.00 0 0
2.39/2.43 c zirounding : 0.00 176 0
2.39/2.43 c rounding : 0.02 283 0
2.39/2.43 c shifting : 0.08 60 0
2.39/2.43 c intshifting : 0.00 0 0
2.39/2.43 c twoopt : 0.00 0 0
2.39/2.43 c fixandinfer : 0.00 0 0
2.39/2.43 c feaspump : 0.00 2 0
2.39/2.43 c coefdiving : 0.01 2 0
2.39/2.43 c intdiving : 0.00 0 0
2.39/2.43 c actconsdiving : 0.00 0 0
2.39/2.43 c rootsoldiving : 0.01 1 0
2.39/2.43 c octane : 0.00 0 0
2.39/2.43 c rens : 0.01 1 0
2.39/2.43 c rins : 0.00 0 0
2.39/2.43 c localbranching : 0.00 0 0
2.39/2.43 c mutation : 0.00 0 0
2.39/2.43 c dins : 0.00 0 0
2.39/2.43 c undercover : 0.01 1 0
2.39/2.43 c nlp : 0.00 0 0
2.39/2.43 c trysol : 0.00 0 0
2.39/2.43 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.43 c primal LP : 0.10 0 0 0.00 0.00
2.39/2.43 c dual LP : 0.38 538 2669 4.96 7023.68
2.39/2.43 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.43 c barrier LP : 0.00 0 0 0.00 -
2.39/2.43 c diving/probing LP: 0.03 31 295 9.52 9833.33
2.39/2.43 c strong branching : 1.10 1185 11408 9.63 10370.91
2.39/2.43 c (at root node) : - 16 1162 72.62 -
2.39/2.43 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.43 c B&B Tree :
2.39/2.43 c number of runs : 1
2.39/2.43 c nodes : 235
2.39/2.43 c nodes (total) : 235
2.39/2.43 c nodes left : 0
2.39/2.43 c max depth : 39
2.39/2.43 c max depth (total): 39
2.39/2.43 c backtracks : 37 (15.7%)
2.39/2.43 c delayed cutoffs : 13
2.39/2.43 c repropagations : 64 (218 domain reductions, 12 cutoffs)
2.39/2.43 c avg switch length: 3.51
2.39/2.43 c switching time : 0.13
2.39/2.43 c Solution :
2.39/2.43 c Solutions found : 1 (1 improvements)
2.39/2.43 c First Solution : +3.00000000000000e+00 (in run 1, after 235 nodes, 2.09 seconds, depth 38, found by <relaxation>)
2.39/2.43 c Primal Bound : +3.00000000000000e+00 (in run 1, after 235 nodes, 2.09 seconds, depth 38, found by <relaxation>)
2.39/2.43 c Dual Bound : +3.00000000000000e+00
2.39/2.43 c Gap : 0.00 %
2.39/2.43 c Root Dual Bound : +3.00000000000000e+00
2.39/2.43 c Root Iterations : 276
2.39/2.44 c Time complete: 2.43.