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-2703018-1278564396.opb>
0.00/0.01 c original problem has 360 variables (360 bin, 0 int, 0 impl, 0 cont) and 244 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) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1768 impls, 0 clqs
0.00/0.03 c (round 2) 23 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 0 upgd conss, 2507 impls, 0 clqs
0.00/0.03 c (round 3) 33 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 10 upgd conss, 3067 impls, 0 clqs
0.00/0.04 c (round 4) 43 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 55 chg coeffs, 10 upgd conss, 3547 impls, 0 clqs
0.00/0.04 c (round 5) 53 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 63 chg coeffs, 10 upgd conss, 3947 impls, 0 clqs
0.00/0.04 c (round 6) 63 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 71 chg coeffs, 10 upgd conss, 4267 impls, 0 clqs
0.00/0.04 c (round 7) 73 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 79 chg coeffs, 10 upgd conss, 4507 impls, 0 clqs
0.00/0.05 c (round 8) 83 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 87 chg coeffs, 10 upgd conss, 4667 impls, 0 clqs
0.00/0.05 c (round 9) 93 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 95 chg coeffs, 10 upgd conss, 4747 impls, 0 clqs
0.00/0.05 c (round 10) 103 del vars, 73 del conss, 0 chg bounds, 0 chg sides, 103 chg coeffs, 10 upgd conss, 4747 impls, 0 clqs
0.00/0.07 c (0.1s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.07 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.07 c presolving (11 rounds):
0.00/0.07 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.00/0.07 c 4783 implications, 0 cliques
0.00/0.07 c presolved problem has 257 variables (257 bin, 0 int, 0 impl, 0 cont) and 162 constraints
0.00/0.07 c 142 constraints of type <and>
0.00/0.07 c 9 constraints of type <linear>
0.00/0.07 c 11 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 | 20 | - |1292k| 0 | 10 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 312 | - |1322k| 0 | 36 | 257 | 162 | 257 | 316 | 13 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 331 | - |1379k| 0 | 49 | 257 | 162 | 257 | 337 | 34 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 376 | - |1463k| 0 | 58 | 257 | 162 | 257 | 357 | 54 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 416 | - |1535k| 0 | 61 | 257 | 162 | 257 | 377 | 74 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 455 | - |1587k| 0 | 76 | 257 | 162 | 257 | 394 | 91 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.38 c 0.4s| 1 | 0 | 528 | - |1647k| 0 | 84 | 257 | 162 | 257 | 413 | 110 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 2 | 528 | - |1648k| 0 | 84 | 257 | 162 | 257 | 413 | 110 | 0 | 17 | 3.000000e+00 | -- | Inf
1.79/1.88 o 3
1.79/1.88 c * 1.9s| 189 | 0 | 1967 | 7.7 |1774k| 40 | - | 257 | 253 | 257 | 173 | 453 | 91 |1073 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.79/1.88 c
1.79/1.88 c SCIP Status : problem is solved [optimal solution found]
1.79/1.88 c Solving Time (sec) : 1.87
1.79/1.88 c Solving Nodes : 189
1.79/1.88 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.79/1.88 c Dual Bound : +3.00000000000000e+00
1.79/1.88 c Gap : 0.00 %
1.79/1.88 s OPTIMUM FOUND
1.79/1.88 v x135 -x134 -x133 -x132 -x131 -x130 -x129 x128 x127 -x126 x90 x89 -x88 -x87 x86 -x125 -x124 x123 x122 x121 -x85 -x84 x83 x82 x81
1.79/1.88 v -x120 -x119 -x118 -x117 -x116 x80 -x79 x78 -x77 x76 x115 -x114 -x113 x112 x111 -x75 -x74 -x73 -x72 x71 x110 -x109 x108 x107
1.79/1.88 v -x106 x70 -x69 x68 -x67 x66 -x105 -x104 -x103 -x102 -x101 x65 x64 -x63 -x62 x61 -x100 -x99 x98 x97 x96 -x60 -x59 -x58 -x57 x56
1.79/1.88 v -x95 -x94 -x93 -x92 x91 x55 x54 -x53 -x52 x51 x50 -x49 x48 -x47 x46 x45 x44 x43 x42 x41 -x40 x39 -x38 x37 x36 x35 -x34 x33
1.79/1.88 v -x32 x31 x30 x29 x28 -x27 x26 x25 x24 x23 -x22 x21 x20 x19 -x18 -x17 x16 -x15 x14 -x13 -x12 x11 x10 -x9 -x8 x7 x6 -x5 -x4 -x3
1.79/1.88 v x2 x1
1.79/1.88 c SCIP Status : problem is solved [optimal solution found]
1.79/1.88 c Solving Time : 1.87
1.79/1.88 c Original Problem :
1.79/1.88 c Problem name : HOME/instance-2703018-1278564396.opb
1.79/1.88 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.88 c Constraints : 244 initial, 244 maximal
1.79/1.88 c Presolved Problem :
1.79/1.88 c Problem name : t_HOME/instance-2703018-1278564396.opb
1.79/1.88 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.88 c Constraints : 162 initial, 253 maximal
1.79/1.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.88 c trivial : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c probing : 0.01 0 0 0 0 0 0 0 0
1.79/1.88 c and : 0.02 18 73 0 0 0 73 0 73
1.79/1.88 c linear : 0.01 2 10 0 0 0 0 0 30
1.79/1.88 c logicor : 0.00 0 0 0 0 0 0 0 0
1.79/1.88 c root node : - 0 - - 0 - - - -
1.79/1.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.88 c integral : 0 0 0 179 0 1 49 0 0 292
1.79/1.88 c and : 142 337 976 1 0 25 689 358 0 0
1.79/1.88 c linear : 9 6 951 1 0 32 368 0 0 0
1.79/1.88 c logicor : 11+ 6 234 1 0 0 50 0 0 0
1.79/1.88 c countsols : 0 0 0 1 0 0 0 0 0 0
1.79/1.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.88 c integral : 1.20 0.00 0.00 1.20 0.00
1.79/1.88 c and : 0.01 0.01 0.01 0.00 0.00
1.79/1.88 c linear : 0.01 0.00 0.01 0.00 0.00
1.79/1.88 c logicor : 0.00 0.00 0.00 0.00 0.00
1.79/1.88 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.88 c Propagators : Time Calls Cutoffs DomReds
1.79/1.88 c vbounds : 0.00 2 0 0
1.79/1.88 c rootredcost : 0.00 0 0 0
1.79/1.88 c pseudoobj : 0.00 623 0 0
1.79/1.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.88 c propagation : 0.00 57 55 230 14.6 18 11.7 -
1.79/1.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.79/1.88 c applied globally : - - - 91 11.2 - - -
1.79/1.88 c applied locally : - - - 0 0.0 - - -
1.79/1.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.88 c cut pool : 0.00 5 - - 61 - (maximal pool size: 331)
1.79/1.88 c redcost : 0.00 337 0 0 0 0
1.79/1.88 c impliedbounds : 0.00 6 0 0 25 0
1.79/1.88 c intobj : 0.00 0 0 0 0 0
1.79/1.88 c cgmip : 0.00 0 0 0 0 0
1.79/1.88 c gomory : 0.07 6 0 0 205 0
1.79/1.88 c strongcg : 0.05 6 0 0 350 0
1.79/1.88 c cmir : 0.03 6 0 0 89 0
1.79/1.88 c flowcover : 0.05 6 0 0 178 0
1.79/1.88 c clique : 0.00 6 0 0 1 0
1.79/1.88 c zerohalf : 0.00 0 0 0 0 0
1.79/1.88 c mcf : 0.00 1 0 0 0 0
1.79/1.88 c rapidlearning : 0.04 1 0 0 0 0
1.79/1.88 c Pricers : Time Calls Vars
1.79/1.88 c problem variables: 0.00 0 0
1.79/1.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.88 c relpscost : 1.20 178 1 49 0 0 292
1.79/1.88 c pscost : 0.00 0 0 0 0 0 0
1.79/1.88 c inference : 0.00 0 0 0 0 0 0
1.79/1.88 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.88 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.88 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.88 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.88 c random : 0.00 0 0 0 0 0 0
1.79/1.88 c Primal Heuristics : Time Calls Found
1.79/1.88 c LP solutions : 0.00 - 1
1.79/1.88 c pseudo solutions : 0.00 - 0
1.79/1.88 c oneopt : 0.00 0 0
1.79/1.88 c crossover : 0.00 0 0
1.79/1.88 c pscostdiving : 0.00 0 0
1.79/1.88 c fracdiving : 0.00 0 0
1.79/1.88 c veclendiving : 0.00 0 0
1.79/1.88 c objpscostdiving : 0.00 0 0
1.79/1.88 c rootsoldiving : 0.00 0 0
1.79/1.88 c linesearchdiving : 0.00 0 0
1.79/1.88 c guideddiving : 0.00 0 0
1.79/1.88 c intshifting : 0.00 0 0
1.79/1.88 c coefdiving : 0.01 1 0
1.79/1.88 c feaspump : 0.01 1 0
1.79/1.88 c trivial : 0.00 2 0
1.79/1.88 c simplerounding : 0.00 0 0
1.79/1.88 c zirounding : 0.00 144 0
1.79/1.88 c rounding : 0.01 205 0
1.79/1.88 c shifting : 0.05 45 0
1.79/1.88 c twoopt : 0.00 0 0
1.79/1.88 c fixandinfer : 0.00 0 0
1.79/1.88 c intdiving : 0.00 0 0
1.79/1.88 c actconsdiving : 0.00 0 0
1.79/1.88 c octane : 0.00 0 0
1.79/1.88 c rens : 0.02 1 0
1.79/1.88 c rins : 0.00 0 0
1.79/1.88 c localbranching : 0.00 0 0
1.79/1.88 c mutation : 0.00 0 0
1.79/1.88 c dins : 0.00 0 0
1.79/1.88 c undercover : 0.02 1 0
1.79/1.88 c nlp : 0.00 0 0
1.79/1.88 c trysol : 0.00 0 0
1.79/1.88 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.88 c primal LP : 0.01 0 0 0.00 -
1.79/1.88 c dual LP : 0.17 341 1616 4.74 9505.99
1.79/1.88 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.88 c barrier LP : 0.00 0 0 0.00 -
1.79/1.88 c diving/probing LP: 0.02 37 351 9.49 19500.00
1.79/1.88 c strong branching : 1.20 1073 11742 10.94 9817.96
1.79/1.88 c (at root node) : - 17 1337 78.65 -
1.79/1.88 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.88 c B&B Tree :
1.79/1.88 c number of runs : 1
1.79/1.88 c nodes : 189
1.79/1.88 c nodes (total) : 189
1.79/1.88 c nodes left : 0
1.79/1.88 c max depth : 40
1.79/1.88 c max depth (total): 40
1.79/1.88 c backtracks : 21 (11.1%)
1.79/1.88 c delayed cutoffs : 12
1.79/1.88 c repropagations : 54 (225 domain reductions, 12 cutoffs)
1.79/1.88 c avg switch length: 2.60
1.79/1.88 c switching time : 0.01
1.79/1.88 c Solution :
1.79/1.88 c Solutions found : 1 (1 improvements)
1.79/1.88 c First Solution : +3.00000000000000e+00 (in run 1, after 189 nodes, 1.87 seconds, depth 34, found by <relaxation>)
1.79/1.88 c Primal Bound : +3.00000000000000e+00 (in run 1, after 189 nodes, 1.87 seconds, depth 34, found by <relaxation>)
1.79/1.88 c Dual Bound : +3.00000000000000e+00
1.79/1.88 c Gap : 0.00 %
1.79/1.88 c Root Dual Bound : +3.00000000000000e+00
1.79/1.88 c Root Iterations : 528
1.79/1.89 c Time complete: 1.88.