0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703118-1278564482.opb>
0.00/0.01 c original problem has 560 variables (560 bin, 0 int, 0 impl, 0 cont) and 409 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) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 45 chg coeffs, 0 upgd conss, 2464 impls, 0 clqs
0.00/0.05 c (round 2) 22 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 9 upgd conss, 3640 impls, 0 clqs
0.00/0.05 c (round 3) 36 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 69 chg coeffs, 9 upgd conss, 4648 impls, 0 clqs
0.00/0.06 c (round 4) 50 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 9 upgd conss, 5488 impls, 0 clqs
0.00/0.06 c (round 5) 64 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 93 chg coeffs, 9 upgd conss, 6160 impls, 0 clqs
0.00/0.06 c (round 6) 78 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 105 chg coeffs, 9 upgd conss, 6664 impls, 0 clqs
0.00/0.06 c (round 7) 92 del vars, 72 del conss, 0 chg bounds, 0 chg sides, 117 chg coeffs, 9 upgd conss, 7000 impls, 0 clqs
0.00/0.07 c (round 8) 106 del vars, 84 del conss, 0 chg bounds, 0 chg sides, 129 chg coeffs, 9 upgd conss, 7168 impls, 0 clqs
0.00/0.07 c (round 9) 120 del vars, 96 del conss, 0 chg bounds, 0 chg sides, 141 chg coeffs, 9 upgd conss, 7168 impls, 0 clqs
0.08/0.09 c (0.1s) probing: 192/440 (43.6%) - 0 fixings, 0 aggregations, 16 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 (10 rounds):
0.08/0.09 c 120 deleted vars, 96 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 141 changed coefficients
0.08/0.09 c 7200 implications, 0 cliques
0.08/0.09 c presolved problem has 440 variables (440 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.08/0.09 c 288 constraints of type <and>
0.08/0.09 c 8 constraints of type <linear>
0.08/0.09 c 9 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.07
0.08/0.09 c - non default parameters ----------------------------------------------------------------------
0.08/0.09 c # SCIP version 1.2.1.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.08/0.09 c # [type: int, range: [1,2], default: 1]
0.08/0.09 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.08/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.08/0.09 c constraints/indicator/addCouplingCons = 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.08/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.08/0.09 c 0.1s| 1 | 0 | 20 | - |2102k| 0 | 11 | 440 | 305 | 440 | 593 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.80/0.80 c 0.8s| 1 | 0 | 483 | - |2129k| 0 | 20 | 440 | 305 | 440 | 596 | 3 | 0 | 0 | 3.000000e+00 | -- | Inf
0.80/0.82 c 0.8s| 1 | 0 | 493 | - |2156k| 0 | 23 | 440 | 305 | 440 | 603 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.80/0.85 c 0.8s| 1 | 0 | 506 | - |2179k| 0 | 37 | 440 | 305 | 440 | 609 | 16 | 0 | 0 | 3.000000e+00 | -- | Inf
0.80/0.89 c 0.9s| 1 | 0 | 533 | - |2213k| 0 | 41 | 440 | 305 | 440 | 621 | 28 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.95 c 0.9s| 1 | 0 | 557 | - |2239k| 0 | 59 | 440 | 305 | 440 | 630 | 37 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.03 c 1.0s| 1 | 0 | 586 | - |2283k| 0 | 72 | 440 | 305 | 440 | 646 | 53 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.17 c 1.2s| 1 | 2 | 586 | - |2284k| 0 | 72 | 440 | 305 | 440 | 646 | 53 | 0 | 16 | 3.000000e+00 | -- | Inf
11.09/11.16 o 3
11.09/11.16 c *11.1s| 5178 | 0 | 23708 | 4.5 |3814k| 80 | - | 440 |3138 | 440 | 167 |8918 |3192 |2982 | 3.000000e+00 | 3.000000e+00 | 0.00%
11.09/11.16 c
11.09/11.16 c SCIP Status : problem is solved [optimal solution found]
11.09/11.16 c Solving Time (sec) : 11.15
11.09/11.16 c Solving Nodes : 5178
11.09/11.16 c Primal Bound : +3.00000000000000e+00 (1 solutions)
11.09/11.16 c Dual Bound : +3.00000000000000e+00
11.09/11.16 c Gap : 0.00 %
11.09/11.16 s OPTIMUM FOUND
11.09/11.16 v x168 -x167 -x166 x165 x164 -x163 -x162 -x161 x160 -x159 x158 x157 x156 x155 x112 -x111 x110 -x109 -x108 -x107 x106 -x154 -x153
11.09/11.16 v -x152 -x151 -x150 -x149 -x148 x105 -x104 -x103 -x102 -x101 x100 x99 -x147 -x146 -x145 -x144 -x143 -x142 x141 -x98 -x97 -x96 -x95
11.09/11.16 v -x94 -x93 x92 -x140 -x139 x138 -x137 -x136 x135 x134 -x91 x90 -x89 x88 -x87 x86 x85 -x133 x132 x131 -x130 -x129 -x128 x127
11.09/11.16 v -x84 x83 -x82 -x81 -x80 -x79 x78 -x126 -x125 -x124 -x123 -x122 x121 -x120 x77 -x76 -x75 -x74 -x73 -x72 x71 -x119 -x118 -x117
11.09/11.16 v -x116 -x115 x114 -x113 x70 x69 -x68 x67 -x66 x65 x64 x63 x62 x61 x60 -x59 -x58 x57 x56 -x55 x54 x53 -x52 x51 x50 x49 -x48 -x47
11.09/11.16 v -x46 -x45 x44 x43 -x42 -x41 -x40 -x39 -x38 x37 x36 x35 -x34 -x33 x32 -x31 x30 x29 x28 x27 -x26 -x25 -x24 -x23 x22 -x21 -x20
11.09/11.16 v -x19 -x18 -x17 x16 x15 x14 x13 x12 x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
11.09/11.16 c SCIP Status : problem is solved [optimal solution found]
11.09/11.16 c Solving Time : 11.15
11.09/11.16 c Original Problem :
11.09/11.16 c Problem name : HOME/instance-2703118-1278564482.opb
11.09/11.16 c Variables : 560 (560 binary, 0 integer, 0 implicit integer, 0 continuous)
11.09/11.16 c Constraints : 409 initial, 409 maximal
11.09/11.16 c Presolved Problem :
11.09/11.16 c Problem name : t_HOME/instance-2703118-1278564482.opb
11.09/11.16 c Variables : 440 (440 binary, 0 integer, 0 implicit integer, 0 continuous)
11.09/11.16 c Constraints : 305 initial, 3145 maximal
11.09/11.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
11.09/11.16 c trivial : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c dualfix : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c implics : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c probing : 0.02 0 0 0 0 0 0 0 0
11.09/11.16 c and : 0.03 16 96 0 0 0 96 0 96
11.09/11.16 c linear : 0.01 1 7 0 0 0 0 0 45
11.09/11.16 c logicor : 0.00 0 0 0 0 0 0 0 0
11.09/11.16 c root node : - 0 - - 0 - - - -
11.09/11.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
11.09/11.16 c integral : 0 0 0 3935 0 0 103 0 0 7714
11.09/11.16 c and : 288 8018 17639 1 0 334 25349 8878 0 0
11.09/11.16 c linear : 8 6 17305 1 0 1828 11146 0 0 0
11.09/11.16 c logicor : 9+ 6 7693 1 0 47 3317 0 0 0
11.09/11.16 c countsols : 0 0 0 1 0 0 0 0 0 0
11.09/11.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
11.09/11.16 c integral : 2.82 0.00 0.00 2.82 0.00
11.09/11.16 c and : 0.63 0.44 0.19 0.00 0.00
11.09/11.16 c linear : 0.51 0.00 0.51 0.00 0.00
11.09/11.16 c logicor : 0.20 0.00 0.20 0.00 0.00
11.09/11.16 c countsols : 0.00 0.00 0.00 0.00 0.00
11.09/11.16 c Propagators : Time Calls Cutoffs DomReds
11.09/11.16 c vbounds : 0.01 2 0 0
11.09/11.16 c rootredcost : 0.01 0 0 0
11.09/11.16 c pseudoobj : 0.02 17242 0 0
11.09/11.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.09/11.16 c propagation : 0.30 2209 2201 18940 33.4 294 20.0 -
11.09/11.16 c infeasible LP : 0.00 43 43 173 32.9 10 31.4 0
11.09/11.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.09/11.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.09/11.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.09/11.16 c applied globally : - - - 3192 17.0 - - -
11.09/11.16 c applied locally : - - - 0 0.0 - - -
11.09/11.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.09/11.16 c cut pool : 0.00 5 - - 37 - (maximal pool size: 118)
11.09/11.16 c redcost : 0.12 8018 0 0 0 0
11.09/11.16 c impliedbounds : 0.00 6 0 0 18 0
11.09/11.16 c intobj : 0.00 0 0 0 0 0
11.09/11.16 c cgmip : 0.00 0 0 0 0 0
11.09/11.16 c gomory : 0.06 6 0 0 57 0
11.09/11.16 c strongcg : 0.04 6 0 0 103 0
11.09/11.16 c cmir : 0.04 6 0 0 58 0
11.09/11.16 c flowcover : 0.08 6 0 0 85 0
11.09/11.16 c clique : 0.00 1 0 0 0 0
11.09/11.16 c zerohalf : 0.00 0 0 0 0 0
11.09/11.16 c mcf : 0.00 1 0 0 0 0
11.09/11.16 c rapidlearning : 0.06 1 0 0 0 0
11.09/11.16 c Pricers : Time Calls Vars
11.09/11.16 c problem variables: 0.00 0 0
11.09/11.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.09/11.16 c relpscost : 2.81 3934 0 103 0 0 7714
11.09/11.16 c pscost : 0.00 0 0 0 0 0 0
11.09/11.16 c inference : 0.00 0 0 0 0 0 0
11.09/11.16 c mostinf : 0.00 0 0 0 0 0 0
11.09/11.16 c leastinf : 0.00 0 0 0 0 0 0
11.09/11.16 c fullstrong : 0.00 0 0 0 0 0 0
11.09/11.16 c allfullstrong : 0.00 0 0 0 0 0 0
11.09/11.16 c random : 0.00 0 0 0 0 0 0
11.09/11.16 c Primal Heuristics : Time Calls Found
11.09/11.16 c LP solutions : 0.00 - 1
11.09/11.16 c pseudo solutions : 0.00 - 0
11.09/11.16 c oneopt : 0.01 0 0
11.09/11.16 c crossover : 0.00 0 0
11.09/11.16 c linesearchdiving : 0.00 0 0
11.09/11.16 c guideddiving : 0.00 0 0
11.09/11.16 c intshifting : 0.00 0 0
11.09/11.16 c coefdiving : 0.02 1 0
11.09/11.16 c pscostdiving : 0.01 1 0
11.09/11.16 c fracdiving : 0.01 1 0
11.09/11.16 c veclendiving : 0.00 1 0
11.09/11.16 c feaspump : 0.02 1 0
11.09/11.16 c objpscostdiving : 0.01 1 0
11.09/11.16 c rootsoldiving : 0.12 1 0
11.09/11.16 c trivial : 0.00 2 0
11.09/11.16 c simplerounding : 0.01 0 0
11.09/11.16 c zirounding : 0.02 1000 0
11.09/11.16 c rounding : 0.11 1220 0
11.09/11.16 c shifting : 0.67 318 0
11.09/11.16 c twoopt : 0.00 0 0
11.09/11.16 c fixandinfer : 0.00 0 0
11.09/11.16 c intdiving : 0.00 0 0
11.09/11.16 c actconsdiving : 0.00 0 0
11.09/11.16 c octane : 0.00 0 0
11.09/11.16 c rens : 0.02 1 0
11.09/11.16 c rins : 0.00 0 0
11.09/11.16 c localbranching : 0.00 0 0
11.09/11.16 c mutation : 0.00 0 0
11.09/11.16 c dins : 0.00 0 0
11.09/11.16 c undercover : 0.60 1 0
11.09/11.16 c nlp : 0.00 0 0
11.09/11.16 c trysol : 0.01 0 0
11.09/11.16 c LP : Time Calls Iterations Iter/call Iter/sec
11.09/11.16 c primal LP : 0.10 0 0 0.00 0.00
11.09/11.16 c dual LP : 3.05 8032 22849 2.84 7479.38
11.09/11.16 c lex dual LP : 0.00 0 0 0.00 -
11.09/11.16 c barrier LP : 0.00 0 0 0.00 -
11.09/11.16 c diving/probing LP: 0.10 196 859 4.38 8948.20
11.09/11.16 c strong branching : 2.73 2982 22343 7.49 8181.44
11.09/11.16 c (at root node) : - 16 854 53.38 -
11.09/11.16 c conflict analysis: 0.00 0 0 0.00 -
11.09/11.16 c B&B Tree :
11.09/11.16 c number of runs : 1
11.09/11.16 c nodes : 5178
11.09/11.16 c nodes (total) : 5178
11.09/11.16 c nodes left : 0
11.09/11.16 c max depth : 80
11.09/11.16 c max depth (total): 80
11.09/11.16 c backtracks : 1037 (20.0%)
11.09/11.16 c delayed cutoffs : 1839
11.09/11.16 c repropagations : 3630 (12258 domain reductions, 890 cutoffs)
11.09/11.16 c avg switch length: 3.79
11.09/11.16 c switching time : 0.48
11.09/11.16 c Solution :
11.09/11.16 c Solutions found : 1 (1 improvements)
11.09/11.16 c First Solution : +3.00000000000000e+00 (in run 1, after 5178 nodes, 11.14 seconds, depth 67, found by <relaxation>)
11.09/11.16 c Primal Bound : +3.00000000000000e+00 (in run 1, after 5178 nodes, 11.14 seconds, depth 67, found by <relaxation>)
11.09/11.16 c Dual Bound : +3.00000000000000e+00
11.09/11.16 c Gap : 0.00 %
11.09/11.16 c Root Dual Bound : +3.00000000000000e+00
11.09/11.16 c Root Iterations : 586
11.09/11.18 c Time complete: 11.17.