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-2702989-1278564375.opb>
0.00/0.01 c original problem has 486 variables (486 bin, 0 int, 0 impl, 0 cont) and 343 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, 40 chg coeffs, 0 upgd conss, 2304 impls, 0 clqs
0.00/0.04 c (round 2) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 10 upgd conss, 2326 impls, 0 clqs
0.00/0.06 c (0.1s) probing: 213/477 (44.7%) - 0 fixings, 0 aggregations, 43 implications, 0 bound changes
0.00/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (3 rounds):
0.00/0.06 c 9 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 40 changed coefficients
0.00/0.06 c 2412 implications, 0 cliques
0.00/0.06 c presolved problem has 477 variables (477 bin, 0 int, 0 impl, 0 cont) and 343 constraints
0.00/0.06 c 323 constraints of type <and>
0.00/0.06 c 9 constraints of type <linear>
0.00/0.06 c 11 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.05
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.3
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1789.99
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.07 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.07 c 0.1s| 1 | 0 | 14 | - |2003k| 0 | 4 | 477 | 343 | 477 | 666 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.13 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.26 c 0.3s| 1 | 0 | 515 | - |2044k| 0 | 7 | 477 | 356 | 477 | 670 | 4 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 528 | - |2066k| 0 | 13 | 477 | 356 | 477 | 694 | 28 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 544 | - |2096k| 0 | 26 | 477 | 356 | 477 | 701 | 35 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 566 | - |2110k| 0 | 36 | 477 | 356 | 477 | 712 | 46 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.37 c 0.4s| 1 | 0 | 589 | - |2121k| 0 | 41 | 477 | 356 | 477 | 724 | 58 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 599 | - |2137k| 0 | 45 | 477 | 356 | 477 | 733 | 67 | 0 | 0 | 2.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 2 | 599 | - |2138k| 0 | 45 | 477 | 356 | 477 | 733 | 67 | 0 | 10 | 2.000000e+00 | -- | Inf
5.99/6.09 o 33
5.99/6.09 c f 6.1s| 2089 | 798 | 15921 | 7.3 |4442k| 54 | - | 477 |2702 | 477 | 218 |6171 |2359 |2214 | 2.000000e+00 | 3.300000e+01 |1550.00%
10.89/10.91 o 9
10.89/10.91 c *10.9s| 4605 | 1613 | 29522 | 6.3 |6690k| 84 | - | 477 |5005 | 477 | 221 | 11k|5178 |3334 | 2.000000e+00 | 9.000000e+00 | 350.00%
13.89/13.97 o 7
13.89/13.97 c *14.0s| 6363 | 2599 | 40715 | 6.3 |8749k| 87 | - | 477 |7057 | 477 | 259 | 17k|7393 |3601 | 2.000000e+00 | 7.000000e+00 | 250.00%
13.89/13.99 o 2
13.89/13.99 c *14.0s| 6365 | 0 | 40726 | 6.3 |5997k| 87 | - | 477 |6786 | 477 | 260 | 17k|7393 |3601 | 2.000000e+00 | 2.000000e+00 | 0.00%
13.89/14.00 c
13.89/14.00 c SCIP Status : problem is solved [optimal solution found]
13.89/14.00 c Solving Time (sec) : 13.98
13.89/14.00 c Solving Nodes : 6365
13.89/14.00 c Primal Bound : +2.00000000000000e+00 (4 solutions)
13.89/14.00 c Dual Bound : +2.00000000000000e+00
13.89/14.00 c Gap : 0.00 %
13.99/14.00 s OPTIMUM FOUND
13.99/14.00 v -x162 x161 x160 -x159 x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 x108 x107 x106 x105 x104 -x103 -x150 -x149 -x148 x147 -x146
13.99/14.00 v -x145 -x102 -x101 x100 x99 x98 -x97 -x144 -x143 -x142 -x141 x140 x139 -x96 x95 -x94 -x93 x92 -x91 -x138 -x137 x136 x135 -x134
13.99/14.00 v x133 x90 -x89 x88 -x87 x86 -x85 -x132 -x131 x130 x129 -x128 -x127 x84 -x83 x82 x81 x80 -x79 -x126 -x125 -x124 x123 x122 x121
13.99/14.00 v -x78 x77 -x76 x75 x74 -x73 -x120 -x119 -x118 -x117 x116 -x115 -x72 -x71 x70 -x69 x68 -x67 -x114 -x113 -x112 -x111 -x110 -x109
13.99/14.00 v -x66 -x65 -x64 x63 x62 -x61 -x60 x59 x58 -x57 x56 x55 x54 -x53 x52 -x51 -x50 x49 -x48 -x47 x46 x45 x44 x43 -x42 -x41 -x40
13.99/14.00 v 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 -x11
13.99/14.00 v -x10 -x9 x8 x7 -x6 -x5 -x4 -x3 x2 -x1
13.99/14.00 c SCIP Status : problem is solved [optimal solution found]
13.99/14.00 c Solving Time : 13.98
13.99/14.00 c Original Problem :
13.99/14.00 c Problem name : HOME/instance-2702989-1278564375.opb
13.99/14.00 c Variables : 486 (486 binary, 0 integer, 0 implicit integer, 0 continuous)
13.99/14.00 c Constraints : 343 initial, 343 maximal
13.99/14.00 c Presolved Problem :
13.99/14.00 c Problem name : t_HOME/instance-2702989-1278564375.opb
13.99/14.00 c Variables : 477 (477 binary, 0 integer, 0 implicit integer, 0 continuous)
13.99/14.00 c Constraints : 343 initial, 7057 maximal
13.99/14.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
13.99/14.00 c trivial : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c dualfix : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c implics : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c probing : 0.02 0 0 0 0 0 0 0 0
13.99/14.00 c and : 0.02 0 0 0 0 0 0 0 0
13.99/14.00 c linear : 0.00 1 8 0 0 0 0 0 40
13.99/14.00 c logicor : 0.00 0 0 0 0 0 0 0 0
13.99/14.00 c root node : - 24 - - 24 - - - -
13.99/14.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
13.99/14.00 c integral : 0 0 0 5183 0 1 437 0 0 10004
13.99/14.00 c and : 323 11414 22294 2 0 643 34391 17802 0 0
13.99/14.00 c linear : 9+ 7 21649 2 0 1495 13474 1 0 0
13.99/14.00 c logicor : 11+ 6 10909 3 0 73 2794 0 0 0
13.99/14.00 c countsols : 0 0 0 3 0 0 0 0 0 0
13.99/14.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
13.99/14.00 c integral : 3.25 0.00 0.00 3.25 0.00
13.99/14.00 c and : 0.89 0.54 0.35 0.00 0.00
13.99/14.00 c linear : 0.55 0.00 0.55 0.00 0.00
13.99/14.00 c logicor : 0.46 0.00 0.46 0.00 0.00
13.99/14.00 c countsols : 0.00 0.00 0.00 0.00 0.00
13.99/14.00 c Propagators : Time Calls Cutoffs DomReds
13.99/14.00 c vbounds : 0.01 2 0 0
13.99/14.00 c rootredcost : 0.01 3 0 3
13.99/14.00 c pseudoobj : 0.03 21850 0 47
13.99/14.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.99/14.00 c propagation : 0.43 2211 2192 24045 39.5 450 19.9 -
13.99/14.00 c infeasible LP : 0.01 30 30 161 28.9 14 28.0 0
13.99/14.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.99/14.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.99/14.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.99/14.00 c applied globally : - - - 7391 26.1 - - -
13.99/14.00 c applied locally : - - - 2 66.5 - - -
13.99/14.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.99/14.00 c cut pool : 0.00 5 - - 7 - (maximal pool size: 87)
13.99/14.00 c redcost : 0.15 11415 0 76 0 0
13.99/14.00 c impliedbounds : 0.00 6 0 0 37 0
13.99/14.00 c intobj : 0.00 0 0 0 0 0
13.99/14.00 c cgmip : 0.00 0 0 0 0 0
13.99/14.00 c gomory : 0.03 6 0 0 14 0
13.99/14.00 c strongcg : 0.03 6 0 0 73 0
13.99/14.00 c cmir : 0.03 6 0 0 35 0
13.99/14.00 c flowcover : 0.05 6 0 0 52 0
13.99/14.00 c clique : 0.00 1 0 0 0 0
13.99/14.00 c zerohalf : 0.00 0 0 0 0 0
13.99/14.00 c mcf : 0.00 1 0 0 0 0
13.99/14.00 c rapidlearning : 0.14 1 0 0 0 13
13.99/14.00 c Pricers : Time Calls Vars
13.99/14.00 c problem variables: 0.00 0 0
13.99/14.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.99/14.00 c relpscost : 3.24 5180 1 437 0 0 10004
13.99/14.00 c pscost : 0.00 0 0 0 0 0 0
13.99/14.00 c inference : 0.00 0 0 0 0 0 0
13.99/14.00 c mostinf : 0.00 0 0 0 0 0 0
13.99/14.00 c leastinf : 0.00 0 0 0 0 0 0
13.99/14.00 c fullstrong : 0.00 0 0 0 0 0 0
13.99/14.00 c allfullstrong : 0.00 0 0 0 0 0 0
13.99/14.00 c random : 0.00 0 0 0 0 0 0
13.99/14.00 c Primal Heuristics : Time Calls Found
13.99/14.00 c LP solutions : 0.01 - 3
13.99/14.00 c pseudo solutions : 0.00 - 0
13.99/14.00 c crossover : 0.00 0 0
13.99/14.00 c intshifting : 0.00 0 0
13.99/14.00 c oneopt : 0.01 3 0
13.99/14.00 c linesearchdiving : 0.01 2 0
13.99/14.00 c guideddiving : 0.02 2 0
13.99/14.00 c coefdiving : 0.03 3 0
13.99/14.00 c pscostdiving : 0.02 3 0
13.99/14.00 c fracdiving : 0.02 3 1
13.99/14.00 c veclendiving : 0.01 3 0
13.99/14.00 c feaspump : 0.03 2 0
13.99/14.00 c objpscostdiving : 0.06 2 0
13.99/14.00 c rootsoldiving : 0.05 2 0
13.99/14.00 c trivial : 0.00 2 0
13.99/14.00 c simplerounding : 0.00 0 0
13.99/14.00 c zirounding : 0.01 1000 0
13.99/14.00 c rounding : 0.06 1487 0
13.99/14.00 c shifting : 0.47 411 0
13.99/14.00 c twoopt : 0.00 0 0
13.99/14.00 c fixandinfer : 0.00 0 0
13.99/14.00 c intdiving : 0.00 0 0
13.99/14.00 c actconsdiving : 0.00 0 0
13.99/14.00 c octane : 0.00 0 0
13.99/14.00 c rens : 0.03 1 0
13.99/14.00 c rins : 0.00 0 0
13.99/14.00 c localbranching : 0.00 0 0
13.99/14.00 c mutation : 0.00 0 0
13.99/14.00 c dins : 0.00 0 0
13.99/14.00 c undercover : 0.02 1 0
13.99/14.00 c nlp : 0.00 0 0
13.99/14.00 c trysol : 0.01 0 0
13.99/14.00 c LP : Time Calls Iterations Iter/call Iter/sec
13.99/14.00 c primal LP : 0.19 0 0 0.00 0.00
13.99/14.00 c dual LP : 4.61 11795 38795 3.29 8408.15
13.99/14.00 c lex dual LP : 0.00 0 0 0.00 -
13.99/14.00 c barrier LP : 0.00 0 0 0.00 -
13.99/14.00 c diving/probing LP: 0.17 450 1931 4.29 11426.10
13.99/14.00 c strong branching : 3.11 3601 22578 6.27 7255.18
13.99/14.00 c (at root node) : - 10 778 77.80 -
13.99/14.00 c conflict analysis: 0.00 0 0 0.00 -
13.99/14.00 c B&B Tree :
13.99/14.00 c number of runs : 1
13.99/14.00 c nodes : 6365
13.99/14.00 c nodes (total) : 6365
13.99/14.00 c nodes left : 0
13.99/14.00 c max depth : 87
13.99/14.00 c max depth (total): 87
13.99/14.00 c backtracks : 995 (15.6%)
13.99/14.00 c delayed cutoffs : 953
13.99/14.00 c repropagations : 3091 (13111 domain reductions, 827 cutoffs)
13.99/14.00 c avg switch length: 4.24
13.99/14.00 c switching time : 0.76
13.99/14.00 c Solution :
13.99/14.00 c Solutions found : 4 (4 improvements)
13.99/14.00 c First Solution : +3.30000000000000e+01 (in run 1, after 2089 nodes, 6.08 seconds, depth 69, found by <fracdiving>)
13.99/14.00 c Primal Bound : +2.00000000000000e+00 (in run 1, after 6365 nodes, 13.97 seconds, depth 81, found by <relaxation>)
13.99/14.00 c Dual Bound : +2.00000000000000e+00
13.99/14.00 c Gap : 0.00 %
13.99/14.00 c Root Dual Bound : +2.00000000000000e+00
13.99/14.00 c Root Iterations : 599
13.99/14.02 c Time complete: 14.