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-2703015-1278564393.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, 1840 impls, 0 clqs
0.00/0.03 c (round 2) 22 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 0 upgd conss, 2543 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, 3103 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, 3583 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, 3983 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, 4303 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, 4543 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, 4703 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, 4783 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, 4783 impls, 0 clqs
0.00/0.06 c (0.1s) probing: 169/257 (65.8%) - 0 fixings, 0 aggregations, 18 implications, 0 bound changes
0.00/0.06 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (11 rounds):
0.00/0.06 c 103 deleted vars, 73 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 103 changed coefficients
0.00/0.06 c 4819 implications, 0 cliques
0.00/0.06 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 = 1790
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 | 8 | 257 | 162 | 257 | 303 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 282 | - |1315k| 0 | 32 | 257 | 162 | 257 | 313 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 303 | - |1360k| 0 | 46 | 257 | 162 | 257 | 335 | 32 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 332 | - |1444k| 0 | 58 | 257 | 162 | 257 | 357 | 54 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 374 | - |1515k| 0 | 65 | 257 | 162 | 257 | 378 | 75 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 413 | - |1582k| 0 | 72 | 257 | 162 | 257 | 397 | 94 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.36 c 0.3s| 1 | 0 | 463 | - |1682k| 0 | 83 | 257 | 162 | 257 | 415 | 112 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.48 c 0.5s| 1 | 2 | 463 | - |1682k| 0 | 83 | 257 | 162 | 257 | 415 | 112 | 0 | 16 | 3.000000e+00 | -- | Inf
2.20/2.29 o 15
2.20/2.29 c * 2.3s| 357 | 112 | 3634 | 8.9 |1952k| 47 | - | 257 | 346 | 257 | 219 |1168 | 184 |1303 | 3.000000e+00 | 1.500000e+01 | 400.00%
3.08/3.17 o 3
3.08/3.17 c * 3.2s| 763 | 0 | 7000 | 8.6 |1959k| 47 | - | 257 | 519 | 257 | 182 |1959 | 380 |1592 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.08/3.17 c
3.08/3.17 c SCIP Status : problem is solved [optimal solution found]
3.08/3.17 c Solving Time (sec) : 3.16
3.08/3.17 c Solving Nodes : 763
3.08/3.17 c Primal Bound : +3.00000000000000e+00 (2 solutions)
3.08/3.17 c Dual Bound : +3.00000000000000e+00
3.08/3.17 c Gap : 0.00 %
3.08/3.17 s OPTIMUM FOUND
3.08/3.17 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 x120
3.08/3.17 v x119 -x118 x117 -x116 -x80 -x79 x78 -x77 x76 x115 -x114 x113 -x112 -x111 x75 x74 -x73 x72 x71 x110 -x109 -x108 -x107 x106
3.08/3.17 v 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 -x95 -x94
3.08/3.17 v -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 x32 x31 x30 x29
3.08/3.17 v 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 x2 x1
3.08/3.17 c SCIP Status : problem is solved [optimal solution found]
3.08/3.17 c Solving Time : 3.16
3.08/3.17 c Original Problem :
3.08/3.17 c Problem name : HOME/instance-2703015-1278564393.opb
3.08/3.17 c Variables : 360 (360 binary, 0 integer, 0 implicit integer, 0 continuous)
3.08/3.17 c Constraints : 244 initial, 244 maximal
3.08/3.17 c Presolved Problem :
3.08/3.17 c Problem name : t_HOME/instance-2703015-1278564393.opb
3.08/3.17 c Variables : 257 (257 binary, 0 integer, 0 implicit integer, 0 continuous)
3.08/3.17 c Constraints : 162 initial, 519 maximal
3.08/3.17 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.08/3.17 c trivial : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c implics : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c probing : 0.01 0 0 0 0 0 0 0 0
3.08/3.17 c and : 0.01 18 73 0 0 0 73 0 73
3.08/3.17 c linear : 0.01 2 10 0 0 0 0 0 30
3.08/3.17 c logicor : 0.00 0 0 0 0 0 0 0 0
3.08/3.17 c root node : - 6 - - 6 - - - -
3.08/3.17 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.08/3.17 c integral : 0 0 0 653 0 0 80 0 0 1210
3.08/3.17 c and : 142 1415 3086 1 0 44 2943 1864 0 0
3.08/3.17 c linear : 9 6 3042 1 0 174 1488 0 0 0
3.08/3.17 c logicor : 11+ 6 1310 2 0 17 400 0 0 0
3.08/3.17 c countsols : 0 0 0 2 0 0 0 0 0 0
3.08/3.17 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.08/3.17 c integral : 1.60 0.00 0.00 1.60 0.00
3.08/3.17 c and : 0.06 0.04 0.02 0.00 0.00
3.08/3.17 c linear : 0.05 0.00 0.05 0.00 0.00
3.08/3.17 c logicor : 0.01 0.00 0.01 0.00 0.00
3.08/3.17 c countsols : 0.00 0.00 0.00 0.00 0.00
3.08/3.17 c Propagators : Time Calls Cutoffs DomReds
3.08/3.17 c vbounds : 0.00 2 0 0
3.08/3.17 c rootredcost : 0.00 1 0 1
3.08/3.17 c pseudoobj : 0.00 2735 0 24
3.08/3.17 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.08/3.17 c propagation : 0.02 235 235 1154 18.5 33 12.1 -
3.08/3.17 c infeasible LP : 0.00 4 4 25 15.6 1 11.0 0
3.08/3.17 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.08/3.17 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.08/3.17 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.08/3.17 c applied globally : - - - 380 11.9 - - -
3.08/3.17 c applied locally : - - - 0 0.0 - - -
3.08/3.17 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.08/3.17 c cut pool : 0.00 5 - - 48 - (maximal pool size: 329)
3.08/3.17 c redcost : 0.01 1416 0 1 0 0
3.08/3.17 c impliedbounds : 0.00 6 0 0 32 0
3.08/3.17 c intobj : 0.00 0 0 0 0 0
3.08/3.17 c cgmip : 0.00 0 0 0 0 0
3.08/3.17 c gomory : 0.07 6 0 0 174 0
3.08/3.17 c strongcg : 0.05 6 0 0 379 0
3.08/3.17 c cmir : 0.03 6 0 0 85 0
3.08/3.17 c flowcover : 0.05 6 0 0 163 0
3.08/3.17 c clique : 0.00 6 0 0 1 0
3.08/3.17 c zerohalf : 0.00 0 0 0 0 0
3.08/3.17 c mcf : 0.00 1 0 0 0 0
3.08/3.17 c rapidlearning : 0.04 1 0 0 0 0
3.08/3.17 c Pricers : Time Calls Vars
3.08/3.17 c problem variables: 0.00 0 0
3.08/3.17 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.08/3.17 c relpscost : 1.60 651 0 80 0 0 1210
3.08/3.17 c pscost : 0.00 0 0 0 0 0 0
3.08/3.17 c inference : 0.00 0 0 0 0 0 0
3.08/3.17 c mostinf : 0.00 0 0 0 0 0 0
3.08/3.17 c leastinf : 0.00 0 0 0 0 0 0
3.08/3.17 c fullstrong : 0.00 0 0 0 0 0 0
3.08/3.17 c allfullstrong : 0.00 0 0 0 0 0 0
3.08/3.17 c random : 0.00 0 0 0 0 0 0
3.08/3.17 c Primal Heuristics : Time Calls Found
3.08/3.17 c LP solutions : 0.00 - 2
3.08/3.17 c pseudo solutions : 0.00 - 0
3.08/3.17 c crossover : 0.00 0 0
3.08/3.17 c intshifting : 0.00 0 0
3.08/3.17 c oneopt : 0.00 1 0
3.08/3.17 c guideddiving : 0.00 1 0
3.08/3.17 c objpscostdiving : 0.00 1 0
3.08/3.17 c rootsoldiving : 0.01 1 0
3.08/3.17 c pscostdiving : 0.01 2 0
3.08/3.17 c fracdiving : 0.01 2 0
3.08/3.17 c veclendiving : 0.01 2 0
3.08/3.17 c linesearchdiving : 0.01 2 0
3.08/3.17 c coefdiving : 0.02 2 0
3.08/3.17 c feaspump : 0.02 2 0
3.08/3.17 c trivial : 0.00 2 0
3.08/3.17 c simplerounding : 0.00 0 0
3.08/3.17 c zirounding : 0.01 590 0
3.08/3.17 c rounding : 0.01 465 0
3.08/3.17 c shifting : 0.15 119 0
3.08/3.17 c twoopt : 0.00 0 0
3.08/3.17 c fixandinfer : 0.00 0 0
3.08/3.17 c intdiving : 0.00 0 0
3.08/3.17 c actconsdiving : 0.00 0 0
3.08/3.17 c octane : 0.00 0 0
3.08/3.17 c rens : 0.02 1 0
3.08/3.17 c rins : 0.00 0 0
3.08/3.17 c localbranching : 0.00 0 0
3.08/3.17 c mutation : 0.00 0 0
3.08/3.17 c dins : 0.00 0 0
3.08/3.17 c undercover : 0.02 1 0
3.08/3.17 c nlp : 0.00 0 0
3.08/3.17 c trysol : 0.00 0 0
3.08/3.17 c LP : Time Calls Iterations Iter/call Iter/sec
3.08/3.17 c primal LP : 0.03 0 0 0.00 0.00
3.08/3.17 c dual LP : 0.61 1433 5917 4.13 9718.27
3.08/3.17 c lex dual LP : 0.00 0 0 0.00 -
3.08/3.17 c barrier LP : 0.00 0 0 0.00 -
3.08/3.17 c diving/probing LP: 0.06 192 1083 5.64 17362.73
3.08/3.17 c strong branching : 1.58 1592 14815 9.31 9399.73
3.08/3.17 c (at root node) : - 16 789 49.31 -
3.08/3.17 c conflict analysis: 0.00 0 0 0.00 -
3.08/3.17 c B&B Tree :
3.08/3.17 c number of runs : 1
3.08/3.17 c nodes : 763
3.08/3.17 c nodes (total) : 763
3.08/3.17 c nodes left : 0
3.08/3.17 c max depth : 47
3.08/3.17 c max depth (total): 47
3.08/3.17 c backtracks : 104 (13.6%)
3.08/3.17 c delayed cutoffs : 83
3.08/3.17 c repropagations : 407 (1091 domain reductions, 56 cutoffs)
3.08/3.17 c avg switch length: 3.22
3.08/3.17 c switching time : 0.06
3.08/3.17 c Solution :
3.08/3.17 c Solutions found : 2 (2 improvements)
3.08/3.17 c First Solution : +1.50000000000000e+01 (in run 1, after 357 nodes, 2.27 seconds, depth 46, found by <relaxation>)
3.08/3.17 c Primal Bound : +3.00000000000000e+00 (in run 1, after 763 nodes, 3.15 seconds, depth 44, found by <relaxation>)
3.08/3.17 c Dual Bound : +3.00000000000000e+00
3.08/3.17 c Gap : 0.00 %
3.08/3.17 c Root Dual Bound : +3.00000000000000e+00
3.08/3.17 c Root Iterations : 463
3.08/3.18 c Time complete: 3.17.