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-2702984-1278564371.opb>
0.00/0.01 c original problem has 216 variables (216 bin, 0 int, 0 impl, 0 cont) and 167 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) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 688 impls, 0 clqs
0.00/0.02 c (round 2) 20 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.00/0.03 c (round 3) 38 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 53 chg coeffs, 3 upgd conss, 976 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 128/178 (71.9%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (4 rounds):
0.00/0.04 c 38 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 53 changed coefficients
0.00/0.04 c 984 implications, 0 cliques
0.00/0.04 c presolved problem has 178 variables (178 bin, 0 int, 0 impl, 0 cont) and 133 constraints
0.00/0.04 c 128 constraints of type <and>
0.00/0.04 c 2 constraints of type <linear>
0.00/0.04 c 3 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1790
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 8 | - | 898k| 0 | 5 | 178 | 133 | 178 | 261 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 228 | - | 909k| 0 | 10 | 178 | 133 | 178 | 262 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 233 | - | 943k| 0 | 11 | 178 | 133 | 178 | 268 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.50 c 0.5s| 1 | 0 | 235 | - | 945k| 0 | 11 | 178 | 133 | 178 | 270 | 9 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 244 | - | 952k| 0 | 14 | 178 | 133 | 178 | 274 | 13 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 255 | - | 971k| 0 | 17 | 178 | 133 | 178 | 279 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 261 | - | 996k| 0 | 22 | 178 | 133 | 178 | 283 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 2 | 261 | - | 996k| 0 | 22 | 178 | 133 | 178 | 283 | 22 | 0 | 22 | 3.000000e+00 | -- | Inf
3.09/3.13 o 3
3.09/3.13 c * 3.1s| 1833 | 0 | 15133 | 8.1 |1297k| 35 | - | 178 | 578 | 178 | 104 |4642 | 448 |1289 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.09/3.13 c
3.09/3.13 c SCIP Status : problem is solved [optimal solution found]
3.09/3.13 c Solving Time (sec) : 3.12
3.09/3.13 c Solving Nodes : 1833
3.09/3.13 c Primal Bound : +3.00000000000000e+00 (1 solutions)
3.09/3.13 c Dual Bound : +3.00000000000000e+00
3.09/3.13 c Gap : 0.00 %
3.09/3.13 s OPTIMUM FOUND
3.09/3.13 v -x54 x53 x52 -x51 x50 x49 x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 x31 x30 x29 x28 x27
3.09/3.13 v 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.09/3.13 c SCIP Status : problem is solved [optimal solution found]
3.09/3.13 c Solving Time : 3.12
3.09/3.13 c Original Problem :
3.09/3.13 c Problem name : HOME/instance-2702984-1278564371.opb
3.09/3.13 c Variables : 216 (216 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.13 c Constraints : 167 initial, 167 maximal
3.09/3.13 c Presolved Problem :
3.09/3.13 c Problem name : t_HOME/instance-2702984-1278564371.opb
3.09/3.13 c Variables : 178 (178 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.13 c Constraints : 133 initial, 578 maximal
3.09/3.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.09/3.13 c trivial : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c implics : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c probing : 0.01 0 0 0 0 0 0 0 0
3.09/3.13 c and : 0.01 4 32 0 0 0 32 0 32
3.09/3.13 c linear : 0.00 1 1 0 0 0 0 0 21
3.09/3.13 c logicor : 0.00 0 0 0 0 0 0 0 0
3.09/3.13 c root node : - 0 - - 0 - - - -
3.09/3.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.09/3.13 c integral : 0 0 0 1307 0 0 39 0 0 2548
3.09/3.13 c and : 128 3024 5106 0 0 83 7642 4626 0 0
3.09/3.13 c linear : 2 6 5022 0 0 660 3201 0 0 0
3.09/3.13 c logicor : 3+ 6 1542 0 0 2 320 0 0 0
3.09/3.13 c countsols : 0 0 0 1 0 0 0 0 0 0
3.09/3.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.09/3.13 c integral : 0.74 0.00 0.00 0.74 0.00
3.09/3.13 c and : 0.08 0.04 0.04 0.00 0.00
3.09/3.13 c linear : 0.13 0.00 0.13 0.00 0.00
3.09/3.13 c logicor : 0.02 0.00 0.02 0.00 0.00
3.09/3.13 c countsols : 0.00 0.00 0.00 0.00 0.00
3.09/3.13 c Propagators : Time Calls Cutoffs DomReds
3.09/3.13 c vbounds : 0.01 2 0 0
3.09/3.13 c rootredcost : 0.00 0 0 0
3.09/3.13 c pseudoobj : 0.00 4849 0 0
3.09/3.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.09/3.13 c propagation : 0.05 332 329 3517 42.7 34 54.3 -
3.09/3.14 c infeasible LP : 0.00 17 16 131 39.1 3 47.0 0
3.09/3.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.14 c applied globally : - - - 445 16.0 - - -
3.09/3.14 c applied locally : - - - 3 68.0 - - -
3.09/3.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.09/3.14 c cut pool : 0.00 5 - - 0 - (maximal pool size: 33)
3.09/3.14 c redcost : 0.02 3026 0 1 0 0
3.09/3.14 c impliedbounds : 0.00 6 0 0 4 0
3.09/3.14 c intobj : 0.00 0 0 0 0 0
3.09/3.14 c cgmip : 0.00 0 0 0 0 0
3.09/3.14 c gomory : 0.02 6 0 0 3 0
3.09/3.14 c strongcg : 0.01 6 0 0 4 0
3.09/3.14 c cmir : 0.01 6 0 0 15 0
3.09/3.14 c flowcover : 0.10 6 0 0 20 0
3.09/3.14 c clique : 0.00 1 0 0 0 0
3.09/3.14 c zerohalf : 0.00 0 0 0 0 0
3.09/3.14 c mcf : 0.00 1 0 0 0 0
3.09/3.14 c rapidlearning : 0.03 1 0 0 0 0
3.09/3.14 c Pricers : Time Calls Vars
3.09/3.14 c problem variables: 0.00 0 0
3.09/3.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.09/3.14 c relpscost : 0.74 1306 0 39 0 0 2548
3.09/3.14 c pscost : 0.00 0 0 0 0 0 0
3.09/3.14 c inference : 0.00 0 0 0 0 0 0
3.09/3.14 c mostinf : 0.00 0 0 0 0 0 0
3.09/3.14 c leastinf : 0.00 0 0 0 0 0 0
3.09/3.14 c fullstrong : 0.00 0 0 0 0 0 0
3.09/3.14 c allfullstrong : 0.00 0 0 0 0 0 0
3.09/3.14 c random : 0.00 0 0 0 0 0 0
3.09/3.14 c Primal Heuristics : Time Calls Found
3.09/3.14 c LP solutions : 0.00 - 1
3.09/3.14 c pseudo solutions : 0.00 - 0
3.09/3.14 c oneopt : 0.00 0 0
3.09/3.14 c crossover : 0.00 0 0
3.09/3.14 c guideddiving : 0.00 0 0
3.09/3.14 c intshifting : 0.00 0 0
3.09/3.14 c coefdiving : 0.01 4 0
3.09/3.14 c fracdiving : 0.01 4 0
3.09/3.14 c pscostdiving : 0.01 4 0
3.09/3.14 c veclendiving : 0.02 4 0
3.09/3.14 c linesearchdiving : 0.01 4 0
3.09/3.14 c feaspump : 0.02 3 0
3.09/3.14 c objpscostdiving : 0.01 3 0
3.09/3.14 c rootsoldiving : 0.05 3 0
3.09/3.14 c trivial : 0.00 2 0
3.09/3.14 c simplerounding : 0.00 0 0
3.09/3.14 c zirounding : 0.01 1000 0
3.09/3.14 c rounding : 0.02 741 0
3.09/3.14 c shifting : 0.20 178 0
3.09/3.14 c twoopt : 0.00 0 0
3.09/3.14 c fixandinfer : 0.00 0 0
3.09/3.14 c intdiving : 0.00 0 0
3.09/3.14 c actconsdiving : 0.00 0 0
3.09/3.14 c octane : 0.00 0 0
3.09/3.14 c rens : 0.01 1 0
3.09/3.14 c rins : 0.00 0 0
3.09/3.14 c localbranching : 0.00 0 0
3.09/3.14 c mutation : 0.00 0 0
3.09/3.14 c dins : 0.00 0 0
3.09/3.14 c undercover : 0.35 1 0
3.09/3.14 c nlp : 0.00 0 0
3.09/3.14 c trysol : 0.00 0 0
3.09/3.14 c LP : Time Calls Iterations Iter/call Iter/sec
3.09/3.14 c primal LP : 0.04 0 0 0.00 0.00
3.09/3.14 c dual LP : 0.79 3131 13275 4.24 16740.29
3.09/3.14 c lex dual LP : 0.00 0 0 0.00 -
3.09/3.14 c barrier LP : 0.00 0 0 0.00 -
3.09/3.14 c diving/probing LP: 0.10 323 1858 5.75 17865.56
3.09/3.14 c strong branching : 0.73 1289 11056 8.58 15042.28
3.09/3.14 c (at root node) : - 22 860 39.09 -
3.09/3.14 c conflict analysis: 0.00 0 0 0.00 -
3.09/3.14 c B&B Tree :
3.09/3.14 c number of runs : 1
3.09/3.14 c nodes : 1833
3.09/3.14 c nodes (total) : 1833
3.09/3.14 c nodes left : 0
3.09/3.14 c max depth : 35
3.09/3.14 c max depth (total): 35
3.09/3.14 c backtracks : 342 (18.7%)
3.09/3.14 c delayed cutoffs : 158
3.09/3.14 c repropagations : 374 (1606 domain reductions, 146 cutoffs)
3.09/3.14 c avg switch length: 3.84
3.09/3.14 c switching time : 0.13
3.09/3.14 c Solution :
3.09/3.14 c Solutions found : 1 (1 improvements)
3.09/3.14 c First Solution : +3.00000000000000e+00 (in run 1, after 1833 nodes, 3.12 seconds, depth 32, found by <relaxation>)
3.09/3.14 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1833 nodes, 3.12 seconds, depth 32, found by <relaxation>)
3.09/3.14 c Dual Bound : +3.00000000000000e+00
3.09/3.14 c Gap : 0.00 %
3.09/3.14 c Root Dual Bound : +3.00000000000000e+00
3.09/3.14 c Root Iterations : 261
3.09/3.15 c Time complete: 3.14.