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-2703236-1278568463.opb>
0.00/0.01 c original problem has 357 variables (357 bin, 0 int, 0 impl, 0 cont) and 357 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.03 c (round 1) 307 del vars, 50 del conss, 307 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1228 impls, 0 clqs
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 307 deleted vars, 50 deleted constraints, 307 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 1842 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 307 constraints
0.00/0.04 c 307 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.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = 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 t 0.0s| 1 | 0 | 53 | - |1073k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.05 o -1
0.00/0.05 c R 0.0s| 1 | 0 | 53 | - |1074k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.05 o -2
0.00/0.05 c s 0.0s| 1 | 0 | 53 | - |1075k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.06 c 0.0s| 1 | 0 | 84 | - |1080k| 0 | 42 | 50 | 307 | 50 | 316 | 9 | 0 | 0 |-2.100000e+01 |-2.000000e+00 | 90.48%
0.00/0.06 o -9
0.00/0.06 c b 0.0s| 1 | 0 | 84 | - |1082k| 0 | 42 | 50 | 307 | 50 | 316 | 9 | 0 | 0 |-2.100000e+01 |-9.000000e+00 | 57.14%
0.00/0.07 c 0.1s| 1 | 0 | 97 | - |1085k| 0 | 39 | 50 | 307 | 50 | 322 | 15 | 0 | 0 |-1.950000e+01 |-9.000000e+00 | 53.85%
0.00/0.08 c 0.1s| 1 | 0 | 109 | - |1089k| 0 | 38 | 50 | 307 | 50 | 329 | 22 | 0 | 0 |-1.900000e+01 |-9.000000e+00 | 52.63%
0.09/0.10 c 0.1s| 1 | 0 | 159 | - |1093k| 0 | 35 | 50 | 307 | 50 | 336 | 29 | 0 | 0 |-1.750000e+01 |-9.000000e+00 | 48.57%
0.09/0.12 c 0.1s| 1 | 0 | 219 | - |1103k| 0 | 42 | 50 | 307 | 50 | 343 | 36 | 0 | 0 |-1.657143e+01 |-9.000000e+00 | 45.69%
0.09/0.16 c 0.1s| 1 | 0 | 266 | - |1146k| 0 | 46 | 50 | 307 | 50 | 351 | 44 | 0 | 0 |-1.586631e+01 |-9.000000e+00 | 43.28%
0.19/0.21 c 0.2s| 1 | 0 | 289 | - |1416k| 0 | 46 | 50 | 307 | 50 | 360 | 53 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.19/0.25 c 0.2s| 1 | 0 | 334 | - |1650k| 0 | 45 | 50 | 307 | 50 | 367 | 60 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.29/0.30 c 0.3s| 1 | 0 | 364 | - |1842k| 0 | 46 | 50 | 307 | 50 | 377 | 70 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.29/0.35 c 0.3s| 1 | 0 | 402 | - |1915k| 0 | 47 | 50 | 307 | 50 | 386 | 79 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.39/0.41 c 0.4s| 1 | 0 | 481 | - |2053k| 0 | 48 | 50 | 307 | 50 | 143 | 86 | 0 | 0 |-1.484243e+01 |-9.000000e+00 | 39.36%
0.39/0.42 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.42 c 0.4s| 1 | 0 | 511 | - |2102k| 0 | 50 | 50 | 307 | 50 | 151 | 94 | 0 | 0 |-1.476588e+01 |-9.000000e+00 | 39.05%
0.39/0.44 c 0.4s| 1 | 0 | 558 | - |2164k| 0 | 50 | 50 | 307 | 50 | 157 | 100 | 0 | 0 |-1.461113e+01 |-9.000000e+00 | 38.40%
0.39/0.46 c 0.4s| 1 | 0 | 585 | - |2223k| 0 | 47 | 50 | 307 | 50 | 161 | 104 | 0 | 0 |-1.452834e+01 |-9.000000e+00 | 38.05%
0.39/0.48 c 0.5s| 1 | 0 | 623 | - |2315k| 0 | 50 | 50 | 307 | 50 | 167 | 110 | 0 | 0 |-1.449290e+01 |-9.000000e+00 | 37.90%
0.49/0.50 c 0.5s| 1 | 0 | 657 | - |2575k| 0 | 48 | 50 | 307 | 50 | 170 | 113 | 0 | 0 |-1.446397e+01 |-9.000000e+00 | 37.78%
0.49/0.53 c 0.5s| 1 | 0 | 696 | - |2836k| 0 | 48 | 50 | 307 | 50 | 123 | 114 | 0 | 0 |-1.443670e+01 |-9.000000e+00 | 37.66%
0.49/0.55 c 0.5s| 1 | 0 | 734 | - |2881k| 0 | 49 | 50 | 307 | 50 | 124 | 115 | 0 | 0 |-1.441390e+01 |-9.000000e+00 | 37.56%
0.49/0.56 c 0.6s| 1 | 0 | 779 | - |2920k| 0 | 45 | 50 | 307 | 50 | 127 | 118 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.49/0.58 c 0.6s| 1 | 0 | 806 | - |3000k| 0 | 46 | 50 | 307 | 50 | 131 | 122 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.49/0.59 c 0.6s| 1 | 0 | 820 | - |3001k| 0 | 45 | 50 | 307 | 50 | 134 | 125 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.59/0.60 c 0.6s| 1 | 0 | 822 | - |3002k| 0 | 45 | 50 | 307 | 50 | 135 | 126 | 0 | 0 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.89/0.95 c 0.9s| 1 | 2 | 822 | - |3003k| 0 | 45 | 50 | 307 | 50 | 135 | 126 | 0 | 37 |-1.400000e+01 |-9.000000e+00 | 35.71%
0.89/0.95 o -10
0.89/0.95 c * 0.9s| 69 | 5 | 822 | 0.0 |3008k| 10 | - | 50 | 307 | 0 | 0 | 126 | 3 | 37 |-1.400000e+01 |-1.000000e+01 | 28.57%
0.89/0.96 o -11
0.89/0.96 c * 0.9s| 209 | 5 | 822 | 0.0 |3009k| 16 | - | 50 | 307 | 0 | 0 | 126 | 5 | 37 |-1.400000e+01 |-1.100000e+01 | 21.43%
0.89/0.96 o -12
0.89/0.96 c * 1.0s| 273 | 1 | 822 | 0.0 |3010k| 16 | - | 50 | 308 | 0 | 0 | 126 | 7 | 37 |-1.400000e+01 |-1.200000e+01 | 14.29%
1.49/1.52 c
1.49/1.52 c SCIP Status : problem is solved [optimal solution found]
1.49/1.52 c Solving Time (sec) : 1.51
1.49/1.52 c Solving Nodes : 6726
1.49/1.52 c Primal Bound : -1.20000000000000e+01 (9 solutions)
1.49/1.52 c Dual Bound : -1.20000000000000e+01
1.49/1.52 c Gap : 0.00 %
1.49/1.52 s OPTIMUM FOUND
1.49/1.52 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.49/1.52 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.49/1.52 c SCIP Status : problem is solved [optimal solution found]
1.49/1.52 c Solving Time : 1.51
1.49/1.52 c Original Problem :
1.49/1.52 c Problem name : HOME/instance-2703236-1278568463.opb
1.49/1.52 c Variables : 357 (357 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 357 initial, 357 maximal
1.49/1.52 c Presolved Problem :
1.49/1.52 c Problem name : t_HOME/instance-2703236-1278568463.opb
1.49/1.52 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.52 c Constraints : 307 initial, 462 maximal
1.49/1.52 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.52 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c linear : 0.00 307 0 0 307 0 50 0 0
1.49/1.52 c logicor : 0.00 0 0 0 0 0 0 0 0
1.49/1.52 c root node : - 50 - - 50 - - - -
1.49/1.52 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.52 c integral : 0 0 0 1 0 0 0 0 0 2
1.49/1.52 c logicor : 307+ 23 9887 0 3 1941 19360 1 0 0
1.49/1.52 c countsols : 0 0 0 0 3 0 0 0 0 0
1.49/1.52 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.52 c integral : 0.33 0.00 0.00 0.33 0.00
1.49/1.52 c logicor : 0.11 0.00 0.11 0.00 0.00
1.49/1.52 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.52 c Propagators : Time Calls Cutoffs DomReds
1.49/1.52 c vbounds : 0.01 2 0 0
1.49/1.52 c rootredcost : 0.01 3 0 0
1.49/1.52 c pseudoobj : 0.15 26314 1969 18212
1.49/1.52 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.52 c propagation : 0.07 3910 3787 3787 3.6 0 0.0 -
1.49/1.52 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.52 c applied globally : - - - 3787 3.6 - - -
1.49/1.52 c applied locally : - - - 0 0.0 - - -
1.49/1.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.52 c cut pool : 0.01 22 - - 64 - (maximal pool size: 1192)
1.49/1.52 c redcost : 0.00 23 0 0 0 0
1.49/1.52 c impliedbounds : 0.00 23 0 0 2 0
1.49/1.52 c intobj : 0.00 0 0 0 0 0
1.49/1.52 c cgmip : 0.00 0 0 0 0 0
1.49/1.52 c gomory : 0.25 23 0 0 1821 0
1.49/1.52 c strongcg : 0.16 20 0 0 2535 0
1.49/1.52 c cmir : 0.02 10 0 0 0 0
1.49/1.52 c flowcover : 0.03 10 0 0 0 0
1.49/1.52 c clique : 0.01 23 0 0 115 0
1.49/1.52 c zerohalf : 0.00 0 0 0 0 0
1.49/1.52 c mcf : 0.00 2 0 0 0 0
1.49/1.52 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.52 c Pricers : Time Calls Vars
1.49/1.52 c problem variables: 0.00 0 0
1.49/1.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.52 c relpscost : 0.33 1 0 0 0 0 2
1.49/1.52 c pscost : 0.00 0 0 0 0 0 0
1.49/1.52 c inference : 0.02 4024 0 0 0 0 8048
1.49/1.52 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.52 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.52 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.52 c random : 0.00 0 0 0 0 0 0
1.49/1.52 c Primal Heuristics : Time Calls Found
1.49/1.52 c LP solutions : 0.00 - 0
1.49/1.52 c pseudo solutions : 0.00 - 3
1.49/1.52 c crossover : 0.00 0 0
1.49/1.52 c oneopt : 0.00 2 1
1.49/1.52 c trivial : 0.00 2 2
1.49/1.52 c simplerounding : 0.00 23 0
1.49/1.52 c zirounding : 0.00 1 1
1.49/1.52 c rounding : 0.00 23 1
1.49/1.52 c shifting : 0.01 23 1
1.49/1.52 c intshifting : 0.00 0 0
1.49/1.52 c twoopt : 0.00 0 0
1.49/1.52 c fixandinfer : 0.00 0 0
1.49/1.52 c feaspump : 0.00 0 0
1.49/1.52 c coefdiving : 0.00 0 0
1.49/1.52 c pscostdiving : 0.00 0 0
1.49/1.52 c fracdiving : 0.00 0 0
1.49/1.52 c veclendiving : 0.00 0 0
1.49/1.52 c intdiving : 0.00 0 0
1.49/1.52 c actconsdiving : 0.00 0 0
1.49/1.52 c objpscostdiving : 0.00 0 0
1.49/1.52 c rootsoldiving : 0.00 0 0
1.49/1.52 c linesearchdiving : 0.00 0 0
1.49/1.52 c guideddiving : 0.00 0 0
1.49/1.52 c octane : 0.00 0 0
1.49/1.52 c rens : 0.01 0 0
1.49/1.52 c rins : 0.00 0 0
1.49/1.52 c localbranching : 0.00 0 0
1.49/1.52 c mutation : 0.00 0 0
1.49/1.52 c dins : 0.00 0 0
1.49/1.52 c undercover : 0.00 0 0
1.49/1.52 c nlp : 0.00 0 0
1.49/1.52 c trysol : 0.00 0 0
1.49/1.52 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.52 c primal LP : 0.00 0 0 0.00 -
1.49/1.52 c dual LP : 0.07 23 822 35.74 12144.85
1.49/1.52 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.52 c barrier LP : 0.00 0 0 0.00 -
1.49/1.52 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.52 c strong branching : 0.33 37 4036 109.08 12194.97
1.49/1.52 c (at root node) : - 37 4036 109.08 -
1.49/1.52 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.52 c B&B Tree :
1.49/1.52 c number of runs : 1
1.49/1.52 c nodes : 6726
1.49/1.52 c nodes (total) : 6726
1.49/1.52 c nodes left : 0
1.49/1.52 c max depth : 38
1.49/1.52 c max depth (total): 38
1.49/1.52 c backtracks : 1254 (18.6%)
1.49/1.52 c delayed cutoffs : 1316
1.49/1.52 c repropagations : 11841 (15405 domain reductions, 1212 cutoffs)
1.49/1.52 c avg switch length: 4.39
1.49/1.52 c switching time : 0.09
1.49/1.52 c Solution :
1.49/1.52 c Solutions found : 9 (7 improvements)
1.49/1.52 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.49/1.52 c Primal Bound : -1.20000000000000e+01 (in run 1, after 273 nodes, 0.95 seconds, depth 14, found by <relaxation>)
1.49/1.52 c Dual Bound : -1.20000000000000e+01
1.49/1.52 c Gap : 0.00 %
1.49/1.52 c Root Dual Bound : -1.40000000000000e+01
1.49/1.52 c Root Iterations : 822
1.49/1.53 c Time complete: 1.52.