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-2666437-1276647603.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.02 c presolving:
0.00/0.04 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.05 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.06 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.07/0.08 c (0.1s) probing: 161/228 (70.6%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.07/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.07/0.08 c presolving (10 rounds):
0.07/0.08 c 92 deleted vars, 65 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 92 changed coefficients
0.07/0.08 c 3839 implications, 0 cliques
0.07/0.08 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.07/0.08 c 126 constraints of type <and>
0.07/0.08 c 8 constraints of type <linear>
0.07/0.08 c 10 constraints of type <logicor>
0.07/0.08 c transformed objective value is always integral (scale: 2)
0.07/0.08 c Presolving Time: 0.05
0.07/0.08 c - non default parameters ----------------------------------------------------------------------
0.07/0.08 c # SCIP version 1.2.1.2
0.07/0.08 c
0.07/0.08 c # frequency for displaying node information lines
0.07/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.07/0.08 c display/freq = 10000
0.07/0.08 c
0.07/0.08 c # maximal time in seconds to run
0.07/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.08 c limits/time = 1800
0.07/0.08 c
0.07/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.07/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.07/0.08 c limits/memory = 1620
0.07/0.08 c
0.07/0.08 c # should presolving try to simplify inequalities
0.07/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.08 c constraints/linear/simplifyinequalities = TRUE
0.07/0.08 c
0.07/0.08 c # should presolving try to simplify knapsacks
0.07/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.07/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.07/0.08 c
0.07/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.07/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.08 c heuristics/undercover/freq = 0
0.07/0.08 c
0.07/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.07/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.07/0.08 c separating/rapidlearning/freq = 0
0.07/0.08 c
0.07/0.08 c -----------------------------------------------------------------------------------------------
0.07/0.08 c start solving
0.07/0.09 c
0.07/0.09 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.07/0.09 c 0.1s| 1 | 0 | 18 | - |1156k| 0 | 9 | 228 | 144 | 228 | 269 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 266 | - |1187k| 0 | 32 | 228 | 144 | 228 | 281 | 12 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 283 | - |1228k| 0 | 44 | 228 | 144 | 228 | 298 | 29 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 309 | - |1293k| 0 | 49 | 228 | 144 | 228 | 315 | 46 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 348 | - |1368k| 0 | 52 | 228 | 144 | 228 | 332 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 373 | - |1450k| 0 | 66 | 228 | 144 | 228 | 350 | 81 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 423 | - |1536k| 0 | 70 | 228 | 144 | 228 | 367 | 98 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.46 c 0.4s| 1 | 2 | 423 | - |1537k| 0 | 70 | 228 | 144 | 228 | 367 | 98 | 0 | 16 | 3.000000e+00 | -- | Inf
2.99/3.04 o 31
2.99/3.04 c * 2.8s| 926 | 247 | 6296 | 6.3 |2090k| 48 | - | 228 | 624 | 228 | 157 |1524 | 480 |1689 | 3.000000e+00 | 3.100000e+01 | 933.33%
2.99/3.09 o 3
2.99/3.09 c * 2.9s| 962 | 0 | 6523 | 6.3 |1865k| 48 | - | 228 | 640 | 228 | 163 |1580 | 496 |1696 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.99/3.09 c
2.99/3.09 c SCIP Status : problem is solved [optimal solution found]
2.99/3.09 c Solving Time (sec) : 2.87
2.99/3.09 c Solving Nodes : 962
2.99/3.09 c Primal Bound : +3.00000000000000e+00 (2 solutions)
2.99/3.09 c Dual Bound : +3.00000000000000e+00
2.99/3.09 c Gap : 0.00 %
2.99/3.09 s OPTIMUM FOUND
2.99/3.09 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 x71
2.99/3.09 v -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 x59
2.99/3.09 v 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 x41
2.99/3.09 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 x15 x14 x13 -x12
2.99/3.09 v x11 x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
2.99/3.09 c SCIP Status : problem is solved [optimal solution found]
2.99/3.09 c Solving Time : 2.87
2.99/3.09 c Original Problem :
2.99/3.09 c Problem name : HOME/instance-2666437-1276647603.opb
2.99/3.09 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.09 c Constraints : 217 initial, 217 maximal
2.99/3.09 c Presolved Problem :
2.99/3.09 c Problem name : t_HOME/instance-2666437-1276647603.opb
2.99/3.09 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.09 c Constraints : 144 initial, 640 maximal
2.99/3.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.09 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c probing : 0.02 0 0 0 0 0 0 0 0
2.99/3.09 c and : 0.02 16 65 0 0 0 65 0 65
2.99/3.09 c linear : 0.01 2 9 0 0 0 0 0 27
2.99/3.09 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.09 c root node : - 0 - - 0 - - - -
2.99/3.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.09 c integral : 0 0 0 841 0 2 107 0 0 1528
2.99/3.09 c and : 126 1586 3530 2 0 58 3956 1493 0 0
2.99/3.09 c linear : 8 6 3472 2 0 220 2016 0 0 0
2.99/3.09 c logicor : 10+ 6 1477 2 0 15 479 0 0 0
2.99/3.09 c countsols : 0 0 0 2 0 0 0 0 0 0
2.99/3.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.09 c integral : 1.32 0.00 0.00 1.32 0.00
2.99/3.09 c and : 0.03 0.02 0.01 0.00 0.00
2.99/3.09 c linear : 0.04 0.00 0.04 0.00 0.00
2.99/3.09 c logicor : 0.01 0.00 0.01 0.00 0.00
2.99/3.09 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.09 c Propagators : Time Calls Cutoffs DomReds
2.99/3.09 c vbounds : 0.00 2 0 0
2.99/3.09 c rootredcost : 0.00 1 0 0
2.99/3.09 c pseudoobj : 0.01 3195 0 1
2.99/3.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.09 c propagation : 0.01 293 292 1572 18.9 38 15.1 -
2.99/3.09 c infeasible LP : 0.00 10 10 24 12.2 0 0.0 0
2.99/3.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.09 c applied globally : - - - 496 13.3 - - -
2.99/3.09 c applied locally : - - - 0 0.0 - - -
2.99/3.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.09 c cut pool : 0.00 5 - - 86 - (maximal pool size: 344)
2.99/3.09 c redcost : 0.03 1586 0 0 0 0
2.99/3.09 c impliedbounds : 0.00 6 0 0 20 0
2.99/3.09 c intobj : 0.00 0 0 0 0 0
2.99/3.09 c cgmip : 0.00 0 0 0 0 0
2.99/3.09 c gomory : 0.03 6 0 0 161 0
2.99/3.09 c strongcg : 0.06 6 0 0 415 0
2.99/3.09 c cmir : 0.01 6 0 0 83 0
2.99/3.09 c flowcover : 0.04 6 0 0 158 0
2.99/3.09 c clique : 0.00 6 0 0 1 0
2.99/3.09 c zerohalf : 0.00 0 0 0 0 0
2.99/3.09 c mcf : 0.00 1 0 0 0 0
2.99/3.09 c rapidlearning : 0.03 1 0 0 0 0
2.99/3.09 c Pricers : Time Calls Vars
2.99/3.09 c problem variables: 0.00 0 0
2.99/3.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.09 c relpscost : 1.32 839 2 107 0 0 1528
2.99/3.09 c pscost : 0.00 0 0 0 0 0 0
2.99/3.09 c inference : 0.00 0 0 0 0 0 0
2.99/3.09 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.09 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.09 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.09 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.09 c random : 0.00 0 0 0 0 0 0
2.99/3.09 c Primal Heuristics : Time Calls Found
2.99/3.09 c LP solutions : 0.00 - 2
2.99/3.09 c pseudo solutions : 0.00 - 0
2.99/3.09 c crossover : 0.00 0 0
2.99/3.09 c guideddiving : 0.00 0 0
2.99/3.09 c intshifting : 0.00 0 0
2.99/3.09 c oneopt : 0.00 1 0
2.99/3.09 c pscostdiving : 0.01 1 0
2.99/3.09 c fracdiving : 0.01 1 0
2.99/3.09 c veclendiving : 0.01 1 0
2.99/3.09 c linesearchdiving : 0.00 1 0
2.99/3.09 c feaspump : 0.01 1 0
2.99/3.09 c objpscostdiving : 0.02 1 0
2.99/3.09 c rootsoldiving : 0.02 1 0
2.99/3.09 c coefdiving : 0.01 2 0
2.99/3.09 c trivial : 0.00 2 0
2.99/3.09 c simplerounding : 0.00 0 0
2.99/3.09 c zirounding : 0.02 755 0
2.99/3.09 c rounding : 0.01 513 0
2.99/3.09 c shifting : 0.18 138 0
2.99/3.09 c twoopt : 0.00 0 0
2.99/3.09 c fixandinfer : 0.00 0 0
2.99/3.09 c intdiving : 0.00 0 0
2.99/3.09 c actconsdiving : 0.00 0 0
2.99/3.09 c octane : 0.00 0 0
2.99/3.09 c rens : 0.02 1 0
2.99/3.09 c rins : 0.00 0 0
2.99/3.09 c localbranching : 0.00 0 0
2.99/3.09 c mutation : 0.00 0 0
2.99/3.09 c dins : 0.00 0 0
2.99/3.09 c undercover : 0.01 1 0
2.99/3.09 c nlp : 0.00 0 0
2.99/3.09 c trysol : 0.00 0 0
2.99/3.09 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.09 c primal LP : 0.02 0 0 0.00 0.00
2.99/3.09 c dual LP : 0.55 1599 5572 3.48 10130.91
2.99/3.09 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.09 c barrier LP : 0.00 0 0 0.00 -
2.99/3.09 c diving/probing LP: 0.06 172 951 5.53 15850.00
2.99/3.09 c strong branching : 1.30 1696 15169 8.94 11668.46
2.99/3.09 c (at root node) : - 16 738 46.12 -
2.99/3.09 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.09 c B&B Tree :
2.99/3.09 c number of runs : 1
2.99/3.09 c nodes : 962
2.99/3.09 c nodes (total) : 962
2.99/3.09 c nodes left : 0
2.99/3.09 c max depth : 48
2.99/3.09 c max depth (total): 48
2.99/3.09 c backtracks : 120 (12.5%)
2.99/3.09 c delayed cutoffs : 287
2.99/3.09 c repropagations : 536 (1306 domain reductions, 86 cutoffs)
2.99/3.09 c avg switch length: 3.10
2.99/3.09 c switching time : 0.06
2.99/3.09 c Solution :
2.99/3.09 c Solutions found : 2 (2 improvements)
2.99/3.09 c First Solution : +3.10000000000000e+01 (in run 1, after 926 nodes, 2.83 seconds, depth 34, found by <relaxation>)
2.99/3.09 c Primal Bound : +3.00000000000000e+00 (in run 1, after 962 nodes, 2.87 seconds, depth 36, found by <relaxation>)
2.99/3.09 c Dual Bound : +3.00000000000000e+00
2.99/3.09 c Gap : 0.00 %
2.99/3.09 c Root Dual Bound : +3.00000000000000e+00
2.99/3.09 c Root Iterations : 423
3.09/3.10 c Time complete: 3.09.