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-2703152-1278564511.opb>
0.00/0.01 c original problem has 264 variables (264 bin, 0 int, 0 impl, 0 cont) and 199 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.02 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 876 impls, 0 clqs
0.00/0.03 c (round 2) 19 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 1324 impls, 0 clqs
0.00/0.03 c (round 3) 35 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.00/0.03 c (round 4) 51 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.04/0.04 c (0.0s) probing: 137/213 (64.3%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.04/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.04/0.04 c presolving (5 rounds):
0.04/0.04 c 51 deleted vars, 42 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 66 changed coefficients
0.04/0.04 c 1560 implications, 0 cliques
0.04/0.04 c presolved problem has 213 variables (213 bin, 0 int, 0 impl, 0 cont) and 154 constraints
0.04/0.04 c 147 constraints of type <and>
0.04/0.04 c 3 constraints of type <linear>
0.04/0.04 c 4 constraints of type <logicor>
0.04/0.04 c transformed objective value is always integral (scale: 2)
0.04/0.04 c Presolving Time: 0.03
0.04/0.04 c - non default parameters ----------------------------------------------------------------------
0.04/0.04 c # SCIP version 1.2.1.3
0.04/0.04 c
0.04/0.04 c # frequency for displaying node information lines
0.04/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.04 c display/freq = 10000
0.04/0.04 c
0.04/0.04 c # maximal time in seconds to run
0.04/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.04 c limits/time = 1790
0.04/0.04 c
0.04/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.04 c limits/memory = 1620
0.04/0.04 c
0.04/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.04/0.04 c # [type: int, range: [1,2], default: 1]
0.04/0.04 c timing/clocktype = 2
0.04/0.04 c
0.04/0.04 c # should presolving try to simplify inequalities
0.04/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.04 c constraints/linear/simplifyinequalities = TRUE
0.04/0.04 c
0.04/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.04/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.04 c constraints/indicator/addCouplingCons = TRUE
0.04/0.04 c
0.04/0.04 c # should presolving try to simplify knapsacks
0.04/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.04 c
0.04/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.04 c heuristics/undercover/freq = 0
0.04/0.04 c
0.04/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.04 c separating/rapidlearning/freq = 0
0.04/0.04 c
0.04/0.04 c -----------------------------------------------------------------------------------------------
0.04/0.04 c start solving
0.04/0.04 c
0.04/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.05 c 0.0s| 1 | 0 | 10 | - |1053k| 0 | 6 | 213 | 154 | 213 | 301 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.40/0.48 c 0.5s| 1 | 0 | 154 | - |1067k| 0 | 10 | 213 | 154 | 213 | 302 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
0.40/0.49 c 0.5s| 1 | 0 | 161 | - |1084k| 0 | 17 | 213 | 154 | 213 | 306 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 168 | - |1117k| 0 | 15 | 213 | 154 | 213 | 313 | 12 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 173 | - |1124k| 0 | 20 | 213 | 154 | 213 | 316 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.58 c 0.6s| 1 | 0 | 177 | - |1137k| 0 | 23 | 213 | 154 | 213 | 319 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.62 c 0.6s| 1 | 0 | 179 | - |1148k| 0 | 25 | 213 | 154 | 213 | 321 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 2 | 179 | - |1149k| 0 | 25 | 213 | 154 | 213 | 321 | 20 | 0 | 22 | 3.000000e+00 | -- | Inf
1.19/1.28 o 3
1.19/1.28 c * 1.3s| 124 | 0 | 1820 | 13.3 |1196k| 28 | - | 213 | 182 | 213 | 71 | 628 | 31 | 624 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.19/1.28 c
1.19/1.28 c SCIP Status : problem is solved [optimal solution found]
1.19/1.28 c Solving Time (sec) : 1.27
1.19/1.28 c Solving Nodes : 124
1.19/1.28 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.19/1.28 c Dual Bound : +3.00000000000000e+00
1.19/1.28 c Gap : 0.00 %
1.19/1.28 s OPTIMUM FOUND
1.19/1.28 v -x72 -x71 x70 -x69 x68 -x67 x66 -x65 -x64 -x63 -x62 x61 x60 x59 x58 x57 -x48 -x47 x46 x45 x44 -x43 x42 x41 -x56 -x55 -x54 -x53
1.19/1.28 v -x52 -x51 -x50 -x49 -x40 x39 x38 x37 x36 -x35 x34 x33 x32 -x31 x30 x29 x28 -x27 -x26 x25 -x24 x23 -x22 -x21 -x20 -x19 -x18 x17
1.19/1.28 v -x16 -x15 x14 -x13 x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
1.19/1.28 c SCIP Status : problem is solved [optimal solution found]
1.19/1.28 c Solving Time : 1.27
1.19/1.28 c Original Problem :
1.19/1.28 c Problem name : HOME/instance-2703152-1278564511.opb
1.19/1.28 c Variables : 264 (264 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.28 c Constraints : 199 initial, 199 maximal
1.19/1.28 c Presolved Problem :
1.19/1.28 c Problem name : t_HOME/instance-2703152-1278564511.opb
1.19/1.28 c Variables : 213 (213 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.28 c Constraints : 154 initial, 182 maximal
1.19/1.28 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.19/1.28 c trivial : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c implics : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c probing : 0.01 0 0 0 0 0 0 0 0
1.19/1.28 c and : 0.01 6 42 0 0 0 42 0 42
1.19/1.28 c linear : 0.00 1 2 0 0 0 0 0 24
1.19/1.28 c logicor : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c root node : - 0 - - 0 - - - -
1.19/1.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.19/1.28 c integral : 0 0 0 123 0 0 16 0 0 220
1.19/1.28 c and : 147 247 692 1 0 2 479 612 0 0
1.19/1.28 c linear : 3 6 690 1 0 16 160 0 0 0
1.19/1.28 c logicor : 4+ 6 129 1 0 0 13 0 0 0
1.19/1.28 c countsols : 0 0 0 1 0 0 0 0 0 0
1.19/1.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.19/1.28 c integral : 0.50 0.00 0.00 0.50 0.00
1.19/1.28 c and : 0.01 0.01 0.01 0.00 0.00
1.19/1.28 c linear : 0.01 0.00 0.01 0.00 0.00
1.19/1.28 c logicor : 0.00 0.00 0.00 0.00 0.00
1.19/1.28 c countsols : 0.00 0.00 0.00 0.00 0.00
1.19/1.28 c Propagators : Time Calls Cutoffs DomReds
1.19/1.28 c vbounds : 0.00 2 0 0
1.19/1.28 c rootredcost : 0.00 0 0 0
1.19/1.28 c pseudoobj : 0.00 415 0 0
1.19/1.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.28 c propagation : 0.00 18 18 116 40.0 3 16.0 -
1.19/1.28 c infeasible LP : 0.00 1 1 2 8.0 0 0.0 0
1.19/1.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.28 c applied globally : - - - 28 14.2 - - -
1.19/1.28 c applied locally : - - - 3 33.3 - - -
1.19/1.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.19/1.28 c cut pool : 0.00 5 - - 3 - (maximal pool size: 44)
1.19/1.28 c redcost : 0.01 247 0 0 0 0
1.19/1.28 c impliedbounds : 0.00 6 0 0 4 0
1.19/1.28 c intobj : 0.00 0 0 0 0 0
1.19/1.28 c cgmip : 0.00 0 0 0 0 0
1.19/1.28 c gomory : 0.03 6 0 0 0 0
1.19/1.28 c strongcg : 0.02 6 0 0 28 0
1.19/1.28 c cmir : 0.01 6 0 0 22 0
1.19/1.28 c flowcover : 0.06 6 0 0 27 0
1.19/1.28 c clique : 0.00 1 0 0 0 0
1.19/1.28 c zerohalf : 0.00 0 0 0 0 0
1.19/1.28 c mcf : 0.00 1 0 0 0 0
1.19/1.28 c rapidlearning : 0.03 1 0 0 0 0
1.19/1.28 c Pricers : Time Calls Vars
1.19/1.28 c problem variables: 0.00 0 0
1.19/1.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.19/1.28 c relpscost : 0.50 122 0 16 0 0 220
1.19/1.28 c pscost : 0.00 0 0 0 0 0 0
1.19/1.28 c inference : 0.00 0 0 0 0 0 0
1.19/1.28 c mostinf : 0.00 0 0 0 0 0 0
1.19/1.28 c leastinf : 0.00 0 0 0 0 0 0
1.19/1.28 c fullstrong : 0.00 0 0 0 0 0 0
1.19/1.28 c allfullstrong : 0.00 0 0 0 0 0 0
1.19/1.28 c random : 0.00 0 0 0 0 0 0
1.19/1.28 c Primal Heuristics : Time Calls Found
1.19/1.28 c LP solutions : 0.00 - 1
1.19/1.28 c pseudo solutions : 0.00 - 0
1.19/1.28 c oneopt : 0.00 0 0
1.19/1.28 c crossover : 0.00 0 0
1.19/1.28 c rootsoldiving : 0.00 0 0
1.19/1.28 c linesearchdiving : 0.00 0 0
1.19/1.28 c guideddiving : 0.00 0 0
1.19/1.28 c intshifting : 0.00 0 0
1.19/1.28 c coefdiving : 0.00 1 0
1.19/1.28 c pscostdiving : 0.01 1 0
1.19/1.28 c fracdiving : 0.00 1 0
1.19/1.28 c veclendiving : 0.00 1 0
1.19/1.28 c feaspump : 0.01 1 0
1.19/1.28 c objpscostdiving : 0.01 1 0
1.19/1.28 c trivial : 0.00 2 0
1.19/1.28 c simplerounding : 0.00 0 0
1.19/1.28 c zirounding : 0.00 110 0
1.19/1.28 c rounding : 0.01 190 0
1.19/1.28 c shifting : 0.02 21 0
1.19/1.28 c twoopt : 0.00 0 0
1.19/1.28 c fixandinfer : 0.00 0 0
1.19/1.28 c intdiving : 0.00 0 0
1.19/1.28 c actconsdiving : 0.00 0 0
1.19/1.28 c octane : 0.00 0 0
1.19/1.28 c rens : 0.01 1 0
1.19/1.28 c rins : 0.00 0 0
1.19/1.28 c localbranching : 0.00 0 0
1.19/1.28 c mutation : 0.00 0 0
1.19/1.28 c dins : 0.00 0 0
1.19/1.28 c undercover : 0.38 1 0
1.19/1.28 c nlp : 0.00 0 0
1.19/1.28 c trysol : 0.00 0 0
1.19/1.28 c LP : Time Calls Iterations Iter/call Iter/sec
1.19/1.28 c primal LP : 0.00 0 0 0.00 -
1.19/1.28 c dual LP : 0.06 263 1339 5.09 21597.12
1.19/1.28 c lex dual LP : 0.00 0 0 0.00 -
1.19/1.28 c barrier LP : 0.00 0 0 0.00 -
1.19/1.28 c diving/probing LP: 0.03 82 481 5.87 18500.00
1.19/1.28 c strong branching : 0.49 624 7264 11.64 14734.52
1.19/1.28 c (at root node) : - 22 468 21.27 -
1.19/1.28 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.28 c B&B Tree :
1.19/1.28 c number of runs : 1
1.19/1.28 c nodes : 124
1.19/1.28 c nodes (total) : 124
1.19/1.28 c nodes left : 0
1.19/1.28 c max depth : 28
1.19/1.28 c max depth (total): 28
1.19/1.28 c backtracks : 9 (7.3%)
1.19/1.28 c delayed cutoffs : 3
1.19/1.28 c repropagations : 15 (79 domain reductions, 0 cutoffs)
1.19/1.28 c avg switch length: 2.10
1.19/1.28 c switching time : 0.01
1.19/1.28 c Solution :
1.19/1.28 c Solutions found : 1 (1 improvements)
1.19/1.28 c First Solution : +3.00000000000000e+00 (in run 1, after 124 nodes, 1.27 seconds, depth 26, found by <relaxation>)
1.19/1.28 c Primal Bound : +3.00000000000000e+00 (in run 1, after 124 nodes, 1.27 seconds, depth 26, found by <relaxation>)
1.19/1.28 c Dual Bound : +3.00000000000000e+00
1.19/1.28 c Gap : 0.00 %
1.19/1.28 c Root Dual Bound : +3.00000000000000e+00
1.19/1.28 c Root Iterations : 179
1.19/1.29 c Time complete: 1.29.