0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
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-2666435-1276647566.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 136 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) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 784 impls, 0 clqs
0.00/0.03 c (round 2) 18 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 1151 impls, 0 clqs
0.00/0.03 c (round 3) 29 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 6 upgd conss, 1391 impls, 0 clqs
0.00/0.04 c (round 4) 39 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 43 chg coeffs, 6 upgd conss, 1551 impls, 0 clqs
0.00/0.04 c (round 5) 49 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.00/0.04 c (round 6) 59 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 59 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.04/0.06 c presolving (7 rounds):
0.04/0.06 c 59 deleted vars, 41 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 59 changed coefficients
0.04/0.06 c 1661 implications, 0 cliques
0.04/0.06 c presolved problem has 141 variables (141 bin, 0 int, 0 impl, 0 cont) and 90 constraints
0.04/0.06 c 78 constraints of type <and>
0.04/0.06 c 5 constraints of type <linear>
0.04/0.06 c 7 constraints of type <logicor>
0.04/0.06 c transformed objective value is always integral (scale: 2)
0.04/0.06 c Presolving Time: 0.03
0.04/0.06 c - non default parameters ----------------------------------------------------------------------
0.04/0.06 c # SCIP version 1.2.1.2
0.04/0.06 c
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = 10000
0.04/0.06 c
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = 1800
0.04/0.06 c
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = 1620
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.04/0.06 c
0.04/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c heuristics/undercover/freq = 0
0.04/0.06 c
0.04/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/rapidlearning/freq = 0
0.04/0.06 c
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving
0.04/0.06 c
0.04/0.06 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.06 c 0.0s| 1 | 0 | 14 | - | 764k| 0 | 7 | 141 | 90 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 172 | - | 788k| 0 | 26 | 141 | 90 | 141 | 177 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.1s| 1 | 0 | 190 | - | 827k| 0 | 29 | 141 | 90 | 141 | 190 | 23 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 217 | - | 878k| 0 | 35 | 141 | 90 | 141 | 206 | 39 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 250 | - | 912k| 0 | 47 | 141 | 90 | 141 | 223 | 56 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 314 | - | 941k| 0 | 49 | 141 | 90 | 141 | 240 | 73 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.29 c 0.2s| 1 | 0 | 365 | - | 974k| 0 | 47 | 141 | 90 | 141 | 255 | 88 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 2 | 365 | - | 974k| 0 | 47 | 141 | 90 | 141 | 255 | 88 | 0 | 9 | 3.000000e+00 | -- | Inf
1.29/1.37 o 3
1.29/1.37 c * 1.2s| 196 | 0 | 2430 | 10.6 |1061k| 29 | - | 141 | 229 | 141 | 124 | 403 | 139 | 674 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.29/1.37 c
1.29/1.37 c SCIP Status : problem is solved [optimal solution found]
1.29/1.37 c Solving Time (sec) : 1.24
1.29/1.37 c Solving Nodes : 196
1.29/1.37 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.29/1.37 c Dual Bound : +3.00000000000000e+00
1.29/1.37 c Gap : 0.00 %
1.29/1.37 s OPTIMUM FOUND
1.29/1.37 v -x75 x74 x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x50 x49 x48 x47 x46 -x65 x64 -x63 x62 x61 -x45 -x44 x43 -x42 x41 -x60 x59 x58 -x57
1.29/1.37 v -x56 x40 -x39 x38 -x37 x36 -x55 -x54 -x53 -x52 -x51 -x35 x34 x33 x32 x31 x30 x29 x28 -x27 x26 -x25 -x24 -x23 x22 x21 x20
1.29/1.37 v -x19 -x18 -x17 x16 x15 x14 -x13 x12 x11 -x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
1.29/1.37 c SCIP Status : problem is solved [optimal solution found]
1.29/1.37 c Solving Time : 1.24
1.29/1.37 c Original Problem :
1.29/1.37 c Problem name : HOME/instance-2666435-1276647566.opb
1.29/1.37 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37 c Constraints : 136 initial, 136 maximal
1.29/1.37 c Presolved Problem :
1.29/1.37 c Problem name : t_HOME/instance-2666435-1276647566.opb
1.29/1.37 c Variables : 141 (141 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37 c Constraints : 90 initial, 229 maximal
1.29/1.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.37 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c probing : 0.01 0 0 0 0 0 0 0 0
1.29/1.37 c and : 0.01 10 41 0 0 0 41 0 41
1.29/1.37 c linear : 0.00 2 6 0 0 0 0 0 18
1.29/1.37 c logicor : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c root node : - 0 - - 0 - - - -
1.29/1.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.37 c integral : 0 0 0 178 0 0 22 0 0 322
1.29/1.37 c and : 78 318 949 0 0 24 438 344 0 0
1.29/1.37 c linear : 5 6 924 0 0 28 370 0 0 0
1.29/1.37 c logicor : 7+ 6 275 1 0 6 46 0 0 0
1.29/1.37 c countsols : 0 0 0 1 0 0 0 0 0 0
1.29/1.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.37 c integral : 0.75 0.00 0.00 0.75 0.00
1.29/1.37 c and : 0.02 0.01 0.01 0.00 0.00
1.29/1.37 c linear : 0.01 0.00 0.01 0.00 0.00
1.29/1.37 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.37 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.37 c Propagators : Time Calls Cutoffs DomReds
1.29/1.37 c vbounds : 0.00 2 0 0
1.29/1.37 c rootredcost : 0.00 0 0 0
1.29/1.37 c pseudoobj : 0.00 653 0 0
1.29/1.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.37 c propagation : 0.01 58 58 453 21.6 18 8.9 -
1.29/1.37 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.37 c applied globally : - - - 139 14.2 - - -
1.29/1.37 c applied locally : - - - 0 0.0 - - -
1.29/1.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.37 c cut pool : 0.00 5 - - 54 - (maximal pool size: 176)
1.29/1.37 c redcost : 0.00 319 0 0 0 0
1.29/1.37 c impliedbounds : 0.00 6 0 0 38 0
1.29/1.37 c intobj : 0.00 0 0 0 0 0
1.29/1.37 c cgmip : 0.00 0 0 0 0 0
1.29/1.37 c gomory : 0.06 6 0 0 58 0
1.29/1.37 c strongcg : 0.00 6 0 0 175 0
1.29/1.37 c cmir : 0.04 6 0 0 65 0
1.29/1.37 c flowcover : 0.02 6 0 0 124 0
1.29/1.37 c clique : 0.00 6 0 0 0 0
1.29/1.37 c zerohalf : 0.00 0 0 0 0 0
1.29/1.37 c mcf : 0.00 1 0 0 0 0
1.29/1.37 c rapidlearning : 0.05 1 0 0 0 0
1.29/1.37 c Pricers : Time Calls Vars
1.29/1.37 c problem variables: 0.00 0 0
1.29/1.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.37 c relpscost : 0.75 177 0 22 0 0 322
1.29/1.37 c pscost : 0.00 0 0 0 0 0 0
1.29/1.37 c inference : 0.00 0 0 0 0 0 0
1.29/1.37 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.37 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.37 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c random : 0.00 0 0 0 0 0 0
1.29/1.37 c Primal Heuristics : Time Calls Found
1.29/1.37 c LP solutions : 0.00 - 1
1.29/1.37 c pseudo solutions : 0.00 - 0
1.29/1.37 c oneopt : 0.00 0 0
1.29/1.37 c crossover : 0.00 0 0
1.29/1.37 c rootsoldiving : 0.00 0 0
1.29/1.37 c linesearchdiving : 0.00 0 0
1.29/1.37 c guideddiving : 0.00 0 0
1.29/1.37 c intshifting : 0.00 0 0
1.29/1.37 c coefdiving : 0.00 1 0
1.29/1.37 c pscostdiving : 0.00 1 0
1.29/1.37 c fracdiving : 0.00 1 0
1.29/1.37 c veclendiving : 0.00 1 0
1.29/1.37 c feaspump : 0.00 1 0
1.29/1.37 c objpscostdiving : 0.00 1 0
1.29/1.37 c trivial : 0.01 2 0
1.29/1.37 c simplerounding : 0.00 0 0
1.29/1.37 c zirounding : 0.00 157 0
1.29/1.37 c rounding : 0.00 213 0
1.29/1.37 c shifting : 0.05 31 0
1.29/1.37 c twoopt : 0.00 0 0
1.29/1.37 c fixandinfer : 0.00 0 0
1.29/1.37 c intdiving : 0.00 0 0
1.29/1.37 c actconsdiving : 0.00 0 0
1.29/1.37 c octane : 0.00 0 0
1.29/1.37 c rens : 0.00 1 0
1.29/1.37 c rins : 0.00 0 0
1.29/1.37 c localbranching : 0.00 0 0
1.29/1.37 c mutation : 0.00 0 0
1.29/1.37 c dins : 0.00 0 0
1.29/1.37 c undercover : 0.01 1 0
1.29/1.37 c nlp : 0.00 0 0
1.29/1.37 c trysol : 0.00 0 0
1.29/1.37 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.37 c primal LP : 0.00 0 0 0.00 -
1.29/1.37 c dual LP : 0.16 319 2081 6.52 13006.25
1.29/1.37 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.37 c barrier LP : 0.00 0 0 0.00 -
1.29/1.37 c diving/probing LP: 0.00 78 349 4.47 -
1.29/1.37 c strong branching : 0.75 674 10729 15.92 14305.33
1.29/1.37 c (at root node) : - 9 1125 125.00 -
1.29/1.37 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.37 c B&B Tree :
1.29/1.37 c number of runs : 1
1.29/1.37 c nodes : 196
1.29/1.37 c nodes (total) : 196
1.29/1.37 c nodes left : 0
1.29/1.37 c max depth : 29
1.29/1.37 c max depth (total): 29
1.29/1.37 c backtracks : 26 (13.3%)
1.29/1.37 c delayed cutoffs : 26
1.29/1.37 c repropagations : 97 (178 domain reductions, 13 cutoffs)
1.29/1.37 c avg switch length: 3.56
1.29/1.37 c switching time : 0.00
1.29/1.37 c Solution :
1.29/1.37 c Solutions found : 1 (1 improvements)
1.29/1.37 c First Solution : +3.00000000000000e+00 (in run 1, after 196 nodes, 1.24 seconds, depth 28, found by <relaxation>)
1.29/1.37 c Primal Bound : +3.00000000000000e+00 (in run 1, after 196 nodes, 1.24 seconds, depth 28, found by <relaxation>)
1.29/1.37 c Dual Bound : +3.00000000000000e+00
1.29/1.37 c Gap : 0.00 %
1.29/1.37 c Root Dual Bound : +3.00000000000000e+00
1.29/1.37 c Root Iterations : 365
1.29/1.38 c Time complete: 1.38.