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-2665261-1276662685.opb>
0.00/0.01 c original problem has 788 variables (788 bin, 0 int, 0 impl, 0 cont) and 788 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.09/0.19 c (round 1) 738 del vars, 50 del conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2952 impls, 0 clqs
0.19/0.22 c presolving (2 rounds):
0.19/0.22 c 738 deleted vars, 50 deleted constraints, 738 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.22 c 4428 implications, 0 cliques
0.19/0.22 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 738 constraints
0.19/0.22 c 738 constraints of type <logicor>
0.19/0.22 c transformed objective value is always integral (scale: 1)
0.19/0.22 c Presolving Time: 0.11
0.19/0.22 c - non default parameters ----------------------------------------------------------------------
0.19/0.22 c # SCIP version 1.2.1.2
0.19/0.22 c
0.19/0.22 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c conflict/interconss = 0
0.19/0.22 c
0.19/0.22 c # should binary conflicts be preferred?
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c conflict/preferbinary = TRUE
0.19/0.22 c
0.19/0.22 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22 c constraints/agelimit = 1
0.19/0.22 c
0.19/0.22 c # should enforcement of pseudo solution be disabled?
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/disableenfops = TRUE
0.19/0.22 c
0.19/0.22 c # frequency for displaying node information lines
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.22 c display/freq = 10000
0.19/0.22 c
0.19/0.22 c # maximal time in seconds to run
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/time = 1799.99
0.19/0.22 c
0.19/0.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/memory = 1620
0.19/0.22 c
0.19/0.22 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c lp/solvefreq = 0
0.19/0.22 c
0.19/0.22 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.22 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.22 c lp/pricing = a
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify inequalities
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/linear/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # should presolving try to simplify knapsacks
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/knapsack/simplifyinequalities = TRUE
0.19/0.22 c
0.19/0.22 c # priority of node selection rule <dfs> in standard mode
0.19/0.22 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.22 c nodeselection/dfs/stdpriority = 1000000
0.19/0.22 c
0.19/0.22 c -----------------------------------------------------------------------------------------------
0.19/0.22 c start solving
0.19/0.22 c
0.19/0.22 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.22 c t 0.1s| 1 | 0 | 51 | - |2191k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.19/0.22 o -1
0.19/0.22 c R 0.1s| 1 | 0 | 51 | - |2192k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.19/0.22 o -2
0.19/0.22 c s 0.1s| 1 | 0 | 51 | - |2192k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.19/0.25 c 0.1s| 1 | 0 | 126 | - |2198k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-2.000000e+00 | 87.88%
0.19/0.25 o -4
0.19/0.25 c b 0.1s| 1 | 0 | 126 | - |2200k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-4.000000e+00 | 75.76%
0.19/0.27 c 0.2s| 1 | 0 | 155 | - |2204k| 0 | 30 | 50 | 738 | 50 | 748 | 10 | 0 | 0 |-1.500000e+01 |-4.000000e+00 | 73.33%
0.29/0.30 c 0.2s| 1 | 0 | 190 | - |2208k| 0 | 26 | 50 | 738 | 50 | 751 | 13 | 0 | 0 |-1.300000e+01 |-4.000000e+00 | 69.23%
0.29/0.33 c 0.2s| 1 | 0 | 239 | - |2214k| 0 | 23 | 50 | 738 | 50 | 758 | 20 | 0 | 0 |-1.150000e+01 |-4.000000e+00 | 65.22%
0.29/0.36 c 0.2s| 1 | 0 | 297 | - |2220k| 0 | 22 | 50 | 738 | 50 | 764 | 26 | 0 | 0 |-1.100000e+01 |-4.000000e+00 | 63.64%
0.39/0.42 c 0.3s| 1 | 0 | 400 | - |2225k| 0 | 34 | 50 | 738 | 50 | 770 | 32 | 0 | 0 |-9.833333e+00 |-4.000000e+00 | 59.32%
0.39/0.49 c 0.4s| 1 | 0 | 440 | - |2293k| 0 | 31 | 50 | 738 | 50 | 778 | 40 | 0 | 0 |-9.352941e+00 |-4.000000e+00 | 57.23%
0.49/0.55 c 0.4s| 1 | 0 | 458 | - |2417k| 0 | 24 | 50 | 738 | 50 | 785 | 47 | 0 | 0 |-9.000000e+00 |-4.000000e+00 | 55.56%
0.59/0.62 c 0.5s| 1 | 0 | 499 | - |2515k| 0 | 33 | 50 | 738 | 50 | 789 | 51 | 0 | 0 |-8.776750e+00 |-4.000000e+00 | 54.43%
0.69/0.71 c 0.6s| 1 | 0 | 539 | - |2924k| 0 | 32 | 50 | 738 | 50 | 797 | 59 | 0 | 0 |-8.436782e+00 |-4.000000e+00 | 52.59%
0.69/0.79 c 0.7s| 1 | 0 | 619 | - |3075k| 0 | 33 | 50 | 738 | 50 | 118 | 68 | 0 | 0 |-7.916933e+00 |-4.000000e+00 | 49.48%
0.79/0.81 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.81 c 0.7s| 1 | 0 | 654 | - |3274k| 0 | 36 | 50 | 738 | 50 | 126 | 76 | 0 | 0 |-7.645746e+00 |-4.000000e+00 | 47.68%
0.79/0.82 c 0.7s| 1 | 0 | 695 | - |3399k| 0 | 39 | 50 | 738 | 50 | 135 | 85 | 0 | 0 |-7.481225e+00 |-4.000000e+00 | 46.53%
0.79/0.84 c 0.7s| 1 | 0 | 731 | - |3485k| 0 | 37 | 50 | 738 | 50 | 144 | 94 | 0 | 0 |-7.395776e+00 |-4.000000e+00 | 45.92%
0.79/0.86 c 0.7s| 1 | 0 | 769 | - |3720k| 0 | 40 | 50 | 738 | 50 | 153 | 103 | 0 | 0 |-7.234592e+00 |-4.000000e+00 | 44.71%
0.79/0.88 c 0.8s| 1 | 0 | 802 | - |3977k| 0 | 42 | 50 | 738 | 50 | 158 | 108 | 0 | 0 |-7.185369e+00 |-4.000000e+00 | 44.33%
0.89/0.91 c 0.8s| 1 | 0 | 849 | - |4198k| 0 | 45 | 50 | 738 | 50 | 122 | 116 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.93 c 0.8s| 1 | 0 | 884 | - |4380k| 0 | 46 | 50 | 738 | 50 | 130 | 124 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.95 c 0.8s| 1 | 0 | 917 | - |4576k| 0 | 47 | 50 | 738 | 50 | 139 | 133 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.97 c 0.8s| 1 | 0 | 942 | - |4788k| 0 | 47 | 50 | 738 | 50 | 146 | 140 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/0.98 c 0.8s| 1 | 0 | 970 | - |4795k| 0 | 45 | 50 | 738 | 50 | 156 | 150 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.89/1.00 c 0.8s| 1 | 0 | 1014 | - |4800k| 0 | 47 | 50 | 738 | 50 | 161 | 155 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
1.19/1.25 c 1.1s| 1 | 2 | 1014 | - |4802k| 0 | 47 | 50 | 738 | 50 | 161 | 155 | 0 | 19 |-7.000000e+00 |-4.000000e+00 | 42.86%
1.19/1.25 o -5
1.19/1.25 c * 1.1s| 7 | 3 | 1014 | 0.0 |4806k| 5 | - | 50 | 738 | 0 | 0 | 155 | 0 | 19 |-6.919146e+00 |-5.000000e+00 | 27.74%
1.19/1.27 o -6
1.19/1.27 c * 1.1s| 167 | 0 | 1014 | 0.0 |4781k| 19 | - | 50 | 694 | 0 | 0 | 155 | 44 | 19 |-6.000000e+00 |-6.000000e+00 | 0.00%
1.19/1.27 c
1.19/1.27 c SCIP Status : problem is solved [optimal solution found]
1.19/1.27 c Solving Time (sec) : 1.12
1.19/1.27 c Solving Nodes : 167
1.19/1.27 c Primal Bound : -6.00000000000000e+00 (8 solutions)
1.19/1.27 c Dual Bound : -6.00000000000000e+00
1.19/1.27 c Gap : 0.00 %
1.19/1.27 s OPTIMUM FOUND
1.19/1.27 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.19/1.27 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.19/1.27 c SCIP Status : problem is solved [optimal solution found]
1.19/1.27 c Solving Time : 1.12
1.19/1.27 c Original Problem :
1.19/1.27 c Problem name : HOME/instance-2665261-1276662685.opb
1.19/1.27 c Variables : 788 (788 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27 c Constraints : 788 initial, 788 maximal
1.19/1.27 c Presolved Problem :
1.19/1.27 c Problem name : t_HOME/instance-2665261-1276662685.opb
1.19/1.27 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.27 c Constraints : 738 initial, 774 maximal
1.19/1.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.19/1.28 c trivial : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c implics : 0.00 0 0 0 0 0 0 0 0
1.19/1.28 c probing : 0.01 0 0 0 0 0 0 0 0
1.19/1.28 c linear : 0.01 738 0 0 738 0 50 0 0
1.19/1.28 c logicor : 0.01 0 0 0 0 0 0 0 0
1.19/1.28 c root node : - 2 - - 2 - - - -
1.19/1.28 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.19/1.28 c integral : 0 0 0 1 0 0 0 0 0 2
1.19/1.28 c logicor : 738+ 22 304 0 2 36 591 0 0 0
1.19/1.28 c countsols : 0 0 0 0 2 0 0 0 0 0
1.19/1.28 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.19/1.28 c integral : 0.24 0.00 0.00 0.24 0.00
1.19/1.28 c logicor : 0.01 0.01 0.00 0.00 0.00
1.19/1.28 c countsols : 0.00 0.00 0.00 0.00 0.00
1.19/1.28 c Propagators : Time Calls Cutoffs DomReds
1.19/1.28 c vbounds : 0.00 2 0 0
1.19/1.28 c rootredcost : 0.00 1 0 0
1.19/1.28 c pseudoobj : 0.01 501 49 138
1.19/1.28 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.28 c propagation : 0.01 85 44 44 2.9 0 0.0 -
1.19/1.28 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.28 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.28 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.28 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.28 c applied globally : - - - 44 2.9 - - -
1.19/1.28 c applied locally : - - - 0 0.0 - - -
1.19/1.28 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.19/1.28 c cut pool : 0.00 21 - - 180 - (maximal pool size: 1623)
1.19/1.28 c redcost : 0.00 22 0 0 0 0
1.19/1.28 c impliedbounds : 0.00 22 0 0 0 0
1.19/1.28 c intobj : 0.00 0 0 0 0 0
1.19/1.28 c cgmip : 0.00 0 0 0 0 0
1.19/1.28 c gomory : 0.28 22 0 0 4502 0
1.19/1.28 c strongcg : 0.22 20 0 0 5457 0
1.19/1.28 c cmir : 0.03 10 0 0 0 0
1.19/1.28 c flowcover : 0.03 10 0 0 0 0
1.19/1.28 c clique : 0.00 22 0 0 189 0
1.19/1.28 c zerohalf : 0.00 0 0 0 0 0
1.19/1.28 c mcf : 0.01 1 0 0 0 0
1.19/1.28 c rapidlearning : 0.00 0 0 0 0 0
1.19/1.28 c Pricers : Time Calls Vars
1.19/1.28 c problem variables: 0.00 0 0
1.19/1.28 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.19/1.28 c relpscost : 0.24 1 0 0 0 0 2
1.19/1.28 c pscost : 0.00 0 0 0 0 0 0
1.19/1.28 c inference : 0.00 91 0 0 0 0 182
1.19/1.28 c mostinf : 0.00 0 0 0 0 0 0
1.19/1.28 c leastinf : 0.00 0 0 0 0 0 0
1.19/1.28 c fullstrong : 0.00 0 0 0 0 0 0
1.19/1.28 c allfullstrong : 0.00 0 0 0 0 0 0
1.19/1.28 c random : 0.00 0 0 0 0 0 0
1.19/1.28 c Primal Heuristics : Time Calls Found
1.19/1.28 c LP solutions : 0.00 - 0
1.19/1.28 c pseudo solutions : 0.00 - 2
1.19/1.28 c crossover : 0.00 0 0
1.19/1.28 c oneopt : 0.00 2 1
1.19/1.28 c trivial : 0.00 2 2
1.19/1.28 c simplerounding : 0.00 23 0
1.19/1.28 c zirounding : 0.01 1 1
1.19/1.28 c rounding : 0.00 23 1
1.19/1.28 c shifting : 0.01 23 1
1.19/1.28 c intshifting : 0.00 0 0
1.19/1.28 c twoopt : 0.00 0 0
1.19/1.28 c fixandinfer : 0.00 0 0
1.19/1.28 c feaspump : 0.00 0 0
1.19/1.28 c coefdiving : 0.00 0 0
1.19/1.28 c pscostdiving : 0.00 0 0
1.19/1.28 c fracdiving : 0.00 0 0
1.19/1.28 c veclendiving : 0.00 0 0
1.19/1.28 c intdiving : 0.00 0 0
1.19/1.28 c actconsdiving : 0.00 0 0
1.19/1.28 c objpscostdiving : 0.00 0 0
1.19/1.28 c rootsoldiving : 0.00 0 0
1.19/1.28 c linesearchdiving : 0.00 0 0
1.19/1.28 c guideddiving : 0.00 0 0
1.19/1.28 c octane : 0.00 0 0
1.19/1.28 c rens : 0.00 0 0
1.19/1.28 c rins : 0.00 0 0
1.19/1.28 c localbranching : 0.00 0 0
1.19/1.28 c mutation : 0.00 0 0
1.19/1.28 c dins : 0.00 0 0
1.19/1.28 c undercover : 0.00 0 0
1.19/1.28 c nlp : 0.00 0 0
1.19/1.28 c trysol : 0.00 0 0
1.19/1.28 c LP : Time Calls Iterations Iter/call Iter/sec
1.19/1.28 c primal LP : 0.00 0 0 0.00 -
1.19/1.28 c dual LP : 0.12 23 1014 44.09 8450.00
1.19/1.28 c lex dual LP : 0.00 0 0 0.00 -
1.19/1.28 c barrier LP : 0.00 0 0 0.00 -
1.19/1.28 c diving/probing LP: 0.00 0 0 0.00 -
1.19/1.28 c strong branching : 0.24 19 3849 202.58 16037.50
1.19/1.28 c (at root node) : - 19 3849 202.58 -
1.19/1.28 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.28 c B&B Tree :
1.19/1.28 c number of runs : 1
1.19/1.28 c nodes : 167
1.19/1.28 c nodes (total) : 167
1.19/1.28 c nodes left : 0
1.19/1.28 c max depth : 19
1.19/1.28 c max depth (total): 19
1.19/1.28 c backtracks : 24 (14.4%)
1.19/1.28 c delayed cutoffs : 13
1.19/1.28 c repropagations : 179 (93 domain reductions, 12 cutoffs)
1.19/1.28 c avg switch length: 3.62
1.19/1.28 c switching time : 0.01
1.19/1.28 c Solution :
1.19/1.28 c Solutions found : 8 (6 improvements)
1.19/1.28 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.19/1.28 c Primal Bound : -6.00000000000000e+00 (in run 1, after 167 nodes, 1.11 seconds, depth 9, found by <relaxation>)
1.19/1.28 c Dual Bound : -6.00000000000000e+00
1.19/1.28 c Gap : 0.00 %
1.19/1.28 c Root Dual Bound : -7.00000000000000e+00
1.19/1.28 c Root Iterations : 1014
1.19/1.29 c Time complete: 1.28.