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-2665232-1276659747.opb>
0.00/0.01 c original problem has 355 variables (355 bin, 0 int, 0 impl, 0 cont) and 355 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.00/0.06 c (round 1) 305 del vars, 50 del conss, 305 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1220 impls, 0 clqs
0.00/0.07 c presolving (2 rounds):
0.00/0.07 c 305 deleted vars, 50 deleted constraints, 305 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.07 c 1830 implications, 0 cliques
0.00/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.00/0.07 c 305 constraints of type <logicor>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.04
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 1.2.1.2
0.00/0.07 c
0.00/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c conflict/interconss = 0
0.00/0.07 c
0.00/0.07 c # should binary conflicts be preferred?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c conflict/preferbinary = TRUE
0.00/0.07 c
0.00/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c constraints/agelimit = 1
0.00/0.07 c
0.00/0.07 c # should enforcement of pseudo solution be disabled?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/disableenfops = TRUE
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 = 1799.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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c lp/solvefreq = 0
0.00/0.07 c
0.00/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.00/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.07 c lp/pricing = a
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 # 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 # priority of node selection rule <dfs> in standard mode
0.00/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.07 c nodeselection/dfs/stdpriority = 1000000
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.08 c
0.00/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.00/0.08 c t 0.0s| 1 | 0 | 52 | - |1065k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.08 o -1
0.00/0.08 c R 0.0s| 1 | 0 | 52 | - |1066k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.08 o -2
0.00/0.08 c s 0.0s| 1 | 0 | 52 | - |1067k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.09 c 0.1s| 1 | 0 | 80 | - |1070k| 0 | 46 | 50 | 305 | 50 | 309 | 4 | 0 | 0 |-2.300000e+01 |-2.000000e+00 | 91.30%
0.00/0.09 o -8
0.00/0.09 c b 0.1s| 1 | 0 | 80 | - |1072k| 0 | 46 | 50 | 305 | 50 | 309 | 4 | 0 | 0 |-2.300000e+01 |-8.000000e+00 | 65.22%
0.09/0.10 c 0.1s| 1 | 0 | 104 | - |1074k| 0 | 42 | 50 | 305 | 50 | 313 | 8 | 0 | 0 |-2.100000e+01 |-8.000000e+00 | 61.90%
0.09/0.11 c 0.1s| 1 | 0 | 124 | - |1078k| 0 | 39 | 50 | 305 | 50 | 319 | 14 | 0 | 0 |-1.950000e+01 |-8.000000e+00 | 58.97%
0.09/0.13 c 0.1s| 1 | 0 | 153 | - |1082k| 0 | 37 | 50 | 305 | 50 | 324 | 19 | 0 | 0 |-1.850000e+01 |-8.000000e+00 | 56.76%
0.09/0.14 c 0.1s| 1 | 0 | 176 | - |1086k| 0 | 36 | 50 | 305 | 50 | 329 | 24 | 0 | 0 |-1.800000e+01 |-8.000000e+00 | 55.56%
0.09/0.16 c 0.1s| 1 | 0 | 211 | - |1090k| 0 | 39 | 50 | 305 | 50 | 335 | 30 | 0 | 0 |-1.675000e+01 |-8.000000e+00 | 52.24%
0.09/0.18 c 0.1s| 1 | 0 | 257 | - |1100k| 0 | 42 | 50 | 305 | 50 | 343 | 38 | 0 | 0 |-1.600000e+01 |-8.000000e+00 | 50.00%
0.19/0.21 c 0.2s| 1 | 0 | 311 | - |1123k| 0 | 46 | 50 | 305 | 50 | 351 | 46 | 0 | 0 |-1.550761e+01 |-8.000000e+00 | 48.41%
0.19/0.26 c 0.2s| 1 | 0 | 352 | - |1384k| 0 | 44 | 50 | 305 | 50 | 361 | 56 | 0 | 0 |-1.513636e+01 |-8.000000e+00 | 47.15%
0.29/0.31 c 0.2s| 1 | 0 | 377 | - |1420k| 0 | 47 | 50 | 305 | 50 | 367 | 62 | 0 | 0 |-1.482456e+01 |-8.000000e+00 | 46.04%
0.29/0.36 c 0.3s| 1 | 0 | 430 | - |1533k| 0 | 50 | 50 | 305 | 50 | 137 | 72 | 0 | 0 |-1.461429e+01 |-8.000000e+00 | 45.26%
0.29/0.38 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.38 c 0.3s| 1 | 0 | 474 | - |1796k| 0 | 49 | 50 | 305 | 50 | 149 | 84 | 0 | 0 |-1.440286e+01 |-8.000000e+00 | 44.46%
0.39/0.40 c 0.3s| 1 | 0 | 496 | - |2037k| 0 | 47 | 50 | 305 | 50 | 157 | 92 | 0 | 0 |-1.429188e+01 |-8.000000e+00 | 44.02%
0.39/0.42 c 0.4s| 1 | 0 | 537 | - |2132k| 0 | 49 | 50 | 305 | 50 | 165 | 100 | 0 | 0 |-1.414189e+01 |-8.000000e+00 | 43.43%
0.39/0.44 c 0.4s| 1 | 0 | 545 | - |2191k| 0 | 50 | 50 | 305 | 50 | 169 | 104 | 0 | 0 |-1.413760e+01 |-8.000000e+00 | 43.41%
0.39/0.45 c 0.4s| 1 | 0 | 585 | - |2247k| 0 | 49 | 50 | 305 | 50 | 171 | 106 | 0 | 0 |-1.407123e+01 |-8.000000e+00 | 43.15%
0.39/0.48 c 0.4s| 1 | 0 | 621 | - |2336k| 0 | 48 | 50 | 305 | 50 | 132 | 110 | 0 | 0 |-1.403674e+01 |-8.000000e+00 | 43.01%
0.39/0.49 c 0.4s| 1 | 0 | 638 | - |2390k| 0 | 49 | 50 | 305 | 50 | 139 | 117 | 0 | 0 |-1.403325e+01 |-8.000000e+00 | 42.99%
0.49/0.51 c 0.5s| 1 | 0 | 667 | - |2417k| 0 | 49 | 50 | 305 | 50 | 142 | 120 | 0 | 0 |-1.402190e+01 |-8.000000e+00 | 42.95%
0.49/0.52 c 0.5s| 1 | 0 | 693 | - |2426k| 0 | 50 | 50 | 305 | 50 | 147 | 125 | 0 | 0 |-1.400890e+01 |-8.000000e+00 | 42.89%
0.49/0.53 c 0.5s| 1 | 0 | 706 | - |2430k| 0 | 50 | 50 | 305 | 50 | 151 | 129 | 0 | 0 |-1.400264e+01 |-8.000000e+00 | 42.87%
0.49/0.54 c 0.5s| 1 | 0 | 718 | - |2432k| 0 | 49 | 50 | 305 | 50 | 152 | 130 | 0 | 0 |-1.399511e+01 |-8.000000e+00 | 42.84%
0.49/0.55 c 0.5s| 1 | 0 | 736 | - |2433k| 0 | 49 | 50 | 305 | 50 | 111 | 131 | 0 | 0 |-1.398598e+01 |-8.000000e+00 | 42.80%
0.59/0.67 c 0.6s| 1 | 2 | 736 | - |2434k| 0 | 49 | 50 | 305 | 50 | 111 | 131 | 0 | 17 |-1.398598e+01 |-8.000000e+00 | 42.80%
0.59/0.67 o -9
0.59/0.67 c * 0.6s| 41 | 5 | 736 | 0.0 |2438k| 10 | - | 50 | 305 | 0 | 0 | 131 | 1 | 17 |-1.383590e+01 |-9.000000e+00 | 34.95%
0.59/0.68 o -10
0.59/0.68 c * 0.6s| 158 | 5 | 736 | 0.0 |2439k| 13 | - | 50 | 305 | 0 | 0 | 131 | 3 | 17 |-1.383590e+01 |-1.000000e+01 | 27.72%
0.59/0.69 o -11
0.59/0.69 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.69 c * 0.6s| 211 | 7 | 736 | 0.0 |2440k| 15 | - | 50 | 305 | 0 | 0 | 131 | 3 | 17 |-1.383590e+01 |-1.100000e+01 | 20.50%
0.69/0.72 o -12
0.69/0.72 c * 0.7s| 574 | 7 | 736 | 0.0 |2441k| 15 | - | 50 | 305 | 0 | 0 | 131 | 6 | 17 |-1.383590e+01 |-1.200000e+01 | 13.27%
1.59/1.66 c
1.59/1.66 c SCIP Status : problem is solved [optimal solution found]
1.59/1.66 c Solving Time (sec) : 1.42
1.59/1.66 c Solving Nodes : 8268
1.59/1.66 c Primal Bound : -1.20000000000000e+01 (9 solutions)
1.59/1.66 c Dual Bound : -1.20000000000000e+01
1.59/1.66 c Gap : 0.00 %
1.59/1.66 s OPTIMUM FOUND
1.59/1.66 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
1.59/1.66 v -x23 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.66 c SCIP Status : problem is solved [optimal solution found]
1.59/1.66 c Solving Time : 1.42
1.59/1.66 c Original Problem :
1.59/1.66 c Problem name : HOME/instance-2665232-1276659747.opb
1.59/1.66 c Variables : 355 (355 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.66 c Constraints : 355 initial, 355 maximal
1.59/1.66 c Presolved Problem :
1.59/1.66 c Problem name : t_HOME/instance-2665232-1276659747.opb
1.59/1.66 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.66 c Constraints : 305 initial, 475 maximal
1.59/1.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.66 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.66 c linear : 0.00 305 0 0 305 0 50 0 0
1.59/1.66 c logicor : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c root node : - 50 - - 50 - - - -
1.59/1.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.66 c integral : 0 0 0 1 0 0 0 0 0 2
1.59/1.66 c logicor : 305+ 24 11466 0 4 2311 21733 0 0 0
1.59/1.66 c countsols : 0 0 0 0 4 0 0 0 0 0
1.59/1.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.66 c integral : 0.10 0.00 0.00 0.10 0.00
1.59/1.66 c logicor : 0.10 0.00 0.10 0.00 0.00
1.59/1.66 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.66 c Propagators : Time Calls Cutoffs DomReds
1.59/1.66 c vbounds : 0.03 2 0 0
1.59/1.66 c rootredcost : 0.02 4 0 0
1.59/1.66 c pseudoobj : 0.16 28214 2353 21391
1.59/1.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.66 c propagation : 0.07 4664 3679 3679 3.6 0 0.0 -
1.59/1.66 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.66 c applied globally : - - - 3679 3.6 - - -
1.59/1.66 c applied locally : - - - 0 0.0 - - -
1.59/1.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.66 c cut pool : 0.01 23 - - 497 - (maximal pool size: 906)
1.59/1.66 c redcost : 0.00 24 0 0 0 0
1.59/1.66 c impliedbounds : 0.01 24 0 0 0 0
1.59/1.66 c intobj : 0.00 0 0 0 0 0
1.59/1.66 c cgmip : 0.00 0 0 0 0 0
1.59/1.66 c gomory : 0.14 24 0 0 2723 0
1.59/1.66 c strongcg : 0.16 20 0 0 2979 0
1.59/1.66 c cmir : 0.02 10 0 0 0 0
1.59/1.66 c flowcover : 0.03 10 0 0 0 0
1.59/1.66 c clique : 0.02 24 0 0 128 0
1.59/1.66 c zerohalf : 0.00 0 0 0 0 0
1.59/1.66 c mcf : 0.00 1 0 0 0 0
1.59/1.66 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.66 c Pricers : Time Calls Vars
1.59/1.66 c problem variables: 0.00 0 0
1.59/1.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.66 c relpscost : 0.10 1 0 0 0 0 2
1.59/1.66 c pscost : 0.00 0 0 0 0 0 0
1.59/1.66 c inference : 0.06 4765 0 0 0 0 9530
1.59/1.66 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.66 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.66 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.66 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.66 c random : 0.00 0 0 0 0 0 0
1.59/1.66 c Primal Heuristics : Time Calls Found
1.59/1.66 c LP solutions : 0.00 - 0
1.59/1.66 c pseudo solutions : 0.00 - 4
1.59/1.66 c crossover : 0.00 0 0
1.59/1.66 c oneopt : 0.00 2 1
1.59/1.66 c trivial : 0.00 2 2
1.59/1.66 c simplerounding : 0.00 24 0
1.59/1.66 c zirounding : 0.00 1 0
1.59/1.66 c rounding : 0.01 24 1
1.59/1.66 c shifting : 0.01 24 1
1.59/1.66 c intshifting : 0.00 0 0
1.59/1.66 c twoopt : 0.00 0 0
1.59/1.66 c fixandinfer : 0.00 0 0
1.59/1.66 c feaspump : 0.00 0 0
1.59/1.66 c coefdiving : 0.00 0 0
1.59/1.66 c pscostdiving : 0.00 0 0
1.59/1.66 c fracdiving : 0.00 0 0
1.59/1.66 c veclendiving : 0.00 0 0
1.59/1.66 c intdiving : 0.00 0 0
1.59/1.66 c actconsdiving : 0.00 0 0
1.59/1.66 c objpscostdiving : 0.00 0 0
1.59/1.66 c rootsoldiving : 0.00 0 0
1.59/1.66 c linesearchdiving : 0.00 0 0
1.59/1.66 c guideddiving : 0.00 0 0
1.59/1.66 c octane : 0.00 0 0
1.59/1.66 c rens : 0.01 0 0
1.59/1.66 c rins : 0.00 0 0
1.59/1.66 c localbranching : 0.00 0 0
1.59/1.66 c mutation : 0.00 0 0
1.59/1.66 c dins : 0.00 0 0
1.59/1.66 c undercover : 0.00 0 0
1.59/1.66 c nlp : 0.00 0 0
1.59/1.66 c trysol : 0.00 0 0
1.59/1.66 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.66 c primal LP : 0.00 0 0 0.00 -
1.59/1.66 c dual LP : 0.04 24 736 30.67 18400.00
1.59/1.66 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.66 c barrier LP : 0.00 0 0 0.00 -
1.59/1.66 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.66 c strong branching : 0.10 17 1875 110.29 18750.00
1.59/1.66 c (at root node) : - 17 1875 110.29 -
1.59/1.66 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.66 c B&B Tree :
1.59/1.66 c number of runs : 1
1.59/1.66 c nodes : 8268
1.59/1.66 c nodes (total) : 8268
1.59/1.66 c nodes left : 0
1.59/1.66 c max depth : 37
1.59/1.66 c max depth (total): 37
1.59/1.66 c backtracks : 1505 (18.2%)
1.59/1.66 c delayed cutoffs : 1261
1.59/1.66 c repropagations : 11541 (14910 domain reductions, 1166 cutoffs)
1.59/1.66 c avg switch length: 3.90
1.59/1.66 c switching time : 0.09
1.59/1.66 c Solution :
1.59/1.66 c Solutions found : 9 (8 improvements)
1.59/1.66 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.59/1.66 c Primal Bound : -1.20000000000000e+01 (in run 1, after 574 nodes, 0.65 seconds, depth 15, found by <relaxation>)
1.59/1.66 c Dual Bound : -1.20000000000000e+01
1.59/1.66 c Gap : 0.00 %
1.59/1.66 c Root Dual Bound : -1.39859785621881e+01
1.59/1.66 c Root Iterations : 736
1.59/1.67 c Time complete: 1.66.