0.00/0.01 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.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2665255-1276662320.opb>
0.00/0.02 c original problem has 782 variables (782 bin, 0 int, 0 impl, 0 cont) and 782 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 o 0
0.00/0.03 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.03 c presolving:
0.19/0.21 c (round 1) 732 del vars, 50 del conss, 732 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2928 impls, 0 clqs
0.19/0.24 c presolving (2 rounds):
0.19/0.24 c 732 deleted vars, 50 deleted constraints, 732 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.24 c 4392 implications, 0 cliques
0.19/0.24 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 732 constraints
0.19/0.24 c 732 constraints of type <logicor>
0.19/0.24 c transformed objective value is always integral (scale: 1)
0.19/0.24 c Presolving Time: 0.12
0.19/0.24 c - non default parameters ----------------------------------------------------------------------
0.19/0.24 c # SCIP version 1.2.1.2
0.19/0.24 c
0.19/0.24 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.24 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.24 c conflict/interconss = 0
0.19/0.24 c
0.19/0.24 c # should binary conflicts be preferred?
0.19/0.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24 c conflict/preferbinary = TRUE
0.19/0.24 c
0.19/0.24 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.24 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.24 c constraints/agelimit = 1
0.19/0.24 c
0.19/0.24 c # should enforcement of pseudo solution be disabled?
0.19/0.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24 c constraints/disableenfops = TRUE
0.19/0.24 c
0.19/0.24 c # frequency for displaying node information lines
0.19/0.24 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.24 c display/freq = 10000
0.19/0.24 c
0.19/0.24 c # maximal time in seconds to run
0.19/0.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.24 c limits/time = 1799.99
0.19/0.24 c
0.19/0.24 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.24 c limits/memory = 1620
0.19/0.24 c
0.19/0.24 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.24 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.24 c lp/solvefreq = 0
0.19/0.24 c
0.19/0.24 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.19/0.24 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.24 c lp/pricing = a
0.19/0.24 c
0.19/0.24 c # should presolving try to simplify inequalities
0.19/0.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24 c constraints/linear/simplifyinequalities = TRUE
0.19/0.24 c
0.19/0.24 c # should presolving try to simplify knapsacks
0.19/0.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.24 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.24 c
0.19/0.24 c # priority of node selection rule <dfs> in standard mode
0.19/0.24 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.24 c nodeselection/dfs/stdpriority = 1000000
0.19/0.24 c
0.19/0.24 c -----------------------------------------------------------------------------------------------
0.19/0.24 c start solving
0.19/0.24 c
0.19/0.25 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.25 c t 0.1s| 1 | 0 | 50 | - |2174k| 0 | 50 | 50 | 732 | 50 | 732 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.19/0.25 o -1
0.19/0.25 c R 0.1s| 1 | 0 | 50 | - |2175k| 0 | 50 | 50 | 732 | 50 | 732 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.19/0.27 c 0.1s| 1 | 0 | 84 | - |2183k| 0 | 38 | 50 | 732 | 50 | 737 | 5 | 0 | 0 |-1.900000e+01 |-1.000000e+00 | 94.74%
0.19/0.27 o -5
0.19/0.27 c b 0.1s| 1 | 0 | 84 | - |2184k| 0 | 38 | 50 | 732 | 50 | 737 | 5 | 0 | 0 |-1.900000e+01 |-5.000000e+00 | 73.68%
0.29/0.30 c 0.2s| 1 | 0 | 160 | - |2190k| 0 | 28 | 50 | 732 | 50 | 745 | 13 | 0 | 0 |-1.400000e+01 |-5.000000e+00 | 64.29%
0.29/0.33 c 0.2s| 1 | 0 | 215 | - |2194k| 0 | 24 | 50 | 732 | 50 | 752 | 20 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.29/0.37 c 0.2s| 1 | 0 | 279 | - |2202k| 0 | 32 | 50 | 732 | 50 | 757 | 25 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.39/0.45 c 0.3s| 1 | 0 | 361 | - |2302k| 0 | 28 | 50 | 732 | 50 | 762 | 30 | 0 | 0 |-9.750000e+00 |-5.000000e+00 | 48.72%
0.49/0.52 c 0.4s| 1 | 0 | 445 | - |2348k| 0 | 18 | 50 | 732 | 50 | 770 | 38 | 0 | 0 |-9.000000e+00 |-5.000000e+00 | 44.44%
0.49/0.57 c 0.4s| 1 | 0 | 493 | - |2382k| 0 | 33 | 50 | 732 | 50 | 778 | 46 | 0 | 0 |-8.789474e+00 |-5.000000e+00 | 43.11%
0.58/0.65 c 0.5s| 1 | 0 | 538 | - |2600k| 0 | 34 | 50 | 732 | 50 | 785 | 53 | 0 | 0 |-8.517540e+00 |-5.000000e+00 | 41.30%
0.69/0.75 c 0.6s| 1 | 0 | 585 | - |2734k| 0 | 41 | 50 | 732 | 50 | 794 | 62 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.79/0.87 c 0.7s| 1 | 0 | 680 | - |3096k| 0 | 38 | 50 | 732 | 50 | 800 | 68 | 0 | 0 |-7.922559e+00 |-5.000000e+00 | 36.89%
0.89/0.97 c 0.8s| 1 | 0 | 719 | - |3697k| 0 | 40 | 50 | 732 | 50 | 119 | 78 | 0 | 0 |-7.775388e+00 |-5.000000e+00 | 35.69%
0.89/0.99 c 0.8s| 1 | 0 | 753 | - |3779k| 0 | 43 | 50 | 732 | 50 | 131 | 90 | 0 | 0 |-7.611604e+00 |-5.000000e+00 | 34.31%
0.99/1.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.01 c 0.9s| 1 | 0 | 783 | - |3978k| 0 | 43 | 50 | 732 | 50 | 140 | 99 | 0 | 0 |-7.532056e+00 |-5.000000e+00 | 33.62%
0.99/1.04 c 0.9s| 1 | 0 | 820 | - |4219k| 0 | 43 | 50 | 732 | 50 | 148 | 107 | 0 | 0 |-7.438856e+00 |-5.000000e+00 | 32.79%
0.99/1.06 c 0.9s| 1 | 0 | 856 | - |4442k| 0 | 42 | 50 | 732 | 50 | 154 | 113 | 0 | 0 |-7.368612e+00 |-5.000000e+00 | 32.14%
0.99/1.08 c 0.9s| 1 | 0 | 891 | - |4666k| 0 | 44 | 50 | 732 | 50 | 161 | 120 | 0 | 0 |-7.318948e+00 |-5.000000e+00 | 31.68%
1.10/1.11 c 1.0s| 1 | 0 | 942 | - |4901k| 0 | 45 | 50 | 732 | 50 | 123 | 128 | 0 | 0 |-7.246573e+00 |-5.000000e+00 | 31.00%
1.10/1.13 c 1.0s| 1 | 0 | 984 | - |5084k| 0 | 47 | 50 | 732 | 50 | 131 | 136 | 0 | 0 |-7.200338e+00 |-5.000000e+00 | 30.56%
1.10/1.15 c 1.0s| 1 | 0 | 1022 | - |5268k| 0 | 45 | 50 | 732 | 50 | 138 | 143 | 0 | 0 |-7.163668e+00 |-5.000000e+00 | 30.20%
1.10/1.18 c 1.0s| 1 | 0 | 1065 | - |5426k| 0 | 47 | 50 | 732 | 50 | 144 | 149 | 0 | 0 |-7.142192e+00 |-5.000000e+00 | 29.99%
1.10/1.19 c 1.0s| 1 | 0 | 1101 | - |5432k| 0 | 47 | 50 | 732 | 50 | 150 | 155 | 0 | 0 |-7.110136e+00 |-5.000000e+00 | 29.68%
1.19/1.21 c 1.1s| 1 | 0 | 1138 | - |5436k| 0 | 46 | 50 | 732 | 50 | 156 | 161 | 0 | 0 |-7.087730e+00 |-5.000000e+00 | 29.46%
1.19/1.22 c 1.1s| 1 | 0 | 1185 | - |5447k| 0 | 49 | 50 | 732 | 50 | 132 | 170 | 0 | 0 |-7.039493e+00 |-5.000000e+00 | 28.97%
1.19/1.24 c 1.1s| 1 | 0 | 1245 | - |5455k| 0 | 46 | 50 | 732 | 50 | 138 | 176 | 0 | 0 |-7.000349e+00 |-5.000000e+00 | 28.57%
1.19/1.26 c 1.1s| 1 | 0 | 1297 | - |5462k| 0 | 44 | 50 | 732 | 50 | 147 | 185 | 0 | 0 |-6.982653e+00 |-5.000000e+00 | 28.39%
1.19/1.27 c 1.1s| 1 | 0 | 1309 | - |5468k| 0 | 49 | 50 | 732 | 50 | 153 | 191 | 0 | 0 |-6.981996e+00 |-5.000000e+00 | 28.39%
1.19/1.29 c 1.1s| 1 | 0 | 1366 | - |5472k| 0 | 47 | 50 | 732 | 50 | 156 | 194 | 0 | 0 |-6.972612e+00 |-5.000000e+00 | 28.29%
1.28/1.31 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.28/1.31 c 1.2s| 1 | 0 | 1452 | - |5479k| 0 | 48 | 50 | 732 | 50 | 164 | 202 | 0 | 0 |-6.966395e+00 |-5.000000e+00 | 28.23%
1.28/1.32 c 1.2s| 1 | 0 | 1464 | - |5482k| 0 | 49 | 50 | 732 | 50 | 140 | 205 | 0 | 0 |-6.966220e+00 |-5.000000e+00 | 28.23%
1.28/1.34 c 1.2s| 1 | 0 | 1490 | - |5485k| 0 | 50 | 50 | 732 | 50 | 145 | 210 | 0 | 0 |-6.965543e+00 |-5.000000e+00 | 28.22%
1.28/1.35 c 1.2s| 1 | 0 | 1504 | - |5487k| 0 | 49 | 50 | 732 | 50 | 149 | 214 | 0 | 0 |-6.964741e+00 |-5.000000e+00 | 28.21%
1.28/1.36 c 1.2s| 1 | 0 | 1513 | - |5489k| 0 | 49 | 50 | 732 | 50 | 151 | 216 | 0 | 0 |-6.964592e+00 |-5.000000e+00 | 28.21%
1.59/1.61 c 1.4s| 1 | 2 | 1513 | - |5490k| 0 | 49 | 50 | 732 | 50 | 151 | 216 | 0 | 18 |-6.964592e+00 |-5.000000e+00 | 28.21%
1.59/1.62 o -6
1.59/1.62 c * 1.4s| 79 | 0 | 1513 | 0.0 |5494k| 15 | - | 50 | 732 | 0 | 0 | 216 | 0 | 18 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.59/1.62 c
1.59/1.62 c SCIP Status : problem is solved [optimal solution found]
1.59/1.62 c Solving Time (sec) : 1.44
1.59/1.62 c Solving Nodes : 79
1.59/1.62 c Primal Bound : -6.00000000000000e+00 (7 solutions)
1.59/1.62 c Dual Bound : -6.00000000000000e+00
1.59/1.62 c Gap : 0.00 %
1.59/1.62 s OPTIMUM FOUND
1.59/1.62 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.62 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.62 c SCIP Status : problem is solved [optimal solution found]
1.59/1.62 c Solving Time : 1.44
1.59/1.62 c Original Problem :
1.59/1.62 c Problem name : HOME/instance-2665255-1276662320.opb
1.59/1.62 c Variables : 782 (782 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.62 c Constraints : 782 initial, 782 maximal
1.59/1.62 c Presolved Problem :
1.59/1.62 c Problem name : t_HOME/instance-2665255-1276662320.opb
1.59/1.62 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.62 c Constraints : 732 initial, 732 maximal
1.59/1.62 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.62 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.62 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.62 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.62 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.62 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.62 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.62 c linear : 0.00 732 0 0 732 0 50 0 0
1.59/1.62 c logicor : 0.01 0 0 0 0 0 0 0 0
1.59/1.62 c root node : - 0 - - 0 - - - -
1.59/1.62 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.62 c integral : 0 0 0 1 0 0 0 0 0 2
1.59/1.62 c logicor : 732 33 188 0 1 18 230 0 0 0
1.59/1.62 c countsols : 0 0 0 0 1 0 0 0 0 0
1.59/1.62 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.62 c integral : 0.21 0.00 0.00 0.21 0.00
1.59/1.62 c logicor : 0.01 0.01 0.00 0.00 0.00
1.59/1.62 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.62 c Propagators : Time Calls Cutoffs DomReds
1.59/1.62 c vbounds : 0.00 2 0 0
1.59/1.62 c rootredcost : 0.00 0 0 0
1.59/1.62 c pseudoobj : 0.00 154 19 64
1.59/1.62 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.62 c propagation : 0.00 37 0 0 0.0 0 0.0 -
1.59/1.62 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.62 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.62 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.62 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.62 c applied globally : - - - 0 0.0 - - -
1.59/1.62 c applied locally : - - - 0 0.0 - - -
1.59/1.62 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.62 c cut pool : 0.01 32 - - 387 - (maximal pool size: 2057)
1.59/1.62 c redcost : 0.00 33 0 0 0 0
1.59/1.62 c impliedbounds : 0.00 33 0 0 0 0
1.59/1.62 c intobj : 0.00 0 0 0 0 0
1.59/1.62 c cgmip : 0.00 0 0 0 0 0
1.59/1.62 c gomory : 0.43 33 0 0 3683 0
1.59/1.62 c strongcg : 0.28 20 0 0 5197 0
1.59/1.62 c cmir : 0.02 10 0 0 0 0
1.59/1.62 c flowcover : 0.05 10 0 0 0 0
1.59/1.62 c clique : 0.03 33 0 0 257 0
1.59/1.62 c zerohalf : 0.00 0 0 0 0 0
1.59/1.62 c mcf : 0.00 1 0 0 0 0
1.59/1.62 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.62 c Pricers : Time Calls Vars
1.59/1.62 c problem variables: 0.00 0 0
1.59/1.62 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.62 c relpscost : 0.21 1 0 0 0 0 2
1.59/1.62 c pscost : 0.00 0 0 0 0 0 0
1.59/1.62 c inference : 0.00 40 0 0 0 0 80
1.59/1.62 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.62 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.62 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.62 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.62 c random : 0.00 0 0 0 0 0 0
1.59/1.62 c Primal Heuristics : Time Calls Found
1.59/1.62 c LP solutions : 0.00 - 0
1.59/1.62 c pseudo solutions : 0.00 - 1
1.59/1.62 c crossover : 0.00 0 0
1.59/1.62 c oneopt : 0.00 2 1
1.59/1.62 c trivial : 0.00 2 2
1.59/1.62 c simplerounding : 0.00 33 0
1.59/1.62 c zirounding : 0.00 1 1
1.59/1.62 c rounding : 0.00 33 1
1.59/1.62 c shifting : 0.00 33 1
1.59/1.62 c intshifting : 0.00 0 0
1.59/1.62 c twoopt : 0.00 0 0
1.59/1.62 c fixandinfer : 0.00 0 0
1.59/1.62 c feaspump : 0.00 0 0
1.59/1.62 c coefdiving : 0.00 0 0
1.59/1.62 c pscostdiving : 0.00 0 0
1.59/1.62 c fracdiving : 0.00 0 0
1.59/1.62 c veclendiving : 0.00 0 0
1.59/1.62 c intdiving : 0.00 0 0
1.59/1.62 c actconsdiving : 0.00 0 0
1.59/1.62 c objpscostdiving : 0.00 0 0
1.59/1.62 c rootsoldiving : 0.00 0 0
1.59/1.62 c linesearchdiving : 0.00 0 0
1.59/1.62 c guideddiving : 0.00 0 0
1.59/1.62 c octane : 0.00 0 0
1.59/1.62 c rens : 0.00 0 0
1.59/1.62 c rins : 0.00 0 0
1.59/1.62 c localbranching : 0.00 0 0
1.59/1.62 c mutation : 0.00 0 0
1.59/1.62 c dins : 0.00 0 0
1.59/1.62 c undercover : 0.00 0 0
1.59/1.62 c nlp : 0.00 0 0
1.59/1.62 c trysol : 0.00 0 0
1.59/1.62 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.62 c primal LP : 0.01 0 0 0.00 0.00
1.59/1.62 c dual LP : 0.23 33 1513 45.85 6578.26
1.59/1.62 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.62 c barrier LP : 0.00 0 0 0.00 -
1.59/1.62 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.62 c strong branching : 0.21 18 3140 174.44 14952.38
1.59/1.62 c (at root node) : - 18 3140 174.44 -
1.59/1.62 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.62 c B&B Tree :
1.59/1.62 c number of runs : 1
1.59/1.62 c nodes : 79
1.59/1.62 c nodes (total) : 79
1.59/1.62 c nodes left : 0
1.59/1.62 c max depth : 15
1.59/1.62 c max depth (total): 15
1.59/1.62 c backtracks : 10 (12.7%)
1.59/1.62 c delayed cutoffs : 0
1.59/1.62 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.59/1.62 c avg switch length: 2.00
1.59/1.62 c switching time : 0.01
1.59/1.62 c Solution :
1.59/1.62 c Solutions found : 7 (4 improvements)
1.59/1.62 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.59/1.62 c Primal Bound : -6.00000000000000e+00 (in run 1, after 79 nodes, 1.44 seconds, depth 15, found by <relaxation>)
1.59/1.62 c Dual Bound : -6.00000000000000e+00
1.59/1.62 c Gap : 0.00 %
1.59/1.62 c Root Dual Bound : -6.96459178665024e+00
1.59/1.62 c Root Iterations : 1513
1.59/1.63 c Time complete: 1.62.