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-2702943-1278564317.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.03 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.03 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.03 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.04 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.04 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.04 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.03/0.04 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.03/0.05 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.03/0.05 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.03/0.05 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.03/0.06 c (0.1s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.03/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.03/0.06 c presolving (11 rounds):
0.03/0.06 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.03/0.06 c 4819 implications, 0 cliques
0.03/0.06 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 162 constraints
0.03/0.06 c 142 constraints of type <and>
0.03/0.06 c 9 constraints of type <linear>
0.03/0.06 c 11 constraints of type <logicor>
0.03/0.06 c transformed objective value is always integral (scale: 2)
0.03/0.06 c Presolving Time: 0.05
0.03/0.06 c - non default parameters ----------------------------------------------------------------------
0.03/0.06 c # SCIP version 1.2.1.3
0.03/0.06 c
0.03/0.06 c # frequency for displaying node information lines
0.03/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.06 c display/freq = 10000
0.03/0.06 c
0.03/0.06 c # maximal time in seconds to run
0.03/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.06 c limits/time = 1790
0.03/0.06 c
0.03/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.07 c limits/memory = 1620
0.03/0.07 c
0.03/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.07 c # [type: int, range: [1,2], default: 1]
0.03/0.07 c timing/clocktype = 2
0.03/0.07 c
0.03/0.07 c # should presolving try to simplify inequalities
0.03/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.07 c constraints/linear/simplifyinequalities = TRUE
0.03/0.07 c
0.03/0.07 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.07 c constraints/indicator/addCouplingCons = TRUE
0.03/0.07 c
0.03/0.07 c # should presolving try to simplify knapsacks
0.03/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.07 c
0.03/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.07 c heuristics/undercover/freq = 0
0.03/0.07 c
0.03/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.07 c separating/rapidlearning/freq = 0
0.03/0.07 c
0.03/0.07 c -----------------------------------------------------------------------------------------------
0.03/0.07 c start solving
0.03/0.07 c
0.03/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.03/0.07 c 0.1s| 1 | 0 | 22 | - |1292k| 0 | 11 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 o 17
0.19/0.21 c y 0.2s| 1 | 0 | 295 | - |1366k| 0 | 11 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.22 c 0.2s| 1 | 0 | 316 | - |1724k| 0 | 38 | 257 | 378 | 257 | 320 | 17 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.25 c 0.2s| 1 | 0 | 339 | - |1801k| 0 | 53 | 257 | 373 | 257 | 333 | 40 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.29 c 0.3s| 1 | 0 | 382 | - |1913k| 0 | 71 | 257 | 373 | 257 | 358 | 65 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.29/0.35 c 0.3s| 1 | 0 | 423 | - |1977k| 0 | 64 | 257 | 373 | 257 | 381 | 88 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.39/0.43 c 0.4s| 1 | 0 | 480 | - |2028k| 0 | 79 | 257 | 373 | 257 | 398 | 105 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.49/0.51 c 0.5s| 1 | 0 | 515 | - |2057k| 0 | 82 | 257 | 373 | 257 | 416 | 123 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.49/0.59 c 0.6s| 1 | 2 | 515 | - |2057k| 0 | 82 | 257 | 373 | 257 | 416 | 123 | 0 | 10 | 3.000000e+00 | 1.700000e+01 | 466.67%
3.09/3.16 o 7
3.09/3.16 c * 3.1s| 634 | 230 | 4862 | 6.9 |2493k| 54 | - | 257 | 717 | 257 | 176 |1191 | 344 |1670 | 3.000000e+00 | 7.000000e+00 | 133.33%
3.09/3.17 o 3
3.09/3.17 c * 3.2s| 643 | 0 | 4892 | 6.8 |2285k| 54 | - | 257 | 666 | 257 | 172 |1201 | 351 |1671 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.09/3.17 c
3.09/3.17 c SCIP Status : problem is solved [optimal solution found]
3.09/3.17 c Solving Time (sec) : 3.16
3.09/3.17 c Solving Nodes : 643
3.09/3.17 c Primal Bound : +3.00000000000000e+00 (3 solutions)
3.09/3.17 c Dual Bound : +3.00000000000000e+00
3.09/3.17 c Gap : 0.00 %
3.09/3.17 s OPTIMUM FOUND
3.09/3.17 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
3.09/3.17 v x81 -x120 -x119 x118 x117 -x116 -x80 -x79 -x78 x77 x76 -x115 -x114 -x113 -x112 -x111 -x75 x74 x73 x72 x71 -x110 -x109 -x108
3.09/3.17 v x107 -x106 -x70 -x69 -x68 -x67 x66 -x105 -x104 -x103 -x102 x101 -x65 x64 x63 -x62 x61 -x100 -x99 -x98 x97 -x96 -x60 -x59 x58
3.09/3.17 v -x57 x56 -x95 -x94 -x93 x92 -x91 x55 -x54 x53 x52 x51 -x50 -x49 x48 -x47 x46 -x45 x44 x43 x42 x41 -x40 x39 -x38 x37 x36 -x35
3.09/3.17 v x34 x33 -x32 x31 -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
3.09/3.17 v -x5 -x4 -x3 x2 x1
3.09/3.17 c SCIP Status : problem is solved [optimal solution found]
3.09/3.17 c Solving Time : 3.16
3.09/3.17 c Original Problem :
3.09/3.17 c Problem name : HOME/instance-2702943-1278564317.opb
3.09/3.17 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.17 c Constraints : 244 initial, 244 maximal
3.09/3.17 c Presolved Problem :
3.09/3.17 c Problem name : t_HOME/instance-2702943-1278564317.opb
3.09/3.17 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.17 c Constraints : 162 initial, 717 maximal
3.09/3.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.09/3.17 c trivial : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c implics : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c probing : 0.01 0 0 0 0 0 0 0 0
3.09/3.17 c and : 0.01 18 73 0 0 0 73 0 73
3.09/3.17 c linear : 0.01 2 10 0 0 0 0 0 30
3.09/3.17 c logicor : 0.00 0 0 0 0 0 0 0 0
3.09/3.17 c root node : - 12 - - 12 - - - -
3.09/3.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.09/3.17 c integral : 0 0 0 575 0 1 136 0 0 958
3.09/3.17 c and : 142 1094 2537 0 0 61 2015 1103 0 0
3.09/3.17 c linear : 9+ 7 2476 0 0 141 1385 11 0 0
3.09/3.17 c logicor : 11+ 6 949 2 0 16 244 0 0 0
3.09/3.17 c countsols : 0 0 0 2 0 0 0 0 0 0
3.09/3.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.09/3.17 c integral : 1.69 0.00 0.00 1.69 0.00
3.09/3.17 c and : 0.03 0.02 0.01 0.00 0.00
3.09/3.17 c linear : 0.06 0.00 0.06 0.00 0.00
3.09/3.17 c logicor : 0.01 0.00 0.01 0.00 0.00
3.09/3.17 c countsols : 0.00 0.00 0.00 0.00 0.00
3.09/3.17 c Propagators : Time Calls Cutoffs DomReds
3.09/3.17 c vbounds : 0.00 2 0 0
3.09/3.17 c rootredcost : 0.00 1 0 1
3.09/3.17 c pseudoobj : 0.00 2187 0 1
3.09/3.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.09/3.17 c propagation : 0.01 218 218 1259 23.8 37 13.6 -
3.09/3.17 c infeasible LP : 0.00 1 1 13 36.8 0 0.0 0
3.09/3.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.17 c applied globally : - - - 351 14.0 - - -
3.09/3.17 c applied locally : - - - 0 0.0 - - -
3.09/3.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.09/3.17 c cut pool : 0.00 5 - - 75 - (maximal pool size: 303)
3.09/3.17 c redcost : 0.01 1097 0 2 0 0
3.09/3.17 c impliedbounds : 0.00 6 0 0 37 0
3.09/3.17 c intobj : 0.00 0 0 0 0 0
3.09/3.17 c cgmip : 0.00 0 0 0 0 0
3.09/3.17 c gomory : 0.09 6 0 0 151 0
3.09/3.17 c strongcg : 0.07 6 0 0 355 0
3.09/3.17 c cmir : 0.03 6 0 0 83 0
3.09/3.17 c flowcover : 0.06 6 0 0 165 0
3.09/3.17 c clique : 0.00 6 0 0 1 0
3.09/3.17 c zerohalf : 0.00 0 0 0 0 0
3.09/3.17 c mcf : 0.00 1 0 0 0 0
3.09/3.17 c rapidlearning : 0.11 1 0 0 0 216
3.09/3.17 c Pricers : Time Calls Vars
3.09/3.17 c problem variables: 0.00 0 0
3.09/3.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.09/3.17 c relpscost : 1.69 573 1 136 0 0 958
3.09/3.17 c pscost : 0.00 0 0 0 0 0 0
3.09/3.17 c inference : 0.00 0 0 0 0 0 0
3.09/3.17 c mostinf : 0.00 0 0 0 0 0 0
3.09/3.17 c leastinf : 0.00 0 0 0 0 0 0
3.09/3.17 c fullstrong : 0.00 0 0 0 0 0 0
3.09/3.17 c allfullstrong : 0.00 0 0 0 0 0 0
3.09/3.17 c random : 0.00 0 0 0 0 0 0
3.09/3.17 c Primal Heuristics : Time Calls Found
3.09/3.17 c LP solutions : 0.00 - 2
3.09/3.17 c pseudo solutions : 0.00 - 0
3.09/3.17 c crossover : 0.00 0 0
3.09/3.17 c objpscostdiving : 0.00 0 0
3.09/3.17 c rootsoldiving : 0.00 0 0
3.09/3.17 c linesearchdiving : 0.00 0 0
3.09/3.17 c guideddiving : 0.00 0 0
3.09/3.17 c intshifting : 0.00 0 0
3.09/3.17 c oneopt : 0.00 2 0
3.09/3.17 c coefdiving : 0.01 1 0
3.09/3.17 c pscostdiving : 0.02 1 0
3.09/3.17 c fracdiving : 0.01 1 0
3.09/3.17 c veclendiving : 0.00 1 0
3.09/3.17 c feaspump : 0.01 1 0
3.09/3.17 c trivial : 0.00 2 0
3.09/3.17 c simplerounding : 0.00 0 0
3.09/3.17 c zirounding : 0.01 474 0
3.09/3.17 c rounding : 0.02 415 0
3.09/3.17 c shifting : 0.12 102 0
3.09/3.17 c twoopt : 0.00 0 0
3.09/3.17 c fixandinfer : 0.00 0 0
3.09/3.17 c intdiving : 0.00 0 0
3.09/3.17 c actconsdiving : 0.00 0 0
3.09/3.17 c octane : 0.00 0 0
3.09/3.17 c rens : 0.02 1 0
3.09/3.17 c rins : 0.00 0 0
3.09/3.17 c localbranching : 0.00 0 0
3.09/3.17 c mutation : 0.00 0 0
3.09/3.17 c dins : 0.00 0 0
3.09/3.17 c undercover : 0.02 1 0
3.09/3.17 c nlp : 0.00 0 0
3.09/3.17 c trysol : 0.00 0 0
3.09/3.17 c LP : Time Calls Iterations Iter/call Iter/sec
3.09/3.17 c primal LP : 0.02 0 0 0.00 0.00
3.09/3.17 c dual LP : 0.46 1117 4441 3.98 9675.42
3.09/3.17 c lex dual LP : 0.00 0 0 0.00 -
3.09/3.17 c barrier LP : 0.00 0 0 0.00 -
3.09/3.17 c diving/probing LP: 0.03 96 451 4.70 13666.67
3.09/3.17 c strong branching : 1.67 1671 16781 10.04 10066.65
3.09/3.17 c (at root node) : - 10 386 38.60 -
3.09/3.17 c conflict analysis: 0.00 0 0 0.00 -
3.09/3.17 c B&B Tree :
3.09/3.17 c number of runs : 1
3.09/3.17 c nodes : 643
3.09/3.17 c nodes (total) : 643
3.09/3.17 c nodes left : 0
3.09/3.17 c max depth : 54
3.09/3.17 c max depth (total): 54
3.09/3.17 c backtracks : 91 (14.2%)
3.09/3.17 c delayed cutoffs : 60
3.09/3.17 c repropagations : 432 (702 domain reductions, 49 cutoffs)
3.09/3.17 c avg switch length: 4.57
3.09/3.17 c switching time : 0.09
3.09/3.17 c Solution :
3.09/3.17 c Solutions found : 3 (3 improvements)
3.09/3.17 c First Solution : +1.70000000000000e+01 (in run 1, after 1 nodes, 0.20 seconds, depth 0, found by <trysol>)
3.09/3.17 c Primal Bound : +3.00000000000000e+00 (in run 1, after 643 nodes, 3.16 seconds, depth 50, found by <relaxation>)
3.09/3.17 c Dual Bound : +3.00000000000000e+00
3.09/3.17 c Gap : 0.00 %
3.09/3.17 c Root Dual Bound : +3.00000000000000e+00
3.09/3.17 c Root Iterations : 515
3.09/3.18 c Time complete: 3.17.