0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666662-1276659748.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.03
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 = 1800
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 | 53 | - |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 | 53 | - |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 | 53 | - |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 | 85 | - |1071k| 0 | 43 | 50 | 305 | 50 | 312 | 7 | 0 | 0 |-2.150000e+01 |-2.000000e+00 | 90.70%
0.00/0.09 o -8
0.00/0.09 c b 0.1s| 1 | 0 | 85 | - |1073k| 0 | 43 | 50 | 305 | 50 | 312 | 7 | 0 | 0 |-2.150000e+01 |-8.000000e+00 | 62.79%
0.09/0.10 c 0.1s| 1 | 0 | 99 | - |1076k| 0 | 40 | 50 | 305 | 50 | 318 | 13 | 0 | 0 |-2.000000e+01 |-8.000000e+00 | 60.00%
0.09/0.12 c 0.1s| 1 | 0 | 137 | - |1080k| 0 | 38 | 50 | 305 | 50 | 323 | 18 | 0 | 0 |-1.900000e+01 |-8.000000e+00 | 57.89%
0.09/0.14 c 0.1s| 1 | 0 | 183 | - |1085k| 0 | 43 | 50 | 305 | 50 | 330 | 25 | 0 | 0 |-1.750000e+01 |-8.000000e+00 | 54.29%
0.09/0.17 c 0.1s| 1 | 0 | 221 | - |1100k| 0 | 34 | 50 | 305 | 50 | 339 | 34 | 0 | 0 |-1.700000e+01 |-8.000000e+00 | 52.94%
0.09/0.19 c 0.1s| 1 | 0 | 248 | - |1107k| 0 | 41 | 50 | 305 | 50 | 345 | 40 | 0 | 0 |-1.662500e+01 |-8.000000e+00 | 51.88%
0.19/0.23 c 0.2s| 1 | 0 | 316 | - |1133k| 0 | 47 | 50 | 305 | 50 | 354 | 49 | 0 | 0 |-1.604167e+01 |-8.000000e+00 | 50.13%
0.19/0.27 c 0.2s| 1 | 0 | 372 | - |1197k| 0 | 48 | 50 | 305 | 50 | 363 | 58 | 0 | 0 |-1.561290e+01 |-8.000000e+00 | 48.76%
0.29/0.33 c 0.3s| 1 | 0 | 427 | - |1489k| 0 | 44 | 50 | 305 | 50 | 371 | 66 | 0 | 0 |-1.524013e+01 |-8.000000e+00 | 47.51%
0.29/0.37 c 0.3s| 1 | 0 | 480 | - |1597k| 0 | 46 | 50 | 305 | 50 | 384 | 79 | 0 | 0 |-1.490909e+01 |-8.000000e+00 | 46.34%
0.39/0.43 c 0.4s| 1 | 0 | 510 | - |2029k| 0 | 48 | 50 | 305 | 50 | 147 | 87 | 0 | 0 |-1.467251e+01 |-8.000000e+00 | 45.48%
0.39/0.45 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.45 c 0.4s| 1 | 0 | 541 | - |2119k| 0 | 50 | 50 | 305 | 50 | 157 | 97 | 0 | 0 |-1.444408e+01 |-8.000000e+00 | 44.61%
0.39/0.47 c 0.4s| 1 | 0 | 562 | - |2354k| 0 | 50 | 50 | 305 | 50 | 166 | 106 | 0 | 0 |-1.436493e+01 |-8.000000e+00 | 44.31%
0.49/0.50 c 0.4s| 1 | 0 | 603 | - |2580k| 0 | 50 | 50 | 305 | 50 | 173 | 113 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.49/0.53 c 0.5s| 1 | 0 | 625 | - |2811k| 0 | 50 | 50 | 305 | 50 | 179 | 119 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.49/0.55 c 0.5s| 1 | 0 | 651 | - |3057k| 0 | 50 | 50 | 305 | 50 | 184 | 124 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.49/0.58 c 0.5s| 1 | 0 | 672 | - |3302k| 0 | 49 | 50 | 305 | 50 | 147 | 130 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.60 c 0.5s| 1 | 0 | 684 | - |3497k| 0 | 49 | 50 | 305 | 50 | 149 | 132 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.59/0.62 c 0.6s| 1 | 0 | 717 | - |3708k| 0 | 50 | 50 | 305 | 50 | 151 | 134 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.79/0.86 c 0.8s| 1 | 2 | 717 | - |3709k| 0 | 50 | 50 | 305 | 50 | 151 | 134 | 0 | 20 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.79/0.87 o -9
0.79/0.87 c * 0.8s| 15 | 5 | 717 | 0.0 |3714k| 8 | - | 50 | 307 | 0 | 0 | 134 | 2 | 20 |-1.384680e+01 |-9.000000e+00 | 35.00%
0.79/0.87 o -10
0.79/0.87 c * 0.8s| 55 | 7 | 717 | 0.0 |3715k| 10 | - | 50 | 305 | 0 | 0 | 134 | 2 | 20 |-1.384680e+01 |-1.000000e+01 | 27.78%
0.89/0.91 o -11
0.89/0.91 c * 0.8s| 571 | 8 | 717 | 0.0 |3716k| 21 | - | 50 | 306 | 0 | 0 | 134 | 8 | 20 |-1.384680e+01 |-1.100000e+01 | 20.56%
0.89/0.92 o -12
0.89/0.92 c * 0.8s| 663 | 3 | 717 | 0.0 |3716k| 21 | - | 50 | 305 | 0 | 0 | 134 | 9 | 20 |-1.384680e+01 |-1.200000e+01 | 13.34%
1.79/1.84 c
1.79/1.84 c SCIP Status : problem is solved [optimal solution found]
1.79/1.84 c Solving Time (sec) : 1.60
1.79/1.84 c Solving Nodes : 7888
1.79/1.84 c Primal Bound : -1.20000000000000e+01 (10 solutions)
1.79/1.84 c Dual Bound : -1.20000000000000e+01
1.79/1.84 c Gap : 0.00 %
1.79/1.84 s OPTIMUM FOUND
1.79/1.84 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.79/1.84 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.79/1.84 c SCIP Status : problem is solved [optimal solution found]
1.79/1.84 c Solving Time : 1.60
1.79/1.84 c Original Problem :
1.79/1.84 c Problem name : HOME/instance-2666662-1276659748.opb
1.79/1.84 c Variables : 355 (355 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.84 c Constraints : 355 initial, 355 maximal
1.79/1.84 c Presolved Problem :
1.79/1.84 c Problem name : t_HOME/instance-2666662-1276659748.opb
1.79/1.84 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.79/1.84 c Constraints : 305 initial, 471 maximal
1.79/1.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.79/1.84 c trivial : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c implics : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c probing : 0.00 0 0 0 0 0 0 0 0
1.79/1.84 c linear : 0.00 305 0 0 305 0 50 0 0
1.79/1.84 c logicor : 0.01 0 0 0 0 0 0 0 0
1.79/1.84 c root node : - 40 - - 40 - - - -
1.79/1.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.79/1.84 c integral : 0 0 0 1 0 0 0 0 0 2
1.79/1.84 c logicor : 305+ 19 11286 0 4 2332 21374 0 0 0
1.79/1.84 c countsols : 0 0 0 0 4 0 0 0 0 0
1.79/1.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.79/1.84 c integral : 0.22 0.00 0.00 0.22 0.00
1.79/1.84 c logicor : 0.23 0.00 0.23 0.00 0.00
1.79/1.84 c countsols : 0.00 0.00 0.00 0.00 0.00
1.79/1.84 c Propagators : Time Calls Cutoffs DomReds
1.79/1.84 c vbounds : 0.01 2 0 0
1.79/1.84 c rootredcost : 0.00 4 0 0
1.79/1.84 c pseudoobj : 0.19 28195 2174 21786
1.79/1.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.79/1.84 c propagation : 0.07 4506 3836 3836 3.6 0 0.0 -
1.79/1.84 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.79/1.84 c pseudo solution : 0.00 1 1 1 10.0 0 0.0 -
1.79/1.84 c applied globally : - - - 3837 3.6 - - -
1.79/1.84 c applied locally : - - - 0 0.0 - - -
1.79/1.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.79/1.84 c cut pool : 0.00 18 - - 472 - (maximal pool size: 1636)
1.79/1.84 c redcost : 0.00 19 0 0 0 0
1.79/1.84 c impliedbounds : 0.00 19 0 0 0 0
1.79/1.84 c intobj : 0.00 0 0 0 0 0
1.79/1.84 c cgmip : 0.00 0 0 0 0 0
1.79/1.84 c gomory : 0.22 19 0 0 2713 0
1.79/1.84 c strongcg : 0.16 19 0 0 3660 0
1.79/1.84 c cmir : 0.02 10 0 0 0 0
1.79/1.84 c flowcover : 0.01 10 0 0 0 0
1.79/1.84 c clique : 0.00 19 0 0 128 0
1.79/1.84 c zerohalf : 0.00 0 0 0 0 0
1.79/1.84 c mcf : 0.00 1 0 0 0 0
1.79/1.84 c rapidlearning : 0.00 0 0 0 0 0
1.79/1.84 c Pricers : Time Calls Vars
1.79/1.84 c problem variables: 0.00 0 0
1.79/1.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.79/1.84 c relpscost : 0.22 1 0 0 0 0 2
1.79/1.84 c pscost : 0.00 0 0 0 0 0 0
1.79/1.84 c inference : 0.02 4591 0 0 0 0 9182
1.79/1.84 c mostinf : 0.00 0 0 0 0 0 0
1.79/1.84 c leastinf : 0.00 0 0 0 0 0 0
1.79/1.84 c fullstrong : 0.00 0 0 0 0 0 0
1.79/1.84 c allfullstrong : 0.00 0 0 0 0 0 0
1.79/1.84 c random : 0.00 0 0 0 0 0 0
1.79/1.84 c Primal Heuristics : Time Calls Found
1.79/1.84 c LP solutions : 0.00 - 0
1.79/1.84 c pseudo solutions : 0.00 - 4
1.79/1.84 c crossover : 0.00 0 0
1.79/1.84 c oneopt : 0.02 2 1
1.79/1.84 c trivial : 0.00 2 2
1.79/1.84 c simplerounding : 0.00 20 0
1.79/1.84 c zirounding : 0.00 1 1
1.79/1.84 c rounding : 0.00 20 1
1.79/1.84 c shifting : 0.00 20 1
1.79/1.84 c intshifting : 0.00 0 0
1.79/1.84 c twoopt : 0.00 0 0
1.79/1.84 c fixandinfer : 0.00 0 0
1.79/1.84 c feaspump : 0.00 0 0
1.79/1.84 c coefdiving : 0.00 0 0
1.79/1.84 c pscostdiving : 0.00 0 0
1.79/1.84 c fracdiving : 0.00 0 0
1.79/1.84 c veclendiving : 0.00 0 0
1.79/1.84 c intdiving : 0.00 0 0
1.79/1.84 c actconsdiving : 0.00 0 0
1.79/1.84 c objpscostdiving : 0.00 0 0
1.79/1.84 c rootsoldiving : 0.00 0 0
1.79/1.84 c linesearchdiving : 0.00 0 0
1.79/1.84 c guideddiving : 0.00 0 0
1.79/1.84 c octane : 0.00 0 0
1.79/1.84 c rens : 0.01 0 0
1.79/1.84 c rins : 0.00 0 0
1.79/1.84 c localbranching : 0.00 0 0
1.79/1.84 c mutation : 0.00 0 0
1.79/1.84 c dins : 0.00 0 0
1.79/1.84 c undercover : 0.00 0 0
1.79/1.84 c nlp : 0.01 0 0
1.79/1.84 c trysol : 0.00 0 0
1.79/1.84 c LP : Time Calls Iterations Iter/call Iter/sec
1.79/1.84 c primal LP : 0.00 0 0 0.00 -
1.79/1.84 c dual LP : 0.04 20 717 35.85 17925.00
1.79/1.84 c lex dual LP : 0.00 0 0 0.00 -
1.79/1.84 c barrier LP : 0.00 0 0 0.00 -
1.79/1.84 c diving/probing LP: 0.00 0 0 0.00 -
1.79/1.84 c strong branching : 0.22 20 2545 127.25 11568.18
1.79/1.84 c (at root node) : - 20 2545 127.25 -
1.79/1.84 c conflict analysis: 0.00 0 0 0.00 -
1.79/1.84 c B&B Tree :
1.79/1.84 c number of runs : 1
1.79/1.84 c nodes : 7888
1.79/1.84 c nodes (total) : 7888
1.79/1.84 c nodes left : 0
1.79/1.84 c max depth : 37
1.79/1.84 c max depth (total): 37
1.79/1.84 c backtracks : 1423 (18.0%)
1.79/1.84 c delayed cutoffs : 1295
1.79/1.84 c repropagations : 11926 (15622 domain reductions, 1215 cutoffs)
1.79/1.84 c avg switch length: 4.05
1.79/1.84 c switching time : 0.09
1.79/1.84 c Solution :
1.79/1.84 c Solutions found : 10 (8 improvements)
1.79/1.84 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.79/1.84 c Primal Bound : -1.20000000000000e+01 (in run 1, after 663 nodes, 0.83 seconds, depth 15, found by <relaxation>)
1.79/1.84 c Dual Bound : -1.20000000000000e+01
1.79/1.84 c Gap : 0.00 %
1.79/1.84 c Root Dual Bound : -1.40000000000000e+01
1.79/1.84 c Root Iterations : 717
1.79/1.85 c Time complete: 1.84.