0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664987-1276647205.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 190 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) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.04 c (round 2) 20 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1799 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 8 upgd conss, 2199 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 8 upgd conss, 2519 impls, 0 clqs
0.00/0.05 c (round 5) 51 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 8 upgd conss, 2759 impls, 0 clqs
0.00/0.05 c (round 6) 61 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 8 upgd conss, 2919 impls, 0 clqs
0.00/0.05 c (round 7) 71 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.06 c (round 8) 81 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 151/199 (75.9%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.00/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (9 rounds):
0.00/0.07 c 81 deleted vars, 57 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 81 changed coefficients
0.00/0.07 c 3027 implications, 0 cliques
0.00/0.07 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 126 constraints
0.00/0.07 c 110 constraints of type <and>
0.00/0.07 c 7 constraints of type <linear>
0.00/0.07 c 9 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 2)
0.00/0.07 c Presolving Time: 0.03
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 1620
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c heuristics/undercover/freq = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.00/0.08 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.08 c 0.0s| 1 | 0 | 17 | - |1021k| 0 | 9 | 199 | 126 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 32 | - |1052k| 0 | 25 | 199 | 126 | 199 | 245 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 55 | - |1080k| 0 | 42 | 199 | 126 | 199 | 259 | 24 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 98 | - |1151k| 0 | 53 | 199 | 126 | 199 | 275 | 40 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 160 | - |1253k| 0 | 75 | 199 | 126 | 199 | 298 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 225 | - |1326k| 0 | 88 | 199 | 126 | 199 | 323 | 88 | 0 | 0 | 3.000000e+00 | -- | Inf
0.28/0.33 c 0.2s| 1 | 0 | 300 | - |1392k| 0 | 86 | 199 | 126 | 199 | 350 | 115 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.46 c 0.4s| 1 | 2 | 300 | - |1393k| 0 | 86 | 199 | 126 | 199 | 350 | 115 | 0 | 16 | 3.000000e+00 | -- | Inf
2.59/2.63 o 3
2.59/2.63 c * 2.2s| 401 | 0 | 3805 | 8.8 |1593k| 47 | - | 199 | 318 | 199 | 201 | 830 | 192 |1399 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.59/2.63 c
2.59/2.63 c SCIP Status : problem is solved [optimal solution found]
2.59/2.63 c Solving Time (sec) : 2.25
2.59/2.63 c Solving Nodes : 401
2.59/2.63 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.59/2.63 c Dual Bound : +3.00000000000000e+00
2.59/2.63 c Gap : 0.00 %
2.59/2.63 s OPTIMUM FOUND
2.59/2.63 v -x105 x104 -x103 -x102 x101 -x100 -x99 -x98 x97 -x96 -x70 x69 x68 -x67 x66 x95 x94 -x93 -x92 -x91 -x65 -x64 x63 x62 x61 -x90 -x89
2.59/2.63 v -x88 -x87 -x86 x60 x59 -x58 -x57 x56 -x85 -x84 -x83 -x82 -x81 -x55 -x54 x53 -x52 x51 x80 x79 x78 x77 -x76 -x50 -x49 -x48 -x47
2.59/2.63 v x46 -x75 -x74 -x73 -x72 x71 x45 x44 x43 x42 x41 x40 -x39 x38 x37 x36 -x35 x34 -x33 x32 x31 x30 x29 x28 x27 x26 -x25 -x24
2.59/2.63 v x23 -x22 x21 -x20 -x19 x18 -x17 x16 x15 x14 x13 x12 x11 x10 -x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1
2.59/2.63 c SCIP Status : problem is solved [optimal solution found]
2.59/2.63 c Solving Time : 2.25
2.59/2.63 c Original Problem :
2.59/2.63 c Problem name : HOME/instance-2664987-1276647205.opb
2.59/2.63 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.63 c Constraints : 190 initial, 190 maximal
2.59/2.63 c Presolved Problem :
2.59/2.63 c Problem name : t_HOME/instance-2664987-1276647205.opb
2.59/2.63 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.63 c Constraints : 126 initial, 318 maximal
2.59/2.63 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.59/2.63 c trivial : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c implics : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c probing : 0.01 0 0 0 0 0 0 0 0
2.59/2.63 c and : 0.01 14 57 0 0 0 57 0 57
2.59/2.63 c linear : 0.01 2 8 0 0 0 0 0 24
2.59/2.63 c logicor : 0.00 0 0 0 0 0 0 0 0
2.59/2.63 c root node : - 0 - - 0 - - - -
2.59/2.63 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.59/2.63 c integral : 0 0 0 357 0 3 85 0 0 602
2.59/2.63 c and : 110 676 1486 1 0 39 1118 748 0 0
2.59/2.63 c linear : 7 6 1447 1 0 71 720 0 0 0
2.59/2.63 c logicor : 9+ 6 504 1 0 4 117 0 0 0
2.59/2.63 c countsols : 0 0 0 1 0 0 0 0 0 0
2.59/2.63 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.59/2.63 c integral : 1.37 0.00 0.00 1.37 0.00
2.59/2.63 c and : 0.04 0.02 0.02 0.00 0.00
2.59/2.63 c linear : 0.00 0.00 0.00 0.00 0.00
2.59/2.63 c logicor : 0.00 0.00 0.00 0.00 0.00
2.59/2.63 c countsols : 0.00 0.00 0.00 0.00 0.00
2.59/2.63 c Propagators : Time Calls Cutoffs DomReds
2.59/2.63 c vbounds : 0.00 2 0 0
2.59/2.63 c rootredcost : 0.00 0 0 0
2.59/2.63 c pseudoobj : 0.00 1173 0 0
2.59/2.63 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.59/2.63 c propagation : 0.01 114 111 601 17.6 16 8.6 -
2.59/2.63 c infeasible LP : 0.00 7 7 37 15.0 1 10.0 0
2.59/2.63 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.63 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.63 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.59/2.63 c applied globally : - - - 192 11.8 - - -
2.59/2.63 c applied locally : - - - 0 0.0 - - -
2.59/2.63 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.59/2.63 c cut pool : 0.00 5 - - 52 - (maximal pool size: 330)
2.59/2.63 c redcost : 0.00 676 0 0 0 0
2.59/2.63 c impliedbounds : 0.00 6 0 0 37 0
2.59/2.63 c intobj : 0.00 0 0 0 0 0
2.59/2.63 c cgmip : 0.00 0 0 0 0 0
2.59/2.63 c gomory : 0.05 6 0 0 169 0
2.59/2.63 c strongcg : 0.03 6 0 0 391 0
2.59/2.63 c cmir : 0.02 6 0 0 90 0
2.59/2.63 c flowcover : 0.04 6 0 0 156 0
2.59/2.63 c clique : 0.00 6 0 0 1 0
2.59/2.63 c zerohalf : 0.00 0 0 0 0 0
2.59/2.63 c mcf : 0.00 1 0 0 0 0
2.59/2.63 c rapidlearning : 0.02 1 0 0 0 0
2.59/2.63 c Pricers : Time Calls Vars
2.59/2.63 c problem variables: 0.00 0 0
2.59/2.63 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.59/2.63 c relpscost : 1.37 356 3 85 0 0 602
2.59/2.63 c pscost : 0.00 0 0 0 0 0 0
2.59/2.63 c inference : 0.00 0 0 0 0 0 0
2.59/2.63 c mostinf : 0.00 0 0 0 0 0 0
2.59/2.63 c leastinf : 0.00 0 0 0 0 0 0
2.59/2.63 c fullstrong : 0.00 0 0 0 0 0 0
2.59/2.63 c allfullstrong : 0.00 0 0 0 0 0 0
2.59/2.63 c random : 0.00 0 0 0 0 0 0
2.59/2.63 c Primal Heuristics : Time Calls Found
2.59/2.63 c LP solutions : 0.00 - 1
2.59/2.63 c pseudo solutions : 0.00 - 0
2.59/2.63 c oneopt : 0.00 0 0
2.59/2.63 c crossover : 0.01 0 0
2.59/2.63 c pscostdiving : 0.00 0 0
2.59/2.63 c fracdiving : 0.00 0 0
2.59/2.63 c veclendiving : 0.00 0 0
2.59/2.63 c objpscostdiving : 0.00 0 0
2.59/2.63 c rootsoldiving : 0.00 0 0
2.59/2.63 c linesearchdiving : 0.00 0 0
2.59/2.63 c guideddiving : 0.00 0 0
2.59/2.63 c intshifting : 0.00 0 0
2.59/2.63 c coefdiving : 0.01 1 0
2.59/2.63 c feaspump : 0.00 1 0
2.59/2.63 c trivial : 0.00 2 0
2.59/2.63 c simplerounding : 0.00 0 0
2.59/2.63 c zirounding : 0.02 298 0
2.59/2.63 c rounding : 0.01 323 0
2.59/2.63 c shifting : 0.04 68 0
2.59/2.63 c twoopt : 0.00 0 0
2.59/2.63 c fixandinfer : 0.00 0 0
2.59/2.63 c intdiving : 0.00 0 0
2.59/2.63 c actconsdiving : 0.00 0 0
2.59/2.63 c octane : 0.00 0 0
2.59/2.63 c rens : 0.01 1 0
2.59/2.63 c rins : 0.00 0 0
2.59/2.63 c localbranching : 0.00 0 0
2.59/2.63 c mutation : 0.00 0 0
2.59/2.63 c dins : 0.00 0 0
2.59/2.63 c undercover : 0.01 1 0
2.59/2.63 c nlp : 0.00 0 0
2.59/2.63 c trysol : 0.00 0 0
2.59/2.63 c LP : Time Calls Iterations Iter/call Iter/sec
2.59/2.63 c primal LP : 0.02 0 0 0.00 0.00
2.59/2.63 c dual LP : 0.46 693 3788 5.47 8234.78
2.59/2.63 c lex dual LP : 0.00 0 0 0.00 -
2.59/2.63 c barrier LP : 0.00 0 0 0.00 -
2.59/2.63 c diving/probing LP: 0.01 5 17 3.40 1700.00
2.59/2.63 c strong branching : 1.37 1399 13358 9.55 9750.36
2.59/2.63 c (at root node) : - 16 1084 67.75 -
2.59/2.63 c conflict analysis: 0.00 0 0 0.00 -
2.59/2.63 c B&B Tree :
2.59/2.63 c number of runs : 1
2.59/2.63 c nodes : 401
2.59/2.63 c nodes (total) : 401
2.59/2.63 c nodes left : 0
2.59/2.63 c max depth : 47
2.59/2.63 c max depth (total): 47
2.59/2.63 c backtracks : 45 (11.2%)
2.59/2.63 c delayed cutoffs : 29
2.59/2.63 c repropagations : 162 (374 domain reductions, 22 cutoffs)
2.59/2.63 c avg switch length: 3.38
2.59/2.63 c switching time : 0.05
2.59/2.63 c Solution :
2.59/2.63 c Solutions found : 1 (1 improvements)
2.59/2.63 c First Solution : +3.00000000000000e+00 (in run 1, after 401 nodes, 2.25 seconds, depth 39, found by <relaxation>)
2.59/2.63 c Primal Bound : +3.00000000000000e+00 (in run 1, after 401 nodes, 2.25 seconds, depth 39, found by <relaxation>)
2.59/2.63 c Dual Bound : +3.00000000000000e+00
2.59/2.63 c Gap : 0.00 %
2.59/2.63 c Root Dual Bound : +3.00000000000000e+00
2.59/2.63 c Root Iterations : 300
2.59/2.64 c Time complete: 2.63.