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-2665237-1276660345.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.01/0.06 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.01/0.07 c presolving (2 rounds):
0.01/0.07 c 307 deleted vars, 50 deleted constraints, 307 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.07 c 1842 implications, 0 cliques
0.01/0.07 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 307 constraints
0.01/0.07 c 307 constraints of type <logicor>
0.01/0.07 c transformed objective value is always integral (scale: 1)
0.01/0.07 c Presolving Time: 0.02
0.01/0.07 c - non default parameters ----------------------------------------------------------------------
0.01/0.07 c # SCIP version 1.2.1.2
0.01/0.07 c
0.01/0.07 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.07 c conflict/interconss = 0
0.01/0.07 c
0.01/0.07 c # should binary conflicts be preferred?
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c conflict/preferbinary = TRUE
0.01/0.07 c
0.01/0.07 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.07 c constraints/agelimit = 1
0.01/0.07 c
0.01/0.07 c # should enforcement of pseudo solution be disabled?
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/disableenfops = TRUE
0.01/0.07 c
0.01/0.07 c # frequency for displaying node information lines
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.07 c display/freq = 10000
0.01/0.07 c
0.01/0.07 c # maximal time in seconds to run
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/time = 1800
0.01/0.07 c
0.01/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/memory = 1620
0.01/0.07 c
0.01/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.07 c lp/solvefreq = 0
0.01/0.07 c
0.01/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.01/0.07 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.07 c lp/pricing = a
0.01/0.07 c
0.01/0.07 c # should presolving try to simplify inequalities
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/linear/simplifyinequalities = TRUE
0.01/0.07 c
0.01/0.07 c # should presolving try to simplify knapsacks
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.07 c
0.01/0.07 c # priority of node selection rule <dfs> in standard mode
0.01/0.07 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.07 c nodeselection/dfs/stdpriority = 1000000
0.01/0.07 c
0.01/0.07 c -----------------------------------------------------------------------------------------------
0.01/0.07 c start solving
0.01/0.07 c
0.01/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.01/0.08 c t 0.0s| 1 | 0 | 55 | - |1072k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.01/0.08 o -1
0.01/0.08 c R 0.0s| 1 | 0 | 55 | - |1073k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.01/0.08 o -2
0.01/0.08 c s 0.0s| 1 | 0 | 55 | - |1074k| 0 | 50 | 50 | 307 | 50 | 307 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.01/0.09 c 0.1s| 1 | 0 | 93 | - |1079k| 0 | 42 | 50 | 307 | 50 | 316 | 9 | 0 | 0 |-2.100000e+01 |-2.000000e+00 | 90.48%
0.01/0.09 o -9
0.01/0.09 c b 0.1s| 1 | 0 | 93 | - |1081k| 0 | 42 | 50 | 307 | 50 | 316 | 9 | 0 | 0 |-2.100000e+01 |-9.000000e+00 | 57.14%
0.09/0.11 c 0.1s| 1 | 0 | 128 | - |1085k| 0 | 39 | 50 | 307 | 50 | 320 | 13 | 0 | 0 |-1.950000e+01 |-9.000000e+00 | 53.85%
0.09/0.12 c 0.1s| 1 | 0 | 157 | - |1091k| 0 | 36 | 50 | 307 | 50 | 328 | 21 | 0 | 0 |-1.800000e+01 |-9.000000e+00 | 50.00%
0.09/0.14 c 0.1s| 1 | 0 | 196 | - |1094k| 0 | 34 | 50 | 307 | 50 | 334 | 27 | 0 | 0 |-1.700000e+01 |-9.000000e+00 | 47.06%
0.09/0.16 c 0.1s| 1 | 0 | 232 | - |1101k| 0 | 45 | 50 | 307 | 50 | 340 | 33 | 0 | 0 |-1.653846e+01 |-9.000000e+00 | 45.58%
0.19/0.20 c 0.1s| 1 | 0 | 276 | - |1123k| 0 | 45 | 50 | 307 | 50 | 348 | 41 | 0 | 0 |-1.592308e+01 |-9.000000e+00 | 43.48%
0.19/0.24 c 0.2s| 1 | 0 | 310 | - |1181k| 0 | 38 | 50 | 307 | 50 | 354 | 47 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.19/0.29 c 0.2s| 1 | 0 | 338 | - |1329k| 0 | 45 | 50 | 307 | 50 | 360 | 53 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.29/0.35 c 0.3s| 1 | 0 | 399 | - |1659k| 0 | 47 | 50 | 307 | 50 | 368 | 61 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.39/0.42 c 0.4s| 1 | 0 | 459 | - |1748k| 0 | 48 | 50 | 307 | 50 | 376 | 69 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.39/0.48 c 0.4s| 1 | 0 | 487 | - |2046k| 0 | 48 | 50 | 307 | 50 | 130 | 75 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.49/0.50 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.50 c 0.4s| 1 | 0 | 523 | - |2138k| 0 | 47 | 50 | 307 | 50 | 137 | 82 | 0 | 0 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.59/0.64 c 0.6s| 1 | 2 | 523 | - |2139k| 0 | 47 | 50 | 307 | 50 | 137 | 82 | 0 | 28 |-1.500000e+01 |-9.000000e+00 | 40.00%
0.59/0.65 o -10
0.59/0.65 c * 0.6s| 9 | 7 | 523 | 0.0 |2144k| 8 | - | 50 | 307 | 0 | 0 | 82 | 0 | 28 |-1.461290e+01 |-1.000000e+01 | 31.57%
0.59/0.65 o -11
0.59/0.65 c * 0.6s| 78 | 6 | 523 | 0.0 |2146k| 11 | - | 50 | 308 | 0 | 0 | 82 | 1 | 28 |-1.461290e+01 |-1.100000e+01 | 24.72%
0.79/0.80 o -12
0.79/0.80 c * 0.7s| 1800 | 4 | 523 | 0.0 |2161k| 29 | - | 50 | 360 | 0 | 0 | 82 | 127 | 28 |-1.461290e+01 |-1.200000e+01 | 17.88%
1.49/1.59 c
1.49/1.59 c SCIP Status : problem is solved [optimal solution found]
1.49/1.59 c Solving Time (sec) : 1.33
1.49/1.59 c Solving Nodes : 7693
1.49/1.59 c Primal Bound : -1.20000000000000e+01 (8 solutions)
1.49/1.59 c Dual Bound : -1.20000000000000e+01
1.49/1.59 c Gap : 0.00 %
1.49/1.59 s OPTIMUM FOUND
1.49/1.59 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.49/1.59 v -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.59 c SCIP Status : problem is solved [optimal solution found]
1.49/1.59 c Solving Time : 1.33
1.49/1.59 c Original Problem :
1.49/1.59 c Problem name : HOME/instance-2665237-1276660345.opb
1.49/1.59 c Variables : 357 (357 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.59 c Constraints : 357 initial, 357 maximal
1.49/1.59 c Presolved Problem :
1.49/1.59 c Problem name : t_HOME/instance-2665237-1276660345.opb
1.49/1.59 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.59 c Constraints : 307 initial, 477 maximal
1.49/1.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.59 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c linear : 0.00 307 0 0 307 0 50 0 0
1.49/1.59 c logicor : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c root node : - 50 - - 50 - - - -
1.49/1.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.59 c integral : 0 0 0 1 0 0 0 0 0 2
1.49/1.59 c logicor : 307+ 12 10856 0 3 2218 20724 0 0 0
1.49/1.59 c countsols : 0 0 0 0 3 0 0 0 0 0
1.49/1.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.59 c integral : 0.13 0.00 0.00 0.13 0.00
1.49/1.59 c logicor : 0.15 0.00 0.15 0.00 0.00
1.49/1.59 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c Propagators : Time Calls Cutoffs DomReds
1.49/1.59 c vbounds : 0.01 2 0 0
1.49/1.59 c rootredcost : 0.00 3 0 0
1.49/1.59 c pseudoobj : 0.18 27014 2153 20615
1.49/1.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.59 c propagation : 0.09 4371 3588 3588 3.7 0 0.0 -
1.49/1.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.59 c applied globally : - - - 3588 3.7 - - -
1.49/1.59 c applied locally : - - - 0 0.0 - - -
1.49/1.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.59 c cut pool : 0.00 11 - - 86 - (maximal pool size: 678)
1.49/1.59 c redcost : 0.00 12 0 0 0 0
1.49/1.59 c impliedbounds : 0.01 12 0 0 0 0
1.49/1.59 c intobj : 0.00 0 0 0 0 0
1.49/1.59 c cgmip : 0.00 0 0 0 0 0
1.49/1.59 c gomory : 0.14 12 0 0 2244 0
1.49/1.59 c strongcg : 0.10 12 0 0 2548 0
1.49/1.59 c cmir : 0.04 10 0 0 0 0
1.49/1.59 c flowcover : 0.04 10 0 0 0 0
1.49/1.59 c clique : 0.00 12 0 0 90 0
1.49/1.59 c zerohalf : 0.00 0 0 0 0 0
1.49/1.59 c mcf : 0.00 1 0 0 0 0
1.49/1.59 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.59 c Pricers : Time Calls Vars
1.49/1.59 c problem variables: 0.00 0 0
1.49/1.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.59 c relpscost : 0.13 1 0 0 0 0 2
1.49/1.59 c pscost : 0.00 0 0 0 0 0 0
1.49/1.59 c inference : 0.02 4458 0 0 0 0 8916
1.49/1.59 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.59 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.59 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c random : 0.00 0 0 0 0 0 0
1.49/1.59 c Primal Heuristics : Time Calls Found
1.49/1.59 c LP solutions : 0.00 - 0
1.49/1.59 c pseudo solutions : 0.00 - 3
1.49/1.59 c crossover : 0.00 0 0
1.49/1.59 c oneopt : 0.01 2 1
1.49/1.59 c trivial : 0.00 2 2
1.49/1.59 c simplerounding : 0.00 13 0
1.49/1.59 c zirounding : 0.00 1 0
1.49/1.59 c rounding : 0.00 13 1
1.49/1.59 c shifting : 0.00 13 1
1.49/1.59 c intshifting : 0.00 0 0
1.49/1.59 c twoopt : 0.00 0 0
1.49/1.59 c fixandinfer : 0.00 0 0
1.49/1.59 c feaspump : 0.00 0 0
1.49/1.59 c coefdiving : 0.00 0 0
1.49/1.59 c pscostdiving : 0.00 0 0
1.49/1.59 c fracdiving : 0.00 0 0
1.49/1.59 c veclendiving : 0.00 0 0
1.49/1.59 c intdiving : 0.00 0 0
1.49/1.59 c actconsdiving : 0.00 0 0
1.49/1.59 c objpscostdiving : 0.00 0 0
1.49/1.59 c rootsoldiving : 0.00 0 0
1.49/1.59 c linesearchdiving : 0.00 0 0
1.49/1.59 c guideddiving : 0.00 0 0
1.49/1.59 c octane : 0.00 0 0
1.49/1.59 c rens : 0.00 0 0
1.49/1.59 c rins : 0.00 0 0
1.49/1.59 c localbranching : 0.00 0 0
1.49/1.59 c mutation : 0.00 0 0
1.49/1.59 c dins : 0.00 0 0
1.49/1.59 c undercover : 0.00 0 0
1.49/1.59 c nlp : 0.00 0 0
1.49/1.59 c trysol : 0.00 0 0
1.49/1.59 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.59 c primal LP : 0.01 0 0 0.00 0.00
1.49/1.59 c dual LP : 0.07 13 523 40.23 7471.43
1.49/1.59 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.59 c barrier LP : 0.00 0 0 0.00 -
1.49/1.59 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.59 c strong branching : 0.13 28 2554 91.21 19646.15
1.49/1.59 c (at root node) : - 28 2554 91.21 -
1.49/1.59 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.59 c B&B Tree :
1.49/1.59 c number of runs : 1
1.49/1.59 c nodes : 7693
1.49/1.59 c nodes (total) : 7693
1.49/1.59 c nodes left : 0
1.49/1.59 c max depth : 38
1.49/1.59 c max depth (total): 38
1.49/1.59 c backtracks : 1387 (18.0%)
1.49/1.59 c delayed cutoffs : 1222
1.49/1.59 c repropagations : 11337 (14567 domain reductions, 1140 cutoffs)
1.49/1.59 c avg switch length: 4.02
1.49/1.59 c switching time : 0.13
1.49/1.59 c Solution :
1.49/1.59 c Solutions found : 8 (7 improvements)
1.49/1.59 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
1.49/1.59 c Primal Bound : -1.20000000000000e+01 (in run 1, after 1800 nodes, 0.69 seconds, depth 17, found by <relaxation>)
1.49/1.59 c Dual Bound : -1.20000000000000e+01
1.49/1.59 c Gap : 0.00 %
1.49/1.59 c Root Dual Bound : -1.50000000000000e+01
1.49/1.59 c Root Iterations : 523
1.59/1.60 c Time complete: 1.6.