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-2703054-1278564429.opb>
0.00/0.01 c original problem has 440 variables (440 bin, 0 int, 0 impl, 0 cont) and 331 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.04 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 0 upgd conss, 1640 impls, 0 clqs
0.00/0.04 c (round 2) 21 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 50 chg coeffs, 6 upgd conss, 2536 impls, 0 clqs
0.00/0.04 c (round 3) 37 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 6 upgd conss, 3208 impls, 0 clqs
0.00/0.04 c (round 4) 53 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 78 chg coeffs, 6 upgd conss, 3656 impls, 0 clqs
0.00/0.05 c (round 5) 69 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 6 upgd conss, 3880 impls, 0 clqs
0.00/0.05 c (round 6) 85 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 106 chg coeffs, 6 upgd conss, 3880 impls, 0 clqs
0.00/0.06 c (0.1s) probing: 165/355 (46.5%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.00/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (7 rounds):
0.00/0.07 c 85 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 106 changed coefficients
0.00/0.07 c 3900 implications, 0 cliques
0.00/0.07 c presolved problem has 355 variables (355 bin, 0 int, 0 impl, 0 cont) and 256 constraints
0.00/0.07 c 245 constraints of type <and>
0.00/0.07 c 5 constraints of type <linear>
0.00/0.07 c 6 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.05
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.3
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 = 1789.99
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/indicator/addCouplingCons = 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.07 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.07 c 0.1s| 1 | 0 | 14 | - |1688k| 0 | 8 | 355 | 256 | 355 | 501 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 222 | - |1717k| 0 | 12 | 355 | 256 | 355 | 503 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 233 | - |1739k| 0 | 21 | 355 | 256 | 355 | 508 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 248 | - |1758k| 0 | 26 | 355 | 256 | 355 | 515 | 14 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 261 | - |1792k| 0 | 36 | 355 | 256 | 355 | 521 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 281 | - |1806k| 0 | 43 | 355 | 256 | 355 | 531 | 30 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.89 c 0.9s| 1 | 0 | 304 | - |1816k| 0 | 52 | 355 | 256 | 355 | 542 | 41 | 0 | 0 | 3.000000e+00 | -- | Inf
1.10/1.15 c 1.1s| 1 | 2 | 304 | - |1817k| 0 | 52 | 355 | 256 | 355 | 542 | 41 | 0 | 20 | 3.000000e+00 | -- | Inf
3.69/3.71 o 3
3.69/3.71 c * 3.7s| 611 | 0 | 4755 | 7.3 |2018k| 69 | - | 355 | 450 | 355 | 170 |1580 | 197 |1895 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.69/3.71 c
3.69/3.71 c SCIP Status : problem is solved [optimal solution found]
3.69/3.71 c Solving Time (sec) : 3.70
3.69/3.71 c Solving Nodes : 611
3.69/3.71 c Primal Bound : +3.00000000000000e+00 (1 solutions)
3.69/3.71 c Dual Bound : +3.00000000000000e+00
3.69/3.71 c Gap : 0.00 %
3.69/3.71 s OPTIMUM FOUND
3.69/3.71 v -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 x109 -x108 x107 x106 -x105 -x80 -x79 x78 x77 x76 x75 -x74 x73
3.69/3.71 v -x104 -x103 x102 -x101 x100 -x99 -x98 x97 -x72 x71 x70 -x69 -x68 -x67 x66 x65 -x96 x95 -x94 -x93 x92 -x91 -x90 x89 -x64 x63 -x62
3.69/3.71 v -x61 -x60 -x59 -x58 x57 -x88 -x87 -x86 -x85 -x84 -x83 x82 -x81 x56 -x55 -x54 -x53 -x52 x51 -x50 x49 -x48 -x47 -x46 -x45 -x44
3.69/3.71 v -x43 x42 x41 x40 x39 -x38 x37 x36 x35 x34 x33 x32 -x31 x30 -x29 -x28 -x27 x26 x25 x24 -x23 -x22 -x21 x20 x19 -x18 x17 x16
3.69/3.71 v x15 -x14 x13 -x12 x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
3.69/3.71 c SCIP Status : problem is solved [optimal solution found]
3.69/3.71 c Solving Time : 3.70
3.69/3.71 c Original Problem :
3.69/3.71 c Problem name : HOME/instance-2703054-1278564429.opb
3.69/3.71 c Variables : 440 (440 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.71 c Constraints : 331 initial, 331 maximal
3.69/3.71 c Presolved Problem :
3.69/3.71 c Problem name : t_HOME/instance-2703054-1278564429.opb
3.69/3.71 c Variables : 355 (355 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.71 c Constraints : 256 initial, 450 maximal
3.69/3.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.69/3.71 c trivial : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c implics : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c probing : 0.01 0 0 0 0 0 0 0 0
3.69/3.71 c and : 0.02 10 70 0 0 0 70 0 70
3.69/3.71 c linear : 0.01 1 4 0 0 0 0 0 36
3.69/3.71 c logicor : 0.00 0 0 0 0 0 0 0 0
3.69/3.71 c root node : - 0 - - 0 - - - -
3.69/3.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.69/3.71 c integral : 0 0 0 539 0 7 66 0 0 970
3.69/3.71 c and : 245 1165 2287 0 0 33 3182 1558 0 0
3.69/3.71 c linear : 5 6 2253 0 0 123 1139 0 0 0
3.69/3.71 c logicor : 6+ 6 541 0 0 11 169 0 0 0
3.69/3.71 c countsols : 0 0 0 1 0 0 0 0 0 0
3.69/3.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.69/3.71 c integral : 1.86 0.00 0.00 1.86 0.00
3.69/3.71 c and : 0.07 0.04 0.03 0.00 0.00
3.69/3.71 c linear : 0.06 0.00 0.06 0.00 0.00
3.69/3.71 c logicor : 0.00 0.00 0.00 0.00 0.00
3.69/3.71 c countsols : 0.00 0.00 0.00 0.00 0.00
3.69/3.71 c Propagators : Time Calls Cutoffs DomReds
3.69/3.71 c vbounds : 0.00 2 0 0
3.69/3.71 c rootredcost : 0.00 0 0 0
3.69/3.71 c pseudoobj : 0.00 1951 0 0
3.69/3.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.69/3.71 c propagation : 0.03 167 165 1752 46.1 4 11.8 -
3.69/3.71 c infeasible LP : 0.00 4 2 22 43.1 0 0.0 0
3.69/3.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.71 c applied globally : - - - 194 21.4 - - -
3.69/3.71 c applied locally : - - - 3 40.3 - - -
3.69/3.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.69/3.71 c cut pool : 0.00 5 - - 6 - (maximal pool size: 61)
3.69/3.71 c redcost : 0.02 1166 0 0 0 0
3.69/3.71 c impliedbounds : 0.00 6 0 0 20 0
3.69/3.71 c intobj : 0.00 0 0 0 0 0
3.69/3.71 c cgmip : 0.00 0 0 0 0 0
3.69/3.71 c gomory : 0.05 6 0 0 14 0
3.69/3.71 c strongcg : 0.04 6 0 0 42 0
3.69/3.71 c cmir : 0.03 6 0 0 34 0
3.69/3.71 c flowcover : 0.11 6 0 0 55 0
3.69/3.71 c clique : 0.00 1 0 0 0 0
3.69/3.71 c zerohalf : 0.00 0 0 0 0 0
3.69/3.71 c mcf : 0.00 1 0 0 0 0
3.69/3.71 c rapidlearning : 0.05 1 0 0 0 0
3.69/3.71 c Pricers : Time Calls Vars
3.69/3.71 c problem variables: 0.00 0 0
3.69/3.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.69/3.71 c relpscost : 1.86 538 7 66 0 0 970
3.69/3.71 c pscost : 0.00 0 0 0 0 0 0
3.69/3.71 c inference : 0.00 0 0 0 0 0 0
3.69/3.71 c mostinf : 0.00 0 0 0 0 0 0
3.69/3.71 c leastinf : 0.00 0 0 0 0 0 0
3.69/3.71 c fullstrong : 0.00 0 0 0 0 0 0
3.69/3.71 c allfullstrong : 0.00 0 0 0 0 0 0
3.69/3.71 c random : 0.00 0 0 0 0 0 0
3.69/3.71 c Primal Heuristics : Time Calls Found
3.69/3.71 c LP solutions : 0.00 - 1
3.69/3.71 c pseudo solutions : 0.00 - 0
3.69/3.71 c oneopt : 0.00 0 0
3.69/3.71 c crossover : 0.00 0 0
3.69/3.71 c guideddiving : 0.00 0 0
3.69/3.71 c intshifting : 0.00 0 0
3.69/3.71 c pscostdiving : 0.01 1 0
3.69/3.71 c fracdiving : 0.00 1 0
3.69/3.71 c veclendiving : 0.01 1 0
3.69/3.71 c linesearchdiving : 0.00 1 0
3.69/3.71 c feaspump : 0.01 1 0
3.69/3.71 c objpscostdiving : 0.02 1 0
3.69/3.71 c rootsoldiving : 0.01 1 0
3.69/3.71 c coefdiving : 0.02 2 0
3.69/3.71 c trivial : 0.00 2 0
3.69/3.71 c simplerounding : 0.00 0 0
3.69/3.71 c zirounding : 0.01 486 0
3.69/3.71 c rounding : 0.01 420 0
3.69/3.71 c shifting : 0.16 116 0
3.69/3.71 c twoopt : 0.00 0 0
3.69/3.71 c fixandinfer : 0.00 0 0
3.69/3.71 c intdiving : 0.00 0 0
3.69/3.71 c actconsdiving : 0.00 0 0
3.69/3.71 c octane : 0.00 0 0
3.69/3.71 c rens : 0.02 1 0
3.69/3.71 c rins : 0.00 0 0
3.69/3.71 c localbranching : 0.00 0 0
3.69/3.71 c mutation : 0.00 0 0
3.69/3.71 c dins : 0.00 0 0
3.69/3.71 c undercover : 0.50 1 0
3.69/3.71 c nlp : 0.00 0 0
3.69/3.71 c trysol : 0.00 0 0
3.69/3.71 c LP : Time Calls Iterations Iter/call Iter/sec
3.69/3.71 c primal LP : 0.01 0 0 0.00 0.00
3.69/3.71 c dual LP : 0.39 1204 4014 3.33 10187.77
3.69/3.71 c lex dual LP : 0.00 0 0 0.00 -
3.69/3.71 c barrier LP : 0.00 0 0 0.00 -
3.69/3.71 c diving/probing LP: 0.05 157 741 4.72 15765.96
3.69/3.71 c strong branching : 1.85 1895 20654 10.90 11164.13
3.69/3.71 c (at root node) : - 20 1650 82.50 -
3.69/3.71 c conflict analysis: 0.00 0 0 0.00 -
3.69/3.71 c B&B Tree :
3.69/3.71 c number of runs : 1
3.69/3.71 c nodes : 611
3.69/3.71 c nodes (total) : 611
3.69/3.71 c nodes left : 0
3.69/3.71 c max depth : 69
3.69/3.71 c max depth (total): 69
3.69/3.71 c backtracks : 70 (11.5%)
3.69/3.71 c delayed cutoffs : 45
3.69/3.71 c repropagations : 190 (589 domain reductions, 42 cutoffs)
3.69/3.71 c avg switch length: 3.21
3.69/3.71 c switching time : 0.03
3.69/3.71 c Solution :
3.69/3.71 c Solutions found : 1 (1 improvements)
3.69/3.71 c First Solution : +3.00000000000000e+00 (in run 1, after 611 nodes, 3.70 seconds, depth 69, found by <relaxation>)
3.69/3.71 c Primal Bound : +3.00000000000000e+00 (in run 1, after 611 nodes, 3.70 seconds, depth 69, found by <relaxation>)
3.69/3.71 c Dual Bound : +3.00000000000000e+00
3.69/3.71 c Gap : 0.00 %
3.69/3.71 c Root Dual Bound : +3.00000000000000e+00
3.69/3.71 c Root Iterations : 304
3.69/3.72 c Time complete: 3.72.