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-2665016-1276647732.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.02 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, 1840 impls, 0 clqs
0.00/0.05 c (round 2) 22 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 0 upgd conss, 2543 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, 3103 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, 3583 impls, 0 clqs
0.00/0.06 c (round 5) 53 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 10 upgd conss, 3983 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, 4303 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, 4543 impls, 0 clqs
0.00/0.07 c (round 8) 83 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 10 upgd conss, 4703 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, 4783 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, 4783 impls, 0 clqs
0.08/0.09 c (0.1s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.08/0.09 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.08/0.09 c presolving (11 rounds):
0.08/0.09 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.08/0.09 c 4819 implications, 0 cliques
0.08/0.09 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 162 constraints
0.08/0.09 c 142 constraints of type <and>
0.08/0.09 c 9 constraints of type <linear>
0.08/0.09 c 11 constraints of type <logicor>
0.08/0.09 c transformed objective value is always integral (scale: 2)
0.08/0.09 c Presolving Time: 0.04
0.08/0.09 c - non default parameters ----------------------------------------------------------------------
0.08/0.09 c # SCIP version 1.2.1.2
0.08/0.09 c
0.08/0.09 c # frequency for displaying node information lines
0.08/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.08/0.09 c display/freq = 10000
0.08/0.09 c
0.08/0.09 c # maximal time in seconds to run
0.08/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.09 c limits/time = 1800
0.08/0.09 c
0.08/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.08/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.08/0.09 c limits/memory = 1620
0.08/0.09 c
0.08/0.09 c # should presolving try to simplify inequalities
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.09 c constraints/linear/simplifyinequalities = TRUE
0.08/0.09 c
0.08/0.09 c # should presolving try to simplify knapsacks
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.08/0.09 c
0.08/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.09 c heuristics/undercover/freq = 0
0.08/0.09 c
0.08/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.08/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.08/0.09 c separating/rapidlearning/freq = 0
0.08/0.09 c
0.08/0.09 c -----------------------------------------------------------------------------------------------
0.08/0.09 c start solving
0.08/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 | 19 | - |1291k| 0 | 8 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 31 | - |1317k| 0 | 29 | 257 | 162 | 257 | 314 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 56 | - |1360k| 0 | 41 | 257 | 162 | 257 | 330 | 27 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 104 | - |1407k| 0 | 49 | 257 | 162 | 257 | 345 | 42 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 150 | - |1483k| 0 | 75 | 257 | 162 | 257 | 372 | 69 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 219 | - |1677k| 0 | 99 | 257 | 162 | 257 | 399 | 96 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 283 | - |1783k| 0 | 100 | 257 | 162 | 257 | 430 | 127 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.61 c 0.5s| 1 | 2 | 283 | - |1784k| 0 | 100 | 257 | 162 | 257 | 430 | 127 | 0 | 26 | 3.000000e+00 | -- | Inf
3.19/3.23 o 3
3.19/3.23 c * 2.9s| 286 | 0 | 4034 | 13.2 |1983k| 47 | - | 257 | 345 | 257 | 256 | 980 | 183 |1452 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.19/3.23 c
3.19/3.23 c SCIP Status : problem is solved [optimal solution found]
3.19/3.23 c Solving Time (sec) : 2.93
3.19/3.23 c Solving Nodes : 286
3.19/3.23 c Primal Bound : +3.00000000000000e+00 (1 solutions)
3.19/3.23 c Dual Bound : +3.00000000000000e+00
3.19/3.23 c Gap : 0.00 %
3.19/3.23 s OPTIMUM FOUND
3.19/3.23 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 -x120
3.19/3.23 v -x119 -x118 -x117 -x116 x80 x79 -x78 -x77 x76 x115 x114 x113 x112 -x111 -x75 -x74 -x73 -x72 x71 -x110 -x109 -x108 -x107 x106
3.19/3.23 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
3.19/3.23 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
3.19/3.23 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
3.19/3.23 c SCIP Status : problem is solved [optimal solution found]
3.19/3.23 c Solving Time : 2.93
3.19/3.23 c Original Problem :
3.19/3.23 c Problem name : HOME/instance-2665016-1276647732.opb
3.19/3.23 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
3.19/3.23 c Constraints : 244 initial, 244 maximal
3.19/3.23 c Presolved Problem :
3.19/3.23 c Problem name : t_HOME/instance-2665016-1276647732.opb
3.19/3.23 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
3.19/3.23 c Constraints : 162 initial, 345 maximal
3.19/3.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.19/3.23 c trivial : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c implics : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c probing : 0.02 0 0 0 0 0 0 0 0
3.19/3.23 c and : 0.01 18 73 0 0 0 73 0 73
3.19/3.23 c linear : 0.01 2 10 0 0 0 0 0 30
3.19/3.23 c logicor : 0.00 0 0 0 0 0 0 0 0
3.19/3.23 c root node : - 0 - - 0 - - - -
3.19/3.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.19/3.23 c integral : 0 0 0 262 0 2 67 0 0 444
3.19/3.23 c and : 142 566 1343 0 0 22 939 884 0 0
3.19/3.23 c linear : 9 6 1320 0 0 61 577 0 0 0
3.19/3.23 c logicor : 11+ 6 354 1 0 1 69 0 0 0
3.19/3.23 c countsols : 0 0 0 1 0 0 0 0 0 0
3.19/3.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.19/3.23 c integral : 1.71 0.00 0.00 1.71 0.00
3.19/3.23 c and : 0.02 0.02 0.00 0.00 0.00
3.19/3.23 c linear : 0.04 0.00 0.04 0.00 0.00
3.19/3.23 c logicor : 0.00 0.00 0.00 0.00 0.00
3.19/3.23 c countsols : 0.00 0.00 0.00 0.00 0.00
3.19/3.23 c Propagators : Time Calls Cutoffs DomReds
3.19/3.23 c vbounds : 0.00 2 0 0
3.19/3.23 c rootredcost : 0.00 0 0 0
3.19/3.23 c pseudoobj : 0.00 994 0 0
3.19/3.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.19/3.23 c propagation : 0.02 84 83 482 20.6 16 21.7 -
3.19/3.23 c infeasible LP : 0.00 12 12 39 14.2 3 10.3 0
3.19/3.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.19/3.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.19/3.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.19/3.23 c applied globally : - - - 183 14.4 - - -
3.19/3.23 c applied locally : - - - 0 0.0 - - -
3.19/3.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.19/3.23 c cut pool : 0.00 5 - - 79 - (maximal pool size: 385)
3.19/3.23 c redcost : 0.00 567 0 0 0 0
3.19/3.23 c impliedbounds : 0.00 6 0 0 42 0
3.19/3.23 c intobj : 0.00 0 0 0 0 0
3.19/3.23 c cgmip : 0.00 0 0 0 0 0
3.19/3.23 c gomory : 0.04 6 0 0 165 0
3.19/3.23 c strongcg : 0.05 6 0 0 495 0
3.19/3.23 c cmir : 0.02 6 0 0 97 0
3.19/3.23 c flowcover : 0.07 6 0 0 174 0
3.19/3.23 c clique : 0.00 6 0 0 0 0
3.19/3.23 c zerohalf : 0.00 0 0 0 0 0
3.19/3.23 c mcf : 0.00 1 0 0 0 0
3.19/3.23 c rapidlearning : 0.02 1 0 0 0 0
3.19/3.23 c Pricers : Time Calls Vars
3.19/3.23 c problem variables: 0.00 0 0
3.19/3.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.19/3.23 c relpscost : 1.71 261 2 67 0 0 444
3.19/3.23 c pscost : 0.00 0 0 0 0 0 0
3.19/3.23 c inference : 0.00 0 0 0 0 0 0
3.19/3.23 c mostinf : 0.00 0 0 0 0 0 0
3.19/3.23 c leastinf : 0.00 0 0 0 0 0 0
3.19/3.23 c fullstrong : 0.00 0 0 0 0 0 0
3.19/3.23 c allfullstrong : 0.00 0 0 0 0 0 0
3.19/3.23 c random : 0.00 0 0 0 0 0 0
3.19/3.23 c Primal Heuristics : Time Calls Found
3.19/3.23 c LP solutions : 0.00 - 1
3.19/3.23 c pseudo solutions : 0.00 - 0
3.19/3.23 c oneopt : 0.00 0 0
3.19/3.23 c crossover : 0.00 0 0
3.19/3.23 c linesearchdiving : 0.00 0 0
3.19/3.23 c guideddiving : 0.00 0 0
3.19/3.23 c coefdiving : 0.00 1 0
3.19/3.23 c pscostdiving : 0.01 1 0
3.19/3.23 c fracdiving : 0.01 1 0
3.19/3.23 c veclendiving : 0.01 1 0
3.19/3.23 c feaspump : 0.01 1 0
3.19/3.23 c objpscostdiving : 0.00 1 0
3.19/3.23 c rootsoldiving : 0.04 1 0
3.19/3.23 c trivial : 0.00 2 0
3.19/3.23 c simplerounding : 0.00 0 0
3.19/3.23 c zirounding : 0.00 220 0
3.19/3.23 c rounding : 0.02 320 0
3.19/3.23 c shifting : 0.10 57 0
3.19/3.23 c intshifting : 0.00 0 0
3.19/3.23 c twoopt : 0.00 0 0
3.19/3.23 c fixandinfer : 0.00 0 0
3.19/3.23 c intdiving : 0.00 0 0
3.19/3.23 c actconsdiving : 0.00 0 0
3.19/3.23 c octane : 0.00 0 0
3.19/3.23 c rens : 0.01 1 0
3.19/3.23 c rins : 0.00 0 0
3.19/3.23 c localbranching : 0.00 0 0
3.19/3.23 c mutation : 0.00 0 0
3.19/3.23 c dins : 0.00 0 0
3.19/3.23 c undercover : 0.00 1 0
3.19/3.23 c nlp : 0.00 0 0
3.19/3.23 c trysol : 0.00 0 0
3.19/3.23 c LP : Time Calls Iterations Iter/call Iter/sec
3.19/3.23 c primal LP : 0.13 0 0 0.00 0.00
3.19/3.23 c dual LP : 0.48 579 3253 5.62 6777.08
3.19/3.23 c lex dual LP : 0.00 0 0 0.00 -
3.19/3.23 c barrier LP : 0.00 0 0 0.00 -
3.19/3.23 c diving/probing LP: 0.08 82 781 9.52 9762.50
3.19/3.23 c strong branching : 1.71 1452 17682 12.18 10340.35
3.19/3.23 c (at root node) : - 26 1653 63.58 -
3.19/3.23 c conflict analysis: 0.00 0 0 0.00 -
3.19/3.23 c B&B Tree :
3.19/3.23 c number of runs : 1
3.19/3.23 c nodes : 286
3.19/3.23 c nodes (total) : 286
3.19/3.23 c nodes left : 0
3.19/3.23 c max depth : 47
3.19/3.23 c max depth (total): 47
3.19/3.23 c backtracks : 39 (13.6%)
3.19/3.23 c delayed cutoffs : 37
3.19/3.23 c repropagations : 145 (395 domain reductions, 17 cutoffs)
3.19/3.23 c avg switch length: 3.13
3.19/3.23 c switching time : 0.16
3.19/3.23 c Solution :
3.19/3.23 c Solutions found : 1 (1 improvements)
3.19/3.23 c First Solution : +3.00000000000000e+00 (in run 1, after 286 nodes, 2.92 seconds, depth 46, found by <relaxation>)
3.19/3.23 c Primal Bound : +3.00000000000000e+00 (in run 1, after 286 nodes, 2.92 seconds, depth 46, found by <relaxation>)
3.19/3.23 c Dual Bound : +3.00000000000000e+00
3.19/3.23 c Gap : 0.00 %
3.19/3.23 c Root Dual Bound : +3.00000000000000e+00
3.19/3.23 c Root Iterations : 283
3.19/3.24 c Time complete: 3.23.