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-2665035-1276648072.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.01 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) 21 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1818 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 8 upgd conss, 2218 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 8 upgd conss, 2538 impls, 0 clqs
0.00/0.05 c (round 5) 51 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 56 chg coeffs, 8 upgd conss, 2778 impls, 0 clqs
0.00/0.05 c (round 6) 61 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 8 upgd conss, 2938 impls, 0 clqs
0.00/0.05 c (round 7) 71 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.00/0.06 c (round 8) 81 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 80 chg coeffs, 8 upgd conss, 3018 impls, 0 clqs
0.00/0.07 c (0.0s) probing: 155/199 (77.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, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 80 changed coefficients
0.00/0.07 c 3046 implications, 0 cliques
0.00/0.07 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 127 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 10 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 | 16 | - |1023k| 0 | 7 | 199 | 127 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 32 | - |1050k| 0 | 30 | 199 | 127 | 199 | 244 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 56 | - |1107k| 0 | 40 | 199 | 127 | 199 | 256 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 94 | - |1161k| 0 | 54 | 199 | 127 | 199 | 272 | 38 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 137 | - |1243k| 0 | 69 | 199 | 127 | 199 | 297 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 196 | - |1404k| 0 | 84 | 199 | 127 | 199 | 317 | 83 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 259 | - |1498k| 0 | 86 | 199 | 127 | 199 | 345 | 111 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.49 c 0.4s| 1 | 2 | 259 | - |1499k| 0 | 86 | 199 | 127 | 199 | 345 | 111 | 0 | 17 | 3.000000e+00 | -- | Inf
2.69/2.71 o 7
2.69/2.71 c * 2.3s| 397 | 132 | 3488 | 8.2 |1750k| 38 | - | 199 | 300 | 199 | 196 | 980 | 173 |1226 | 3.000000e+00 | 7.000000e+00 | 133.33%
3.39/3.45 o 3
3.39/3.45 c * 3.0s| 782 | 0 | 5842 | 7.1 |1837k| 38 | - | 199 | 683 | 199 | 186 |1631 | 592 |1318 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.39/3.45 c
3.39/3.45 c SCIP Status : problem is solved [optimal solution found]
3.39/3.45 c Solving Time (sec) : 3.00
3.39/3.45 c Solving Nodes : 782
3.39/3.45 c Primal Bound : +3.00000000000000e+00 (2 solutions)
3.39/3.45 c Dual Bound : +3.00000000000000e+00
3.39/3.45 c Gap : 0.00 %
3.39/3.45 s OPTIMUM FOUND
3.39/3.45 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
3.39/3.45 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
3.39/3.45 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
3.39/3.45 v x23 x22 x21 x20 -x19 -x18 x17 x16 x15 x14 x13 -x12 x11 x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
3.39/3.45 c SCIP Status : problem is solved [optimal solution found]
3.39/3.45 c Solving Time : 3.00
3.39/3.45 c Original Problem :
3.39/3.45 c Problem name : HOME/instance-2665035-1276648072.opb
3.39/3.45 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.45 c Constraints : 190 initial, 190 maximal
3.39/3.45 c Presolved Problem :
3.39/3.45 c Problem name : t_HOME/instance-2665035-1276648072.opb
3.39/3.45 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.45 c Constraints : 127 initial, 683 maximal
3.39/3.45 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.39/3.45 c trivial : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c implics : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c probing : 0.01 0 0 0 0 0 0 0 0
3.39/3.45 c and : 0.01 14 56 0 0 0 56 0 56
3.39/3.45 c linear : 0.00 3 8 0 0 0 0 0 24
3.39/3.45 c logicor : 0.00 0 0 0 0 0 0 0 0
3.39/3.45 c root node : - 13 - - 13 - - - -
3.39/3.45 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.39/3.45 c integral : 0 0 0 620 0 1 47 0 0 1166
3.39/3.45 c and : 110 1317 2974 2 0 68 2935 1551 0 0
3.39/3.45 c linear : 7 6 2906 2 0 237 1832 0 0 0
3.39/3.45 c logicor : 10+ 6 1192 2 0 12 420 0 0 0
3.39/3.45 c countsols : 0 0 0 2 0 0 0 0 0 0
3.39/3.45 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.39/3.45 c integral : 1.16 0.00 0.00 1.16 0.00
3.39/3.45 c and : 0.06 0.02 0.04 0.00 0.00
3.39/3.45 c linear : 0.07 0.00 0.07 0.00 0.00
3.39/3.45 c logicor : 0.02 0.00 0.02 0.00 0.00
3.39/3.45 c countsols : 0.00 0.00 0.00 0.00 0.00
3.39/3.45 c Propagators : Time Calls Cutoffs DomReds
3.39/3.45 c vbounds : 0.00 2 0 0
3.39/3.45 c rootredcost : 0.01 1 0 2
3.39/3.45 c pseudoobj : 0.00 2653 0 2
3.39/3.45 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.45 c propagation : 0.08 317 316 2813 28.6 54 18.9 -
3.39/3.45 c infeasible LP : 0.00 3 3 15 16.8 1 17.0 0
3.39/3.45 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.45 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.45 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.45 c applied globally : - - - 592 16.4 - - -
3.39/3.45 c applied locally : - - - 0 0.0 - - -
3.39/3.45 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.45 c cut pool : 0.00 5 - - 52 - (maximal pool size: 355)
3.39/3.45 c redcost : 0.00 1317 0 0 0 0
3.39/3.45 c impliedbounds : 0.00 6 0 0 45 0
3.39/3.45 c intobj : 0.00 0 0 0 0 0
3.39/3.45 c cgmip : 0.00 0 0 0 0 0
3.39/3.45 c gomory : 0.05 6 0 0 129 0
3.39/3.45 c strongcg : 0.06 6 0 0 445 0
3.39/3.45 c cmir : 0.02 6 0 0 77 0
3.39/3.45 c flowcover : 0.02 6 0 0 150 0
3.39/3.45 c clique : 0.00 1 0 0 0 0
3.39/3.45 c zerohalf : 0.00 0 0 0 0 0
3.39/3.45 c mcf : 0.00 1 0 0 0 0
3.39/3.45 c rapidlearning : 0.02 1 0 1 0 0
3.39/3.45 c Pricers : Time Calls Vars
3.39/3.45 c problem variables: 0.00 0 0
3.39/3.45 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.45 c relpscost : 1.16 618 1 47 0 0 1166
3.39/3.45 c pscost : 0.00 0 0 0 0 0 0
3.39/3.45 c inference : 0.00 0 0 0 0 0 0
3.39/3.45 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.45 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.45 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.45 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.45 c random : 0.00 0 0 0 0 0 0
3.39/3.45 c Primal Heuristics : Time Calls Found
3.39/3.45 c LP solutions : 0.00 - 2
3.39/3.45 c pseudo solutions : 0.00 - 0
3.39/3.45 c crossover : 0.00 0 0
3.39/3.45 c objpscostdiving : 0.00 0 0
3.39/3.45 c rootsoldiving : 0.00 0 0
3.39/3.45 c linesearchdiving : 0.00 0 0
3.39/3.45 c guideddiving : 0.00 0 0
3.39/3.45 c intshifting : 0.00 0 0
3.39/3.45 c oneopt : 0.00 1 0
3.39/3.45 c coefdiving : 0.00 1 0
3.39/3.45 c pscostdiving : 0.00 1 0
3.39/3.45 c fracdiving : 0.01 1 0
3.39/3.45 c veclendiving : 0.01 1 0
3.39/3.45 c feaspump : 0.00 1 0
3.39/3.45 c trivial : 0.01 2 0
3.39/3.45 c simplerounding : 0.01 0 0
3.39/3.45 c zirounding : 0.00 572 0
3.39/3.45 c rounding : 0.03 480 0
3.39/3.45 c shifting : 0.06 116 0
3.39/3.45 c twoopt : 0.00 0 0
3.39/3.45 c fixandinfer : 0.00 0 0
3.39/3.45 c intdiving : 0.00 0 0
3.39/3.45 c actconsdiving : 0.00 0 0
3.39/3.45 c octane : 0.00 0 0
3.39/3.45 c rens : 0.01 1 0
3.39/3.45 c rins : 0.00 0 0
3.39/3.45 c localbranching : 0.00 0 0
3.39/3.45 c mutation : 0.00 0 0
3.39/3.45 c dins : 0.00 0 0
3.39/3.45 c undercover : 0.01 1 0
3.39/3.45 c nlp : 0.01 0 0
3.39/3.45 c trysol : 0.00 0 0
3.39/3.45 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.45 c primal LP : 0.14 0 0 0.00 0.00
3.39/3.45 c dual LP : 0.97 1332 5680 4.26 5855.67
3.39/3.45 c lex dual LP : 0.00 0 0 0.00 -
3.39/3.45 c barrier LP : 0.00 0 0 0.00 -
3.39/3.45 c diving/probing LP: 0.01 50 162 3.24 16200.00
3.39/3.45 c strong branching : 1.15 1318 12761 9.68 11096.52
3.39/3.45 c (at root node) : - 17 1043 61.35 -
3.39/3.45 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.45 c B&B Tree :
3.39/3.45 c number of runs : 1
3.39/3.45 c nodes : 782
3.39/3.45 c nodes (total) : 782
3.39/3.45 c nodes left : 0
3.39/3.45 c max depth : 38
3.39/3.45 c max depth (total): 38
3.39/3.45 c backtracks : 140 (17.9%)
3.39/3.45 c delayed cutoffs : 121
3.39/3.45 c repropagations : 536 (1543 domain reductions, 116 cutoffs)
3.39/3.45 c avg switch length: 3.43
3.39/3.45 c switching time : 0.21
3.39/3.45 c Solution :
3.39/3.45 c Solutions found : 2 (2 improvements)
3.39/3.45 c First Solution : +7.00000000000000e+00 (in run 1, after 397 nodes, 2.33 seconds, depth 31, found by <relaxation>)
3.39/3.45 c Primal Bound : +3.00000000000000e+00 (in run 1, after 782 nodes, 2.99 seconds, depth 27, found by <relaxation>)
3.39/3.45 c Dual Bound : +3.00000000000000e+00
3.39/3.45 c Gap : 0.00 %
3.39/3.45 c Root Dual Bound : +3.00000000000000e+00
3.39/3.45 c Root Iterations : 259
3.39/3.46 c Time complete: 3.45.