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-2666449-1276647781.opb>
0.00/0.01 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 244 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) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1768 impls, 0 clqs
0.00/0.04 c (round 2) 23 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 0 upgd conss, 2507 impls, 0 clqs
0.00/0.05 c (round 3) 33 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 10 upgd conss, 3067 impls, 0 clqs
0.00/0.05 c (round 4) 43 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 55 chg coeffs, 10 upgd conss, 3547 impls, 0 clqs
0.00/0.05 c (round 5) 53 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 10 upgd conss, 3947 impls, 0 clqs
0.00/0.06 c (round 6) 63 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 10 upgd conss, 4267 impls, 0 clqs
0.00/0.06 c (round 7) 73 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 10 upgd conss, 4507 impls, 0 clqs
0.00/0.06 c (round 8) 83 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 10 upgd conss, 4667 impls, 0 clqs
0.00/0.07 c (round 9) 93 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 10 upgd conss, 4747 impls, 0 clqs
0.00/0.07 c (round 10) 103 del vars, 73 del conss, 0 chg bounds, 0 chg sides, 103 chg coeffs, 10 upgd conss, 4747 impls, 0 clqs
0.00/0.09 c (0.1s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.09 c presolving (11 rounds):
0.00/0.09 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.00/0.09 c 4783 implications, 0 cliques
0.00/0.09 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 162 constraints
0.00/0.09 c 142 constraints of type <and>
0.00/0.09 c 9 constraints of type <linear>
0.00/0.09 c 11 constraints of type <logicor>
0.00/0.09 c transformed objective value is always integral (scale: 2)
0.00/0.09 c Presolving Time: 0.05
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 1.2.1.2
0.00/0.09 c
0.00/0.09 c # frequency for displaying node information lines
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.09 c display/freq = 10000
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1800
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 1620
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify inequalities
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/linear/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c heuristics/undercover/freq = 0
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/rapidlearning/freq = 0
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 c
0.09/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.10 c 0.1s| 1 | 0 | 20 | - |1291k| 0 | 10 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 312 | - |1321k| 0 | 36 | 257 | 162 | 257 | 316 | 13 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.20 c 0.1s| 1 | 0 | 331 | - |1378k| 0 | 49 | 257 | 162 | 257 | 337 | 34 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 376 | - |1462k| 0 | 58 | 257 | 162 | 257 | 357 | 54 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 416 | - |1534k| 0 | 61 | 257 | 162 | 257 | 377 | 74 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.32 c 0.2s| 1 | 0 | 455 | - |1586k| 0 | 76 | 257 | 162 | 257 | 394 | 91 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.40 c 0.3s| 1 | 0 | 528 | - |1646k| 0 | 84 | 257 | 162 | 257 | 413 | 110 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.59 c 0.5s| 1 | 2 | 528 | - |1647k| 0 | 84 | 257 | 162 | 257 | 413 | 110 | 0 | 16 | 3.000000e+00 | -- | Inf
1.89/1.92 o 19
1.89/1.92 c * 1.8s| 280 | 84 | 2313 | 6.4 |1859k| 57 | - | 257 | 300 | 257 | 191 | 562 | 138 |1114 | 3.000000e+00 | 1.900000e+01 | 533.33%
1.89/1.98 o 3
1.89/1.98 c * 1.8s| 301 | 0 | 2457 | 6.4 |1834k| 57 | - | 257 | 319 | 257 | 187 | 604 | 157 |1160 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.89/1.98 c
1.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time (sec) : 1.83
1.89/1.98 c Solving Nodes : 301
1.89/1.98 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.89/1.98 c Dual Bound : +3.00000000000000e+00
1.89/1.98 c Gap : 0.00 %
1.89/1.98 s OPTIMUM FOUND
1.89/1.98 v x135 -x134 -x133 x132 -x131 -x130 -x129 x128 -x127 -x126 x90 -x89 -x88 x87 x86 -x125 -x124 x123 x122 x121 -x85 -x84 x83 x82 x81
1.89/1.98 v -x120 x119 x118 -x117 -x116 x80 -x79 x78 -x77 x76 -x115 x114 x113 x112 -x111 x75 x74 -x73 x72 x71 -x110 x109 x108 -x107 -x106
1.89/1.98 v x70 -x69 -x68 x67 x66 -x105 x104 x103 x102 x101 -x65 x64 x63 -x62 x61 -x100 -x99 x98 x97 -x96 x60 -x59 -x58 -x57 x56 -x95 -x94
1.89/1.98 v -x93 -x92 x91 x55 -x54 -x53 x52 x51 x50 x49 x48 x47 x46 x45 -x44 x43 -x42 x41 -x40 x39 -x38 x37 x36 -x35 x34 x33 x32 x31
1.89/1.98 v x30 x29 -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
1.89/1.98 c SCIP Status : problem is solved [optimal solution found]
1.89/1.98 c Solving Time : 1.83
1.89/1.98 c Original Problem :
1.89/1.98 c Problem name : HOME/instance-2666449-1276647781.opb
1.89/1.98 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 244 initial, 244 maximal
1.89/1.98 c Presolved Problem :
1.89/1.98 c Problem name : t_HOME/instance-2666449-1276647781.opb
1.89/1.98 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.98 c Constraints : 162 initial, 319 maximal
1.89/1.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.98 c trivial : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c probing : 0.02 0 0 0 0 0 0 0 0
1.89/1.98 c and : 0.01 18 73 0 0 0 73 0 73
1.89/1.98 c linear : 0.01 2 10 0 0 0 0 0 30
1.89/1.98 c logicor : 0.00 0 0 0 0 0 0 0 0
1.89/1.98 c root node : - 0 - - 0 - - - -
1.89/1.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.98 c integral : 0 0 0 267 0 6 72 0 0 430
1.89/1.98 c and : 142 510 1389 0 0 41 987 509 0 0
1.89/1.98 c linear : 9 6 1346 0 0 64 538 0 0 0
1.89/1.98 c logicor : 11+ 6 370 0 0 6 98 0 0 0
1.89/1.98 c countsols : 0 0 0 2 0 0 0 0 0 0
1.89/1.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.98 c integral : 1.13 0.00 0.00 1.13 0.00
1.89/1.98 c and : 0.03 0.01 0.02 0.00 0.00
1.89/1.98 c linear : 0.01 0.00 0.01 0.00 0.00
1.89/1.98 c logicor : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.98 c Propagators : Time Calls Cutoffs DomReds
1.89/1.98 c vbounds : 0.00 2 0 0
1.89/1.98 c rootredcost : 0.00 1 0 0
1.89/1.98 c pseudoobj : 0.00 1036 0 2
1.89/1.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.98 c propagation : 0.01 111 110 510 16.3 8 13.9 -
1.89/1.98 c infeasible LP : 0.00 2 2 12 19.2 0 0.0 0
1.89/1.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.98 c applied globally : - - - 157 12.3 - - -
1.89/1.98 c applied locally : - - - 0 0.0 - - -
1.89/1.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.98 c cut pool : 0.00 5 - - 61 - (maximal pool size: 331)
1.89/1.98 c redcost : 0.00 512 0 0 0 0
1.89/1.98 c impliedbounds : 0.00 6 0 0 25 0
1.89/1.98 c intobj : 0.00 0 0 0 0 0
1.89/1.98 c cgmip : 0.00 0 0 0 0 0
1.89/1.98 c gomory : 0.08 6 0 0 205 0
1.89/1.98 c strongcg : 0.05 6 0 0 350 0
1.89/1.98 c cmir : 0.03 6 0 0 89 0
1.89/1.98 c flowcover : 0.06 6 0 0 178 0
1.89/1.98 c clique : 0.00 6 0 0 1 0
1.89/1.98 c zerohalf : 0.00 0 0 0 0 0
1.89/1.98 c mcf : 0.00 1 0 0 0 0
1.89/1.98 c rapidlearning : 0.02 1 0 0 0 0
1.89/1.98 c Pricers : Time Calls Vars
1.89/1.98 c problem variables: 0.00 0 0
1.89/1.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.98 c relpscost : 1.13 265 6 72 0 0 430
1.89/1.98 c pscost : 0.00 0 0 0 0 0 0
1.89/1.98 c inference : 0.00 0 0 0 0 0 0
1.89/1.98 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.98 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.98 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.98 c random : 0.00 0 0 0 0 0 0
1.89/1.98 c Primal Heuristics : Time Calls Found
1.89/1.98 c LP solutions : 0.00 - 2
1.89/1.98 c pseudo solutions : 0.00 - 0
1.89/1.98 c crossover : 0.00 0 0
1.89/1.98 c fracdiving : 0.00 0 0
1.89/1.98 c veclendiving : 0.00 0 0
1.89/1.98 c objpscostdiving : 0.00 0 0
1.89/1.98 c rootsoldiving : 0.00 0 0
1.89/1.98 c linesearchdiving : 0.00 0 0
1.89/1.98 c guideddiving : 0.00 0 0
1.89/1.98 c intshifting : 0.00 0 0
1.89/1.98 c oneopt : 0.00 1 0
1.89/1.98 c coefdiving : 0.00 1 0
1.89/1.98 c pscostdiving : 0.00 1 0
1.89/1.98 c feaspump : 0.01 1 0
1.89/1.98 c trivial : 0.00 2 0
1.89/1.98 c simplerounding : 0.00 0 0
1.89/1.98 c zirounding : 0.00 213 0
1.89/1.98 c rounding : 0.00 274 0
1.89/1.98 c shifting : 0.05 49 0
1.89/1.98 c twoopt : 0.00 0 0
1.89/1.98 c fixandinfer : 0.00 0 0
1.89/1.98 c intdiving : 0.00 0 0
1.89/1.98 c actconsdiving : 0.00 0 0
1.89/1.98 c octane : 0.00 0 0
1.89/1.98 c rens : 0.01 1 0
1.89/1.98 c rins : 0.00 0 0
1.89/1.98 c localbranching : 0.00 0 0
1.89/1.98 c mutation : 0.00 0 0
1.89/1.98 c dins : 0.00 0 0
1.89/1.98 c undercover : 0.01 1 0
1.89/1.98 c nlp : 0.00 0 0
1.89/1.98 c trysol : 0.00 0 0
1.89/1.98 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.98 c primal LP : 0.02 0 0 0.00 0.00
1.89/1.98 c dual LP : 0.21 524 2151 4.10 10242.86
1.89/1.98 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.98 c barrier LP : 0.00 0 0 0.00 -
1.89/1.98 c diving/probing LP: 0.00 32 306 9.56 -
1.89/1.98 c strong branching : 1.12 1160 11334 9.77 10119.64
1.89/1.98 c (at root node) : - 16 1211 75.69 -
1.89/1.98 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.98 c B&B Tree :
1.89/1.98 c number of runs : 1
1.89/1.98 c nodes : 301
1.89/1.98 c nodes (total) : 301
1.89/1.98 c nodes left : 0
1.89/1.98 c max depth : 57
1.89/1.98 c max depth (total): 57
1.89/1.98 c backtracks : 48 (15.9%)
1.89/1.98 c delayed cutoffs : 38
1.89/1.98 c repropagations : 184 (446 domain reductions, 28 cutoffs)
1.89/1.98 c avg switch length: 3.33
1.89/1.98 c switching time : 0.03
1.89/1.98 c Solution :
1.89/1.98 c Solutions found : 2 (2 improvements)
1.89/1.98 c First Solution : +1.90000000000000e+01 (in run 1, after 280 nodes, 1.77 seconds, depth 57, found by <relaxation>)
1.89/1.98 c Primal Bound : +3.00000000000000e+00 (in run 1, after 301 nodes, 1.83 seconds, depth 56, found by <relaxation>)
1.89/1.98 c Dual Bound : +3.00000000000000e+00
1.89/1.98 c Gap : 0.00 %
1.89/1.98 c Root Dual Bound : +3.00000000000000e+00
1.89/1.98 c Root Iterations : 528
1.89/1.99 c Time complete: 1.98.