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-2666105-1276448658.opb>
0.00/0.01 c original problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 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) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 225 upgd conss, 1476 impls, 0 clqs
0.00/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 252 upgd conss, 1476 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 1548 implications, 0 cliques
0.00/0.04 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 constraints
0.00/0.04 c 252 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.01
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 98 | - | 823k| 0 | 87 | 132 | 252 | 132 | 252 | 0 | 0 | 0 | 4.350000e+01 | -- | Inf
0.00/0.06 c 0.0s| 1 | 0 | 134 | - | 837k| 0 | 80 | 132 | 252 | 132 | 268 | 16 | 0 | 0 | 4.700000e+01 | -- | Inf
0.00/0.08 c 0.1s| 1 | 0 | 160 | - | 843k| 0 | 80 | 132 | 252 | 132 | 276 | 24 | 0 | 0 | 4.800000e+01 | -- | Inf
0.00/0.08 o 66
0.00/0.08 c s 0.1s| 1 | 0 | 160 | - | 845k| 0 | 80 | 132 | 252 | 132 | 276 | 24 | 0 | 0 | 4.800000e+01 | 6.600000e+01 | 37.50%
0.09/0.09 c 0.1s| 1 | 0 | 202 | - | 851k| 0 | 96 | 132 | 252 | 132 | 283 | 31 | 0 | 0 | 4.875000e+01 | 6.600000e+01 | 35.38%
0.09/0.10 o 57
0.09/0.10 c b 0.1s| 1 | 0 | 202 | - | 855k| 0 | 96 | 132 | 252 | 132 | 283 | 31 | 0 | 0 | 4.875000e+01 | 5.700000e+01 | 16.92%
0.10/0.13 c 0.1s| 1 | 0 | 243 | - | 876k| 0 | 96 | 132 | 252 | 132 | 289 | 37 | 0 | 0 | 4.905556e+01 | 5.700000e+01 | 16.19%
0.10/0.16 c 0.1s| 1 | 0 | 280 | - | 920k| 0 | 99 | 132 | 252 | 132 | 296 | 44 | 0 | 0 | 4.950000e+01 | 5.700000e+01 | 15.15%
0.10/0.20 c 0.2s| 1 | 0 | 305 | - |1028k| 0 | 95 | 132 | 252 | 132 | 302 | 50 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.19/0.24 c 0.2s| 1 | 0 | 328 | - |1115k| 0 | 101 | 132 | 252 | 132 | 305 | 53 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.19/0.29 c 0.3s| 1 | 0 | 366 | - |1130k| 0 | 102 | 132 | 252 | 132 | 308 | 56 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.29/0.34 c 0.3s| 1 | 0 | 401 | - |1137k| 0 | 103 | 132 | 252 | 132 | 310 | 58 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.29/0.39 c 0.4s| 1 | 0 | 449 | - |1147k| 0 | 101 | 132 | 252 | 132 | 311 | 59 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.39/0.44 c 0.4s| 1 | 0 | 458 | - |1147k| 0 | 101 | 132 | 252 | 132 | 309 | 60 | 0 | 0 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.60/0.63 c 0.6s| 1 | 2 | 458 | - |1148k| 0 | 101 | 132 | 252 | 132 | 309 | 60 | 0 | 18 | 5.000000e+01 | 5.700000e+01 | 14.00%
0.89/0.91 o 56
0.89/0.91 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.91 c * 0.8s| 1803 | 14 | 458 | 0.0 |1168k| 25 | - | 132 | 262 | 0 | 0 | 60 | 555 | 18 | 5.000000e+01 | 5.600000e+01 | 12.00%
1.00/1.10 o 54
1.00/1.10 c * 1.0s| 2888 | 21 | 458 | 0.0 |1179k| 33 | - | 132 | 272 | 0 | 0 | 60 |1105 | 18 | 5.000000e+01 | 5.400000e+01 | 8.00%
2.29/2.33 c 2.0s| 10000 | 3 | 458 | 0.0 |1147k| 39 | - | 132 | 225 | 0 | 0 | 60 |4218 | 18 | 5.000000e+01 | 5.400000e+01 | 8.00%
2.29/2.34 c
2.29/2.34 c SCIP Status : problem is solved [optimal solution found]
2.29/2.34 c Solving Time (sec) : 2.06
2.29/2.34 c Solving Nodes : 10064
2.29/2.34 c Primal Bound : +5.40000000000000e+01 (4 solutions)
2.29/2.34 c Dual Bound : +5.40000000000000e+01
2.29/2.34 c Gap : 0.00 %
2.29/2.34 s OPTIMUM FOUND
2.29/2.34 v -x132 x131 x130 -x129 x128 -x127 x126 -x125 x124 -x123 -x122 x121 x120 -x119 -x118 x117 x116 -x115 x114 -x113 x112 -x111 -x110
2.29/2.34 v x109 x108 -x107 x106 -x105 -x104 x103 x102 -x101 x100 -x99 -x98 x97 -x96 x95 -x94 -x93 -x92 x91 x90 -x89 -x88 x87 -x86 -x85 -x84
2.29/2.34 v x83 -x82 -x81 -x80 x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 x71 -x70 -x69 x68 -x67 -x66 x65 -x64 -x63 -x62 x61 -x60 x59 -x58
2.29/2.34 v -x57 -x56 -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
2.29/2.34 v -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 -x2
2.29/2.34 v x1
2.29/2.34 c SCIP Status : problem is solved [optimal solution found]
2.29/2.34 c Solving Time : 2.06
2.29/2.34 c Original Problem :
2.29/2.34 c Problem name : HOME/instance-2666105-1276448658.opb
2.29/2.34 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.34 c Constraints : 252 initial, 252 maximal
2.29/2.34 c Presolved Problem :
2.29/2.34 c Problem name : t_HOME/instance-2666105-1276448658.opb
2.29/2.34 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.34 c Constraints : 252 initial, 328 maximal
2.29/2.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.29/2.34 c trivial : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c implics : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c probing : 0.01 0 0 0 0 0 0 0 0
2.29/2.34 c logicor : 0.00 0 0 0 0 0 0 0 0
2.29/2.34 c root node : - 105 - - 105 - - - -
2.29/2.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.29/2.34 c integral : 0 0 0 1 0 0 0 0 0 2
2.29/2.34 c logicor : 252+ 11 25553 0 2 4559 34328 0 0 0
2.29/2.34 c countsols : 0 0 0 0 2 0 0 0 0 0
2.29/2.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.29/2.34 c integral : 0.17 0.00 0.00 0.17 0.00
2.29/2.34 c logicor : 0.40 0.00 0.40 0.00 0.00
2.29/2.34 c countsols : 0.00 0.00 0.00 0.00 0.00
2.29/2.34 c Propagators : Time Calls Cutoffs DomReds
2.29/2.34 c vbounds : 0.02 2 0 0
2.29/2.34 c rootredcost : 0.03 2 0 0
2.29/2.34 c pseudoobj : 0.37 35651 937 72695
2.29/2.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.34 c propagation : 0.37 5494 4242 4242 10.0 19 9.9 -
2.29/2.34 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.34 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
2.29/2.34 c applied globally : - - - 4261 10.0 - - -
2.29/2.34 c applied locally : - - - 0 0.0 - - -
2.29/2.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.34 c cut pool : 0.00 10 - - 11 - (maximal pool size: 234)
2.29/2.34 c redcost : 0.00 11 0 0 0 0
2.29/2.34 c impliedbounds : 0.00 11 0 0 5 0
2.29/2.34 c intobj : 0.00 0 0 0 0 0
2.29/2.34 c cgmip : 0.00 0 0 0 0 0
2.29/2.34 c gomory : 0.14 11 0 0 1551 0
2.29/2.34 c strongcg : 0.09 11 0 0 1506 0
2.29/2.34 c cmir : 0.07 10 0 0 0 0
2.29/2.34 c flowcover : 0.01 10 0 0 0 0
2.29/2.34 c clique : 0.00 11 0 0 34 0
2.29/2.34 c zerohalf : 0.00 0 0 0 0 0
2.29/2.34 c mcf : 0.00 1 0 0 0 0
2.29/2.34 c rapidlearning : 0.00 0 0 0 0 0
2.29/2.34 c Pricers : Time Calls Vars
2.29/2.34 c problem variables: 0.00 0 0
2.29/2.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.34 c relpscost : 0.17 1 0 0 0 0 2
2.29/2.34 c pscost : 0.00 0 0 0 0 0 0
2.29/2.34 c inference : 0.08 6806 0 0 0 0 13612
2.29/2.34 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.34 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.34 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.34 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.34 c random : 0.00 0 0 0 0 0 0
2.29/2.34 c Primal Heuristics : Time Calls Found
2.29/2.34 c LP solutions : 0.00 - 0
2.29/2.34 c pseudo solutions : 0.00 - 2
2.29/2.34 c crossover : 0.00 0 0
2.29/2.34 c oneopt : 0.00 2 1
2.29/2.34 c trivial : 0.00 2 0
2.29/2.34 c simplerounding : 0.00 0 0
2.29/2.34 c zirounding : 0.00 1 0
2.29/2.34 c rounding : 0.00 12 0
2.29/2.34 c shifting : 0.01 12 1
2.29/2.34 c intshifting : 0.00 0 0
2.29/2.34 c twoopt : 0.00 0 0
2.29/2.34 c fixandinfer : 0.00 0 0
2.29/2.34 c feaspump : 0.01 1 0
2.29/2.34 c coefdiving : 0.00 0 0
2.29/2.34 c pscostdiving : 0.00 0 0
2.29/2.34 c fracdiving : 0.00 0 0
2.29/2.34 c veclendiving : 0.00 0 0
2.29/2.34 c intdiving : 0.00 0 0
2.29/2.34 c actconsdiving : 0.00 0 0
2.29/2.34 c objpscostdiving : 0.00 0 0
2.29/2.34 c rootsoldiving : 0.00 0 0
2.29/2.34 c linesearchdiving : 0.00 0 0
2.29/2.34 c guideddiving : 0.00 0 0
2.29/2.34 c octane : 0.00 0 0
2.29/2.34 c rens : 0.00 0 0
2.29/2.34 c rins : 0.00 0 0
2.29/2.34 c localbranching : 0.00 0 0
2.29/2.34 c mutation : 0.00 0 0
2.29/2.34 c dins : 0.00 0 0
2.29/2.34 c undercover : 0.00 0 0
2.29/2.34 c nlp : 0.00 0 0
2.29/2.34 c trysol : 0.00 0 0
2.29/2.34 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.34 c primal LP : 0.00 0 0 0.00 -
2.29/2.34 c dual LP : 0.05 12 458 38.17 9160.00
2.29/2.34 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.34 c barrier LP : 0.00 0 0 0.00 -
2.29/2.34 c diving/probing LP: 0.00 0 0 0.00 -
2.29/2.34 c strong branching : 0.17 18 1852 102.89 10894.12
2.29/2.34 c (at root node) : - 18 1852 102.89 -
2.29/2.34 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.34 c B&B Tree :
2.29/2.34 c number of runs : 1
2.29/2.34 c nodes : 10064
2.29/2.34 c nodes (total) : 10064
2.29/2.34 c nodes left : 0
2.29/2.34 c max depth : 39
2.29/2.34 c max depth (total): 39
2.29/2.34 c backtracks : 2679 (26.6%)
2.29/2.34 c delayed cutoffs : 3543
2.29/2.34 c repropagations : 6945 (46322 domain reductions, 2242 cutoffs)
2.29/2.34 c avg switch length: 2.56
2.29/2.34 c switching time : 0.22
2.29/2.34 c Solution :
2.29/2.34 c Solutions found : 4 (4 improvements)
2.29/2.34 c First Solution : +6.60000000000000e+01 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <shifting>)
2.29/2.34 c Primal Bound : +5.40000000000000e+01 (in run 1, after 2888 nodes, 0.99 seconds, depth 33, found by <relaxation>)
2.29/2.34 c Dual Bound : +5.40000000000000e+01
2.29/2.34 c Gap : 0.00 %
2.29/2.34 c Root Dual Bound : +5.00000000000000e+01
2.29/2.34 c Root Iterations : 458
2.29/2.35 c Time complete: 2.35.