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-2703254-1278569369.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.02/0.02 o 0
0.02/0.02 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.02/0.02 c presolving:
0.02/0.09 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.09/0.11 c presolving (2 rounds):
0.09/0.11 c 732 deleted vars, 50 deleted constraints, 732 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 4392 implications, 0 cliques
0.09/0.11 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 732 constraints
0.09/0.11 c 732 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.3
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1789.99
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = 0
0.09/0.11 c
0.09/0.11 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.09/0.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c t 0.1s| 1 | 0 | 51 | - |2175k| 0 | 50 | 50 | 732 | 50 | 732 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.09/0.12 o -1
0.09/0.12 c R 0.1s| 1 | 0 | 51 | - |2176k| 0 | 50 | 50 | 732 | 50 | 732 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.09/0.14 c 0.1s| 1 | 0 | 87 | - |2183k| 0 | 39 | 50 | 732 | 50 | 736 | 4 | 0 | 0 |-1.950000e+01 |-1.000000e+00 | 94.87%
0.09/0.14 o -5
0.09/0.14 c b 0.1s| 1 | 0 | 87 | - |2185k| 0 | 39 | 50 | 732 | 50 | 736 | 4 | 0 | 0 |-1.950000e+01 |-5.000000e+00 | 74.36%
0.09/0.18 c 0.2s| 1 | 0 | 167 | - |2191k| 0 | 26 | 50 | 732 | 50 | 745 | 13 | 0 | 0 |-1.300000e+01 |-5.000000e+00 | 61.54%
0.19/0.22 c 0.2s| 1 | 0 | 229 | - |2195k| 0 | 26 | 50 | 732 | 50 | 750 | 18 | 0 | 0 |-1.100000e+01 |-5.000000e+00 | 54.55%
0.19/0.27 c 0.3s| 1 | 0 | 277 | - |2205k| 0 | 26 | 50 | 732 | 50 | 754 | 22 | 0 | 0 |-1.033333e+01 |-5.000000e+00 | 51.61%
0.29/0.33 c 0.3s| 1 | 0 | 340 | - |2216k| 0 | 29 | 50 | 732 | 50 | 764 | 32 | 0 | 0 |-9.777778e+00 |-5.000000e+00 | 48.86%
0.39/0.41 c 0.4s| 1 | 0 | 399 | - |2328k| 0 | 27 | 50 | 732 | 50 | 772 | 40 | 0 | 0 |-8.875000e+00 |-5.000000e+00 | 43.66%
0.39/0.48 c 0.5s| 1 | 0 | 460 | - |2417k| 0 | 33 | 50 | 732 | 50 | 782 | 50 | 0 | 0 |-8.397260e+00 |-5.000000e+00 | 40.46%
0.49/0.59 c 0.6s| 1 | 0 | 518 | - |2760k| 0 | 32 | 50 | 732 | 50 | 794 | 62 | 0 | 0 |-8.069149e+00 |-5.000000e+00 | 38.04%
0.59/0.68 c 0.7s| 1 | 0 | 569 | - |3049k| 0 | 32 | 50 | 732 | 50 | 800 | 68 | 0 | 0 |-7.681185e+00 |-5.000000e+00 | 34.91%
0.79/0.80 c 0.8s| 1 | 0 | 604 | - |3506k| 0 | 34 | 50 | 732 | 50 | 806 | 74 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.90 c 0.9s| 1 | 0 | 623 | - |3862k| 0 | 40 | 50 | 732 | 50 | 131 | 83 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.92 c 0.9s| 1 | 0 | 647 | - |3941k| 0 | 41 | 50 | 732 | 50 | 137 | 89 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.93 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.93 c 0.9s| 1 | 0 | 673 | - |3984k| 0 | 42 | 50 | 732 | 50 | 145 | 97 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.95 c 0.9s| 1 | 0 | 699 | - |4038k| 0 | 45 | 50 | 732 | 50 | 152 | 104 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.89/0.97 c 1.0s| 1 | 0 | 744 | - |4056k| 0 | 45 | 50 | 732 | 50 | 156 | 108 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.54 c 1.5s| 1 | 0 | 766 | - |4054k| 0 | 43 | 50 | 732 | 50 | 156 | 108 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.55 c 1.5s| 1 | 0 | 799 | - |4068k| 0 | 41 | 50 | 732 | 50 | 107 | 113 | 0 | 45 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.59 c 1.6s| 1 | 2 | 799 | - |4068k| 0 | 41 | 50 | 732 | 50 | 107 | 113 | 0 | 48 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.49/1.59 c (run 1, node 1) restarting after 3 global fixings of integer variables
1.49/1.59 c
1.49/1.59 c (restart) converted 42 cuts from the global cut pool into linear constraints
1.49/1.59 c
1.49/1.59 c presolving:
1.49/1.59 c (round 1) 3 del vars, 94 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 4392 impls, 38 clqs
1.59/1.60 c (round 2) 3 del vars, 94 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 41 upgd conss, 4392 impls, 38 clqs
1.59/1.60 c (round 3) 3 del vars, 94 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 41 upgd conss, 4392 impls, 38 clqs
1.59/1.61 c presolving (4 rounds):
1.59/1.61 c 3 deleted vars, 94 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 1 changed coefficients
1.59/1.61 c 4392 implications, 38 cliques
1.59/1.61 c presolved problem has 47 variables (47 bin, 0 int, 0 impl, 0 cont) and 680 constraints
1.59/1.61 c 4 constraints of type <knapsack>
1.59/1.61 c 37 constraints of type <setppc>
1.59/1.61 c 639 constraints of type <logicor>
1.59/1.61 c transformed objective value is always integral (scale: 1)
1.59/1.61 c Presolving Time: 0.10
1.59/1.61 c
1.59/1.61 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.61 c 1.6s| 1 | 0 | 877 | - |2184k| 0 | 19 | 47 | 680 | 47 | 680 | 0 | 0 | 48 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.59/1.67 c 1.7s| 1 | 0 | 914 | - |2253k| 0 | 32 | 47 | 680 | 47 | 685 | 5 | 0 | 48 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.99/2.02 c 2.0s| 1 | 0 | 925 | - |2251k| 0 | 29 | 47 | 680 | 47 | 685 | 5 | 0 | 80 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.99/2.05 c 2.0s| 1 | 2 | 925 | - |2252k| 0 | 29 | 47 | 680 | 47 | 685 | 5 | 0 | 83 |-7.000000e+00 |-5.000000e+00 | 28.57%
1.99/2.05 o -6
1.99/2.05 c * 2.0s| 11 | 3 | 925 | 0.0 |2257k| 7 | - | 47 | 681 | 0 | 0 | 5 | 1 | 83 |-7.000000e+00 |-6.000000e+00 | 14.29%
2.10/2.13 c
2.10/2.13 c SCIP Status : problem is solved [optimal solution found]
2.10/2.13 c Solving Time (sec) : 2.11
2.10/2.13 c Solving Nodes : 449 (total of 450 nodes in 2 runs)
2.10/2.13 c Primal Bound : -6.00000000000000e+00 (10 solutions)
2.10/2.13 c Dual Bound : -6.00000000000000e+00
2.10/2.13 c Gap : 0.00 %
2.10/2.13 s OPTIMUM FOUND
2.10/2.13 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
2.10/2.13 v -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.10/2.13 c SCIP Status : problem is solved [optimal solution found]
2.10/2.13 c Solving Time : 2.11
2.10/2.13 c Original Problem :
2.10/2.13 c Problem name : HOME/instance-2703254-1278569369.opb
2.10/2.13 c Variables : 782 (782 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.13 c Constraints : 782 initial, 782 maximal
2.10/2.13 c Presolved Problem :
2.10/2.13 c Problem name : t_HOME/instance-2703254-1278569369.opb
2.10/2.13 c Variables : 47 (47 binary, 0 integer, 0 implicit integer, 0 continuous)
2.10/2.13 c Constraints : 680 initial, 681 maximal
2.10/2.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.10/2.13 c trivial : 0.00 3 0 0 0 0 0 0 0
2.10/2.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.10/2.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.10/2.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.10/2.13 c implics : 0.00 0 0 0 0 0 0 0 0
2.10/2.13 c probing : 0.01 0 0 0 0 0 0 0 0
2.10/2.13 c knapsack : 0.00 0 0 0 0 0 0 0 1
2.10/2.13 c setppc : 0.00 0 0 0 0 0 0 0 0
2.10/2.13 c linear : 0.01 732 0 0 732 0 51 1 0
2.10/2.13 c logicor : 0.02 0 0 0 0 0 93 0 0
2.10/2.13 c root node : - 50 - - 50 - - - -
2.10/2.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.10/2.13 c integral : 0 0 0 4 0 0 6 0 0 4
2.10/2.13 c knapsack : 4 1 2013 0 0 26 0 0 0 0
2.10/2.13 c setppc : 37 1 1984 0 0 70 1056 0 0 0
2.10/2.13 c logicor : 639+ 17 606 0 1 0 743 0 0 0
2.10/2.13 c countsols : 0 0 0 0 1 0 0 0 0 0
2.10/2.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.10/2.13 c integral : 0.95 0.00 0.00 0.95 0.00
2.10/2.13 c knapsack : 0.02 0.00 0.02 0.00 0.00
2.10/2.13 c setppc : 0.00 0.00 0.00 0.00 0.00
2.10/2.13 c logicor : 0.01 0.00 0.01 0.00 0.00
2.10/2.13 c countsols : 0.00 0.00 0.00 0.00 0.00
2.10/2.13 c Propagators : Time Calls Cutoffs DomReds
2.10/2.13 c vbounds : 0.00 3 0 0
2.10/2.13 c rootredcost : 0.00 1 0 1
2.10/2.13 c pseudoobj : 0.01 2183 156 509
2.10/2.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.10/2.13 c propagation : 0.00 252 240 240 2.1 0 0.0 -
2.10/2.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.10/2.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.10/2.13 c applied globally : - - - 240 2.1 - - -
2.10/2.13 c applied locally : - - - 0 0.0 - - -
2.10/2.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.10/2.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 52)
2.10/2.13 c redcost : 0.00 17 0 0 0 0
2.10/2.13 c impliedbounds : 0.00 17 0 0 0 0
2.10/2.13 c intobj : 0.00 0 0 0 0 0
2.10/2.13 c cgmip : 0.00 0 0 0 0 0
2.10/2.13 c gomory : 0.38 17 0 0 4686 0
2.10/2.13 c strongcg : 0.31 17 0 0 5054 0
2.10/2.13 c cmir : 0.03 11 0 0 0 0
2.10/2.13 c flowcover : 0.04 11 0 0 0 0
2.10/2.13 c clique : 0.01 17 0 0 149 0
2.10/2.13 c zerohalf : 0.00 0 0 0 0 0
2.10/2.13 c mcf : 0.00 2 0 0 0 0
2.10/2.13 c rapidlearning : 0.00 0 0 0 0 0
2.10/2.13 c Pricers : Time Calls Vars
2.10/2.13 c problem variables: 0.00 0 0
2.10/2.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.10/2.13 c relpscost : 0.95 4 0 6 0 0 4
2.10/2.13 c pscost : 0.00 0 0 0 0 0 0
2.10/2.13 c inference : 0.00 253 0 0 0 0 506
2.10/2.13 c mostinf : 0.00 0 0 0 0 0 0
2.10/2.13 c leastinf : 0.00 0 0 0 0 0 0
2.10/2.13 c fullstrong : 0.00 0 0 0 0 0 0
2.10/2.13 c allfullstrong : 0.00 0 0 0 0 0 0
2.10/2.13 c random : 0.00 0 0 0 0 0 0
2.10/2.13 c Primal Heuristics : Time Calls Found
2.10/2.13 c LP solutions : 0.00 - 0
2.10/2.13 c pseudo solutions : 0.00 - 1
2.10/2.13 c crossover : 0.00 0 0
2.10/2.13 c oneopt : 0.00 2 1
2.10/2.13 c trivial : 0.00 2 2
2.10/2.13 c simplerounding : 0.00 21 1
2.10/2.13 c zirounding : 0.00 2 2
2.10/2.13 c rounding : 0.01 21 1
2.10/2.13 c shifting : 0.00 21 2
2.10/2.13 c intshifting : 0.00 0 0
2.10/2.13 c twoopt : 0.00 0 0
2.10/2.13 c fixandinfer : 0.00 0 0
2.10/2.13 c feaspump : 0.00 0 0
2.10/2.13 c coefdiving : 0.00 0 0
2.10/2.13 c pscostdiving : 0.00 0 0
2.10/2.13 c fracdiving : 0.00 0 0
2.10/2.13 c veclendiving : 0.00 0 0
2.10/2.13 c intdiving : 0.00 0 0
2.10/2.13 c actconsdiving : 0.00 0 0
2.10/2.13 c objpscostdiving : 0.00 0 0
2.10/2.13 c rootsoldiving : 0.00 0 0
2.10/2.13 c linesearchdiving : 0.00 0 0
2.10/2.13 c guideddiving : 0.00 0 0
2.10/2.13 c octane : 0.00 0 0
2.10/2.13 c rens : 0.01 0 0
2.10/2.13 c rins : 0.00 0 0
2.10/2.13 c localbranching : 0.00 0 0
2.10/2.13 c mutation : 0.00 0 0
2.10/2.13 c dins : 0.00 0 0
2.10/2.13 c undercover : 0.00 0 0
2.10/2.13 c nlp : 0.00 0 0
2.10/2.13 c trysol : 0.00 0 0
2.10/2.13 c LP : Time Calls Iterations Iter/call Iter/sec
2.10/2.13 c primal LP : 0.00 0 0 0.00 -
2.10/2.13 c dual LP : 0.11 21 925 44.05 8259.37
2.10/2.13 c lex dual LP : 0.00 0 0 0.00 -
2.10/2.13 c barrier LP : 0.00 0 0 0.00 -
2.10/2.13 c diving/probing LP: 0.00 0 0 0.00 -
2.10/2.13 c strong branching : 0.95 83 8608 103.71 9042.44
2.10/2.13 c (at root node) : - 83 8608 103.71 -
2.10/2.13 c conflict analysis: 0.00 0 0 0.00 -
2.10/2.13 c B&B Tree :
2.10/2.13 c number of runs : 2
2.10/2.13 c nodes : 449
2.10/2.13 c nodes (total) : 450
2.10/2.13 c nodes left : 0
2.10/2.13 c max depth : 36
2.10/2.13 c max depth (total): 36
2.10/2.13 c backtracks : 60 (13.4%)
2.10/2.13 c delayed cutoffs : 59
2.10/2.13 c repropagations : 1225 (558 domain reductions, 58 cutoffs)
2.10/2.13 c avg switch length: 6.41
2.10/2.13 c switching time : 0.01
2.10/2.13 c Solution :
2.10/2.13 c Solutions found : 10 (4 improvements)
2.10/2.13 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
2.10/2.13 c Primal Bound : -6.00000000000000e+00 (in run 2, after 11 nodes, 2.04 seconds, depth 7, found by <relaxation>)
2.10/2.13 c Dual Bound : -6.00000000000000e+00
2.10/2.13 c Gap : 0.00 %
2.10/2.13 c Root Dual Bound : -7.00000000000000e+00
2.10/2.13 c Root Iterations : 925
2.10/2.14 c Time complete: 2.14.