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-2665222-1276658645.opb>
0.00/0.01 c original problem has 359 variables (359 bin, 0 int, 0 impl, 0 cont) and 359 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 0
0.00/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.02 c presolving:
0.02/0.06 c (round 1) 309 del vars, 50 del conss, 309 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1236 impls, 0 clqs
0.02/0.07 c presolving (2 rounds):
0.02/0.07 c 309 deleted vars, 50 deleted constraints, 309 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.07 c 1854 implications, 0 cliques
0.02/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 309 constraints
0.02/0.07 c 309 constraints of type <logicor>
0.02/0.07 c transformed objective value is always integral (scale: 1)
0.02/0.07 c Presolving Time: 0.04
0.02/0.07 c - non default parameters ----------------------------------------------------------------------
0.02/0.07 c # SCIP version 1.2.1.2
0.02/0.07 c
0.02/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.07 c conflict/interconss = 0
0.02/0.07 c
0.02/0.07 c # should binary conflicts be preferred?
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c conflict/preferbinary = TRUE
0.02/0.07 c
0.02/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.07 c constraints/agelimit = 1
0.02/0.07 c
0.02/0.07 c # should enforcement of pseudo solution be disabled?
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/disableenfops = TRUE
0.02/0.07 c
0.02/0.07 c # frequency for displaying node information lines
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.07 c display/freq = 10000
0.02/0.07 c
0.02/0.07 c # maximal time in seconds to run
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/time = 1799.99
0.02/0.07 c
0.02/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.07 c limits/memory = 1620
0.02/0.07 c
0.02/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.02/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.07 c lp/solvefreq = 0
0.02/0.07 c
0.02/0.07 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.02/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.02/0.07 c lp/pricing = a
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify inequalities
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/linear/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # should presolving try to simplify knapsacks
0.02/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.07 c
0.02/0.07 c # priority of node selection rule <dfs> in standard mode
0.02/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.02/0.07 c nodeselection/dfs/stdpriority = 1000000
0.02/0.07 c
0.02/0.07 c -----------------------------------------------------------------------------------------------
0.02/0.07 c start solving
0.02/0.08 c
0.02/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.02/0.08 c t 0.0s| 1 | 0 | 50 | - |1076k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.02/0.08 o -1
0.02/0.08 c R 0.0s| 1 | 0 | 50 | - |1077k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.02/0.08 o -2
0.02/0.08 c s 0.0s| 1 | 0 | 50 | - |1078k| 0 | 50 | 50 | 309 | 50 | 309 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.02/0.09 c 0.1s| 1 | 0 | 81 | - |1082k| 0 | 44 | 50 | 309 | 50 | 316 | 7 | 0 | 0 |-2.200000e+01 |-2.000000e+00 | 90.91%
0.02/0.09 o -7
0.02/0.09 c b 0.1s| 1 | 0 | 81 | - |1084k| 0 | 44 | 50 | 309 | 50 | 316 | 7 | 0 | 0 |-2.200000e+01 |-7.000000e+00 | 68.18%
0.09/0.10 c 0.1s| 1 | 0 | 109 | - |1088k| 0 | 41 | 50 | 309 | 50 | 321 | 12 | 0 | 0 |-2.050000e+01 |-7.000000e+00 | 65.85%
0.09/0.12 c 0.1s| 1 | 0 | 149 | - |1092k| 0 | 37 | 50 | 309 | 50 | 327 | 18 | 0 | 0 |-1.850000e+01 |-7.000000e+00 | 62.16%
0.09/0.13 c 0.1s| 1 | 0 | 171 | - |1097k| 0 | 36 | 50 | 309 | 50 | 334 | 25 | 0 | 0 |-1.800000e+01 |-7.000000e+00 | 61.11%
0.09/0.15 c 0.1s| 1 | 0 | 204 | - |1101k| 0 | 44 | 50 | 309 | 50 | 341 | 32 | 0 | 0 |-1.750000e+01 |-7.000000e+00 | 60.00%
0.09/0.18 c 0.1s| 1 | 0 | 248 | - |1111k| 0 | 44 | 50 | 309 | 50 | 348 | 39 | 0 | 0 |-1.700000e+01 |-7.000000e+00 | 58.82%
0.19/0.22 c 0.2s| 1 | 0 | 304 | - |1129k| 0 | 33 | 50 | 309 | 50 | 355 | 46 | 0 | 0 |-1.650000e+01 |-7.000000e+00 | 57.58%
0.19/0.24 c 0.2s| 1 | 0 | 359 | - |1134k| 0 | 41 | 50 | 309 | 50 | 362 | 53 | 0 | 0 |-1.587500e+01 |-7.000000e+00 | 55.91%
0.19/0.28 c 0.2s| 1 | 0 | 401 | - |1162k| 0 | 48 | 50 | 309 | 50 | 368 | 59 | 0 | 0 |-1.552553e+01 |-7.000000e+00 | 54.91%
0.29/0.35 c 0.3s| 1 | 0 | 434 | - |1443k| 0 | 48 | 50 | 309 | 50 | 375 | 66 | 0 | 0 |-1.533627e+01 |-7.000000e+00 | 54.36%
0.29/0.39 c 0.3s| 1 | 0 | 498 | - |1534k| 0 | 44 | 50 | 309 | 50 | 137 | 75 | 0 | 0 |-1.506998e+01 |-7.000000e+00 | 53.55%
0.39/0.41 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.41 c 0.4s| 1 | 0 | 538 | - |1747k| 0 | 48 | 50 | 309 | 50 | 146 | 84 | 0 | 0 |-1.481091e+01 |-7.000000e+00 | 52.74%
0.39/0.44 c 0.4s| 1 | 0 | 558 | - |2003k| 0 | 47 | 50 | 309 | 50 | 155 | 93 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.39/0.46 c 0.4s| 1 | 0 | 581 | - |2150k| 0 | 44 | 50 | 309 | 50 | 161 | 99 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.39/0.48 c 0.4s| 1 | 0 | 603 | - |2172k| 0 | 49 | 50 | 309 | 50 | 170 | 108 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.49/0.50 c 0.4s| 1 | 0 | 630 | - |2317k| 0 | 48 | 50 | 309 | 50 | 177 | 115 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.49/0.52 c 0.5s| 1 | 0 | 650 | - |2470k| 0 | 45 | 50 | 309 | 50 | 139 | 119 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.49/0.54 c 0.5s| 1 | 0 | 669 | - |2501k| 0 | 49 | 50 | 309 | 50 | 146 | 126 | 0 | 0 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.59/0.67 c 0.6s| 1 | 2 | 669 | - |2502k| 0 | 49 | 50 | 309 | 50 | 146 | 126 | 0 | 25 |-1.400000e+01 |-7.000000e+00 | 50.00%
0.59/0.67 o -9
0.59/0.67 c * 0.6s| 10 | 5 | 669 | 0.0 |2507k| 9 | - | 50 | 309 | 0 | 0 | 126 | 0 | 25 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.67 o -10
0.59/0.67 c * 0.6s| 20 | 5 | 669 | 0.0 |2508k| 9 | - | 50 | 309 | 0 | 0 | 126 | 0 | 25 |-1.400000e+01 |-1.000000e+01 | 28.57%
0.59/0.69 o -11
0.59/0.69 c * 0.6s| 240 | 4 | 669 | 0.0 |2509k| 17 | - | 50 | 309 | 0 | 0 | 126 | 10 | 25 |-1.400000e+01 |-1.100000e+01 | 21.43%
0.89/0.99 o -12
0.89/0.99 c * 0.9s| 2664 | 5 | 669 | 0.0 |2520k| 29 | - | 50 | 337 | 0 | 0 | 126 |1222 | 25 |-1.400000e+01 |-1.200000e+01 | 14.29%
1.49/1.56 o -13
1.49/1.56 c * 1.3s| 6938 | 4 | 669 | 0.0 |2430k| 30 | - | 50 | 149 | 0 | 0 | 126 |3721 | 25 |-1.400000e+01 |-1.300000e+01 | 7.14%
1.59/1.60 c
1.59/1.60 c SCIP Status : problem is solved [optimal solution found]
1.59/1.60 c Solving Time (sec) : 1.36
1.59/1.60 c Solving Nodes : 7289
1.59/1.60 c Primal Bound : -1.30000000000000e+01 (15 solutions)
1.59/1.60 c Dual Bound : -1.30000000000000e+01
1.59/1.60 c Gap : 0.00 %
1.59/1.60 s OPTIMUM FOUND
1.59/1.60 v -x50 x49 x48 -x47 x46 -x45 x44 -x43 -x42 -x41 x40 x39 x38 x37 x36 -x35 x34 x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 x23
1.59/1.60 v -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.59/1.60 c SCIP Status : problem is solved [optimal solution found]
1.59/1.60 c Solving Time : 1.36
1.59/1.60 c Original Problem :
1.59/1.60 c Problem name : HOME/instance-2665222-1276658645.opb
1.59/1.60 c Variables : 359 (359 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.60 c Constraints : 359 initial, 359 maximal
1.59/1.60 c Presolved Problem :
1.59/1.60 c Problem name : t_HOME/instance-2665222-1276658645.opb
1.59/1.60 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.60 c Constraints : 309 initial, 530 maximal
1.59/1.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.60 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.60 c linear : 0.00 309 0 0 309 0 50 0 0
1.59/1.60 c logicor : 0.00 0 0 0 0 0 0 0 0
1.59/1.60 c root node : - 50 - - 50 - - - -
1.59/1.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.60 c integral : 0 0 0 1 0 0 0 0 0 2
1.59/1.60 c logicor : 309+ 18 10648 0 5 2181 20028 1 0 0
1.59/1.60 c countsols : 0 0 0 0 5 0 0 0 0 0
1.59/1.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.60 c integral : 0.11 0.00 0.00 0.11 0.00
1.59/1.60 c logicor : 0.08 0.00 0.08 0.00 0.00
1.59/1.60 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.60 c Propagators : Time Calls Cutoffs DomReds
1.59/1.60 c vbounds : 0.04 2 0 0
1.59/1.60 c rootredcost : 0.01 5 0 0
1.59/1.60 c pseudoobj : 0.14 27489 2023 19746
1.59/1.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.60 c propagation : 0.02 4204 3923 3923 3.8 0 0.0 -
1.59/1.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.60 c applied globally : - - - 3923 3.8 - - -
1.59/1.60 c applied locally : - - - 0 0.0 - - -
1.59/1.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.60 c cut pool : 0.00 17 - - 137 - (maximal pool size: 943)
1.59/1.60 c redcost : 0.00 18 0 0 0 0
1.59/1.60 c impliedbounds : 0.00 18 0 0 0 0
1.59/1.60 c intobj : 0.00 0 0 0 0 0
1.59/1.60 c cgmip : 0.00 0 0 0 0 0
1.59/1.60 c gomory : 0.21 18 0 0 2484 0
1.59/1.60 c strongcg : 0.11 18 0 0 2825 0
1.59/1.60 c cmir : 0.01 10 0 0 0 0
1.59/1.60 c flowcover : 0.01 10 0 0 0 0
1.59/1.60 c clique : 0.00 18 0 0 126 0
1.59/1.60 c zerohalf : 0.00 0 0 0 0 0
1.59/1.60 c mcf : 0.00 1 0 0 0 0
1.59/1.60 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.60 c Pricers : Time Calls Vars
1.59/1.60 c problem variables: 0.00 0 0
1.59/1.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.60 c relpscost : 0.11 1 0 0 0 0 2
1.59/1.60 c pscost : 0.00 0 0 0 0 0 0
1.59/1.60 c inference : 0.03 4309 0 0 0 0 8618
1.59/1.60 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.60 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.60 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.60 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.60 c random : 0.00 0 0 0 0 0 0
1.59/1.60 c Primal Heuristics : Time Calls Found
1.59/1.60 c LP solutions : 0.00 - 0
1.59/1.60 c pseudo solutions : 0.00 - 5
1.59/1.60 c crossover : 0.00 0 0
1.59/1.60 c oneopt : 0.01 2 1
1.59/1.60 c trivial : 0.00 2 2
1.59/1.60 c simplerounding : 0.00 19 0
1.59/1.60 c zirounding : 0.00 1 1
1.59/1.60 c rounding : 0.01 19 1
1.59/1.60 c shifting : 0.00 19 5
1.59/1.60 c intshifting : 0.00 0 0
1.59/1.60 c twoopt : 0.00 0 0
1.59/1.60 c fixandinfer : 0.00 0 0
1.59/1.60 c feaspump : 0.00 0 0
1.59/1.60 c coefdiving : 0.00 0 0
1.59/1.60 c pscostdiving : 0.00 0 0
1.59/1.60 c fracdiving : 0.00 0 0
1.59/1.60 c veclendiving : 0.00 0 0
1.59/1.60 c intdiving : 0.00 0 0
1.59/1.60 c actconsdiving : 0.00 0 0
1.59/1.60 c objpscostdiving : 0.00 0 0
1.59/1.60 c rootsoldiving : 0.00 0 0
1.59/1.60 c linesearchdiving : 0.00 0 0
1.59/1.60 c guideddiving : 0.00 0 0
1.59/1.60 c octane : 0.00 0 0
1.59/1.60 c rens : 0.01 0 0
1.59/1.60 c rins : 0.00 0 0
1.59/1.60 c localbranching : 0.00 0 0
1.59/1.60 c mutation : 0.00 0 0
1.59/1.60 c dins : 0.00 0 0
1.59/1.60 c undercover : 0.00 0 0
1.59/1.60 c nlp : 0.00 0 0
1.59/1.61 c trysol : 0.01 0 0
1.59/1.61 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.61 c primal LP : 0.00 0 0 0.00 -
1.59/1.61 c dual LP : 0.05 19 669 35.21 13380.00
1.59/1.61 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.61 c barrier LP : 0.00 0 0 0.00 -
1.59/1.61 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.61 c strong branching : 0.11 25 2002 80.08 18200.00
1.59/1.61 c (at root node) : - 25 2002 80.08 -
1.59/1.61 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.61 c B&B Tree :
1.59/1.61 c number of runs : 1
1.59/1.61 c nodes : 7289
1.59/1.61 c nodes (total) : 7289
1.59/1.61 c nodes left : 0
1.59/1.61 c max depth : 37
1.59/1.61 c max depth (total): 37
1.59/1.61 c backtracks : 1330 (18.2%)
1.59/1.61 c delayed cutoffs : 1324
1.59/1.61 c repropagations : 12040 (15264 domain reductions, 1230 cutoffs)
1.59/1.61 c avg switch length: 4.23
1.59/1.61 c switching time : 0.10
1.59/1.61 c Solution :
1.59/1.61 c Solutions found : 15 (9 improvements)
1.59/1.61 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.59/1.61 c Primal Bound : -1.30000000000000e+01 (in run 1, after 6938 nodes, 1.33 seconds, depth 28, found by <relaxation>)
1.59/1.61 c Dual Bound : -1.30000000000000e+01
1.59/1.61 c Gap : 0.00 %
1.59/1.61 c Root Dual Bound : -1.40000000000000e+01
1.59/1.61 c Root Iterations : 669
1.59/1.61 c Time complete: 1.61.