0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452314-1307106809.opb>
0.00/0.00 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 733 del vars, 50 del conss, 0 add conss, 733 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2932 impls, 0 clqs
0.00/0.04 c (round 2) 733 del vars, 50 del conss, 0 add conss, 733 chg bounds, 0 chg sides, 0 chg coeffs, 733 upgd conss, 4398 impls, 0 clqs
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 733 deleted vars, 50 deleted constraints, 0 added constraints, 733 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 4398 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 733 constraints
0.00/0.04 c 733 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.04
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.4
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 = 1800
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 = 13950
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 # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
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.05 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.05 c t 0.0s| 1 | 0 | 51 | - |1724k| 0 | 50 | 50 | 733 | 50 | 733 | 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 | 51 | - |1725k| 0 | 50 | 50 | 733 | 50 | 733 | 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 | 51 | - |1726k| 0 | 50 | 50 | 733 | 50 | 733 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.05 c 0.1s| 1 | 0 | 90 | - |1733k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-2.000000e+00 | 88.57%
0.00/0.05 o -5
0.00/0.05 c b 0.1s| 1 | 0 | 90 | - |1734k| 0 | 35 | 50 | 733 | 50 | 738 | 5 | 0 | 0 |-1.750000e+01 |-5.000000e+00 | 71.43%
0.00/0.07 c 0.1s| 1 | 0 | 170 | - |1742k| 0 | 24 | 50 | 733 | 50 | 746 | 13 | 0 | 0 |-1.200000e+01 |-5.000000e+00 | 58.33%
0.00/0.08 c 0.1s| 1 | 0 | 214 | - |1749k| 0 | 23 | 50 | 733 | 50 | 753 | 20 | 0 | 0 |-1.150000e+01 |-5.000000e+00 | 56.52%
0.09/0.10 c 0.1s| 1 | 0 | 272 | - |1755k| 0 | 21 | 50 | 733 | 50 | 761 | 28 | 0 | 0 |-1.050000e+01 |-5.000000e+00 | 52.38%
0.09/0.11 c 0.1s| 1 | 0 | 318 | - |1763k| 0 | 32 | 50 | 733 | 50 | 768 | 35 | 0 | 0 |-9.826087e+00 |-5.000000e+00 | 49.12%
0.09/0.15 c 0.1s| 1 | 0 | 391 | - |1880k| 0 | 31 | 50 | 733 | 50 | 774 | 41 | 0 | 0 |-8.857143e+00 |-5.000000e+00 | 43.55%
0.09/0.18 c 0.2s| 1 | 0 | 415 | - |2007k| 0 | 33 | 50 | 733 | 50 | 782 | 49 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.19/0.21 c 0.2s| 1 | 0 | 440 | - |2613k| 0 | 35 | 50 | 733 | 50 | 789 | 56 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.19/0.25 c 0.3s| 1 | 0 | 469 | - |3154k| 0 | 38 | 50 | 733 | 50 | 797 | 64 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.19/0.29 c 0.3s| 1 | 0 | 498 | - |3674k| 0 | 38 | 50 | 733 | 50 | 806 | 73 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.29/0.33 c 0.3s| 1 | 0 | 522 | - |4297k| 0 | 41 | 50 | 733 | 50 | 118 | 78 | 0 | 0 |-8.000000e+00 |-5.000000e+00 | 37.50%
0.29/0.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.3s| 1 | 0 | 600 | - |4472k| 0 | 35 | 50 | 733 | 50 | 126 | 86 | 0 | 0 |-7.898773e+00 |-5.000000e+00 | 36.70%
0.29/0.34 c 0.3s| 1 | 0 | 615 | - |4757k| 0 | 42 | 50 | 733 | 50 | 134 | 94 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.35 c 0.4s| 1 | 0 | 635 | - |4965k| 0 | 42 | 50 | 733 | 50 | 144 | 104 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.36 c 0.4s| 1 | 0 | 648 | - |5177k| 0 | 47 | 50 | 733 | 50 | 150 | 110 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.37 c 0.4s| 1 | 0 | 668 | - |5304k| 0 | 49 | 50 | 733 | 50 | 155 | 115 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.38 c 0.4s| 1 | 0 | 690 | - |5420k| 0 | 47 | 50 | 733 | 50 | 103 | 122 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.29/0.38 c 0.4s| 1 | 0 | 706 | - |5510k| 0 | 45 | 50 | 733 | 50 | 111 | 130 | 0 | 0 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.52 c 0.5s| 1 | 0 | 731 | - |5506k| 0 | 39 | 50 | 733 | 50 | 111 | 130 | 0 | 35 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.53 c 0.5s| 1 | 0 | 774 | - |5586k| 0 | 44 | 50 | 733 | 50 | 117 | 136 | 0 | 35 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.58 c 0.6s| 1 | 0 | 794 | - |5581k| 0 | 41 | 50 | 733 | 50 | 117 | 136 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.59 c 0.6s| 1 | 0 | 820 | - |5628k| 0 | 41 | 50 | 733 | 50 | 123 | 142 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.59 c 0.6s| 1 | 2 | 820 | - |5628k| 0 | 41 | 50 | 733 | 50 | 123 | 142 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.59 c (run 1, node 1) restarting after 9 global fixings of integer variables
0.49/0.59 c
0.49/0.59 c (restart) converted 41 cuts from the global cut pool into linear constraints
0.49/0.59 c
0.49/0.59 c presolving:
0.49/0.59 c (round 1) 9 del vars, 277 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 41 upgd conss, 4398 impls, 38 clqs
0.49/0.59 c presolving (2 rounds):
0.49/0.59 c 9 deleted vars, 277 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.49/0.59 c 4398 implications, 38 cliques
0.49/0.59 c presolved problem has 41 variables (41 bin, 0 int, 0 impl, 0 cont) and 497 constraints
0.49/0.59 c 3 constraints of type <knapsack>
0.49/0.59 c 38 constraints of type <setppc>
0.49/0.59 c 456 constraints of type <logicor>
0.49/0.59 c transformed objective value is always integral (scale: 1)
0.49/0.59 c Presolving Time: 0.04
0.49/0.59 c
0.59/0.60 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.60 c 0.6s| 1 | 0 | 917 | - |1576k| 0 | 24 | 41 | 497 | 41 | 497 | 0 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.59/0.60 o -5
0.59/0.60 c s 0.6s| 1 | 0 | 917 | - |1576k| 0 | 24 | 41 | 497 | 41 | 497 | 0 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.59/0.62 c 0.6s| 1 | 0 | 942 | - |1737k| 0 | 30 | 41 | 497 | 41 | 501 | 4 | 0 | 50 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.59/0.62 o -6
0.59/0.62 c b 0.6s| 1 | 0 | 942 | - |1739k| 0 | 30 | 41 | 497 | 41 | 501 | 4 | 0 | 50 |-7.000000e+00 |-6.000000e+00 | 14.29%
0.59/0.63 c 0.6s| 1 | 0 | 970 | - |1734k| 0 | 29 | 41 | 497 | 41 | 501 | 4 | 0 | 55 |-7.000000e+00 |-6.000000e+00 | 14.29%
0.59/0.64 c 0.6s| 1 | 0 | 970 | - |1729k| 0 | - | 41 | 497 | 41 | 501 | 4 | 0 | 60 |-7.000000e+00 |-6.000000e+00 | 14.29%
0.59/0.64 c (run 2, node 1) restarting after 10 global fixings of integer variables
0.59/0.64 c
0.59/0.64 c (restart) converted 4 cuts from the global cut pool into linear constraints
0.59/0.64 c
0.59/0.64 c presolving:
0.59/0.64 c (round 1) 10 del vars, 221 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 4 upgd conss, 4398 impls, 37 clqs
0.59/0.64 c (round 2) 10 del vars, 222 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 10 chg coeffs, 4 upgd conss, 4398 impls, 37 clqs
0.59/0.64 c (round 3) 10 del vars, 222 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 13 chg coeffs, 4 upgd conss, 4398 impls, 37 clqs
0.59/0.64 c (round 4) 10 del vars, 222 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 14 chg coeffs, 4 upgd conss, 4398 impls, 37 clqs
0.59/0.64 c presolving (5 rounds):
0.59/0.64 c 10 deleted vars, 222 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 14 changed coefficients
0.59/0.64 c 4398 implications, 37 cliques
0.59/0.64 c presolved problem has 31 variables (31 bin, 0 int, 0 impl, 0 cont) and 279 constraints
0.59/0.64 c 4 constraints of type <knapsack>
0.59/0.64 c 33 constraints of type <setppc>
0.59/0.64 c 242 constraints of type <logicor>
0.59/0.64 c transformed objective value is always integral (scale: 1)
0.59/0.64 c Presolving Time: 0.05
0.59/0.64 c
0.59/0.64 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.64 c 0.6s| 1 | 0 | 1062 | - |1405k| 0 | - | 31 | 279 | 31 | 279 | 0 | 0 | 60 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.59/0.64 c 0.6s| 1 | 0 | 1062 | - |1405k| 0 | - | 31 | 279 | 31 | 279 | 0 | 0 | 60 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.59/0.64 c
0.59/0.64 c SCIP Status : problem is solved [optimal solution found]
0.59/0.64 c Solving Time (sec) : 0.64
0.59/0.64 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.59/0.64 c Primal Bound : -6.00000000000000e+00 (8 solutions)
0.59/0.64 c Dual Bound : -6.00000000000000e+00
0.59/0.64 c Gap : 0.00 %
0.59/0.64 s OPTIMUM FOUND
0.59/0.64 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
0.59/0.64 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.59/0.64 c SCIP Status : problem is solved [optimal solution found]
0.59/0.64 c Total Time : 0.64
0.59/0.64 c solving : 0.64
0.59/0.64 c presolving : 0.05 (included in solving)
0.59/0.64 c reading : 0.00 (included in solving)
0.59/0.64 c Original Problem :
0.59/0.64 c Problem name : HOME/instance-3452314-1307106809.opb
0.59/0.64 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.64 c Constraints : 50 initial, 50 maximal
0.59/0.64 c Presolved Problem :
0.59/0.64 c Problem name : t_HOME/instance-3452314-1307106809.opb
0.59/0.64 c Variables : 31 (31 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.64 c Constraints : 279 initial, 279 maximal
0.59/0.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.59/0.64 c trivial : 0.00 19 0 0 0 0 0 0 0 0
0.59/0.64 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.64 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.64 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.64 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.59/0.64 c knapsack : 0.00 0 0 0 0 0 0 0 0 14
0.59/0.64 c setppc : 0.00 0 0 0 0 0 8 0 0 0
0.59/0.64 c and : 0.02 0 0 0 0 0 0 0 0 0
0.59/0.64 c linear : 0.00 733 0 0 733 0 50 0 0 0
0.59/0.64 c logicor : 0.01 0 0 0 0 0 491 0 0 0
0.59/0.64 c root node : - 19 - - 19 - - - - -
0.59/0.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.59/0.64 c integral : 0 0 0 5 0 14 0 0 19 0 0 2
0.59/0.64 c knapsack : 4 1 3 0 0 0 0 0 0 0 0 0
0.59/0.64 c setppc : 33 1 3 0 0 0 0 0 0 0 0 0
0.59/0.64 c logicor : 242 21 53 0 0 9 0 0 0 0 0 0
0.59/0.64 c countsols : 0 0 0 0 0 10 0 0 0 0 0 0
0.59/0.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.59/0.64 c integral : 0.20 0.00 0.00 0.20 0.00 0.00 0.00
0.59/0.64 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.59/0.64 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.59/0.64 c vbounds : 0 0 0 0
0.59/0.64 c rootredcost : 0 0 0 0
0.59/0.64 c pseudoobj : 17 0 0 0
0.59/0.64 c Propagator Timings : TotalTime Propagate Resprop
0.59/0.64 c vbounds : 0.00 0.00 0.00
0.59/0.64 c rootredcost : 0.00 0.00 0.00
0.59/0.64 c pseudoobj : 0.00 0.00 0.00
0.59/0.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.64 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.64 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.64 c applied globally : - - - 0 0.0 - - -
0.59/0.64 c applied locally : - - - 0 0.0 - - -
0.59/0.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.64 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.59/0.64 c redcost : 0.00 21 0 0 0 0
0.59/0.64 c impliedbounds : 0.00 21 0 0 0 0
0.59/0.64 c intobj : 0.00 0 0 0 0 0
0.59/0.64 c gomory : 0.15 21 0 0 3731 0
0.59/0.64 c cgmip : 0.00 0 0 0 0 0
0.59/0.64 c closecuts : 0.00 0 0 0 0 0
0.59/0.64 c strongcg : 0.13 21 0 0 5705 0
0.59/0.64 c cmir : 0.01 11 0 0 0 0
0.59/0.64 c flowcover : 0.02 11 0 0 0 0
0.59/0.64 c clique : 0.01 21 0 0 185 0
0.59/0.64 c zerohalf : 0.00 0 0 0 0 0
0.59/0.64 c mcf : 0.00 2 0 0 0 0
0.59/0.64 c oddcycle : 0.00 0 0 0 0 0
0.59/0.64 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.64 c Pricers : Time Calls Vars
0.59/0.64 c problem variables: 0.00 0 0
0.59/0.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.64 c relpscost : 0.20 5 0 19 0 0 2
0.59/0.64 c pscost : 0.00 0 0 0 0 0 0
0.59/0.64 c inference : 0.00 0 0 0 0 0 0
0.59/0.64 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.64 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.64 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.64 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.64 c random : 0.00 0 0 0 0 0 0
0.59/0.64 c Primal Heuristics : Time Calls Found
0.59/0.64 c LP solutions : 0.00 - 0
0.59/0.64 c pseudo solutions : 0.00 - 0
0.59/0.64 c oneopt : 0.00 4 2
0.59/0.64 c trivial : 0.00 2 1
0.59/0.64 c shiftandpropagate: 0.00 0 0
0.59/0.64 c simplerounding : 0.00 26 0
0.59/0.64 c zirounding : 0.00 1 1
0.59/0.64 c rounding : 0.00 26 1
0.59/0.64 c shifting : 0.00 26 3
0.59/0.64 c intshifting : 0.00 0 0
0.59/0.64 c twoopt : 0.00 0 0
0.59/0.64 c fixandinfer : 0.00 0 0
0.59/0.64 c feaspump : 0.00 0 0
0.59/0.64 c clique : 0.00 0 0
0.59/0.64 c coefdiving : 0.00 0 0
0.59/0.64 c pscostdiving : 0.00 0 0
0.59/0.64 c fracdiving : 0.00 0 0
0.59/0.64 c veclendiving : 0.00 0 0
0.59/0.64 c intdiving : 0.00 0 0
0.59/0.64 c actconsdiving : 0.00 0 0
0.59/0.64 c objpscostdiving : 0.00 0 0
0.59/0.64 c rootsoldiving : 0.00 0 0
0.59/0.64 c linesearchdiving : 0.00 0 0
0.59/0.64 c guideddiving : 0.00 0 0
0.59/0.64 c octane : 0.00 0 0
0.59/0.64 c rens : 0.00 0 0
0.59/0.64 c rins : 0.00 0 0
0.59/0.64 c localbranching : 0.00 0 0
0.59/0.64 c mutation : 0.00 0 0
0.59/0.64 c crossover : 0.00 0 0
0.59/0.64 c dins : 0.00 0 0
0.59/0.64 c vbounds : 0.00 0 0
0.59/0.64 c undercover : 0.00 0 0
0.59/0.64 c subnlp : 0.00 0 0
0.59/0.64 c trysol : 0.00 0 0
0.59/0.64 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.64 c primal LP : 0.00 0 0 0.00 -
0.59/0.64 c dual LP : 0.04 27 1062 39.33 27678.59
0.59/0.64 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.64 c barrier LP : 0.00 0 0 0.00 -
0.59/0.64 c diving/probing LP: 0.00 0 0 0.00 -
0.59/0.64 c strong branching : 0.20 60 6860 114.33 33935.53
0.59/0.64 c (at root node) : - 60 6860 114.33 -
0.59/0.64 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.64 c B&B Tree :
0.59/0.64 c number of runs : 3
0.59/0.64 c nodes : 1
0.59/0.64 c nodes (total) : 3
0.59/0.64 c nodes left : 0
0.59/0.64 c max depth : 0
0.59/0.64 c max depth (total): 0
0.59/0.64 c backtracks : 0 (0.0%)
0.59/0.64 c delayed cutoffs : 0
0.59/0.64 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.59/0.64 c avg switch length: 2.00
0.59/0.64 c switching time : 0.00
0.59/0.64 c Solution :
0.59/0.64 c Solutions found : 8 (6 improvements)
0.59/0.64 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.59/0.64 c Primal Bound : -6.00000000000000e+00 (in run 2, after 1 nodes, 0.62 seconds, depth 0, found by <oneopt>)
0.59/0.64 c Dual Bound : -6.00000000000000e+00
0.59/0.64 c Gap : 0.00 %
0.59/0.64 c Root Dual Bound : -6.00000000000000e+00
0.59/0.64 c Root Iterations : 1062
0.59/0.65 c Time complete: 0.64.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3452314-1307106809/watcher-3452314-1307106809 -o /tmp/evaluation-result-3452314-1307106809/solver-3452314-1307106809 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452314-1307106809.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=17008 CPUtime=0.01 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 3267 0 0 0 1 0 0 0 25 0 1 0 803096414 17416192 2962 33554432000 4194304 9128323 140737353714768 18446744073709551615 18446744073699065939 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 4252 2962 498 1205 0 3043 0
[startup+0.0904861 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=20628 CPUtime=0.08 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 4303 0 0 0 8 0 0 0 25 0 1 0 803096414 21123072 3995 33554432000 4194304 9128323 140737353714768 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 5157 3995 666 1205 0 3948 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 20628
[startup+0.100471 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=20628 CPUtime=0.09 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 4315 0 0 0 9 0 0 0 25 0 1 0 803096414 21123072 4007 33554432000 4194304 9128323 140737353714768 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 5157 4007 666 1205 0 3948 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20628
[startup+0.300437 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=25220 CPUtime=0.29 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 5465 0 0 0 28 1 0 0 25 0 1 0 803096414 25825280 5151 33554432000 4194304 9128323 140737353714768 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 6305 5151 672 1205 0 5096 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25220
Solver just ended. Dumping a history of the last processes samples
[startup+0.500399 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=25164 CPUtime=0.49 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 6391 0 0 0 45 4 0 0 25 0 1 0 803096414 25767936 5234 33554432000 4194304 9128323 140737353714768 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 6291 5234 691 1205 0 5082 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 25164
[startup+0.600382 s]
/proc/loadavg: 1.92 2.00 1.99 2/521 23785
/proc/meminfo: memFree=21404152/32951124 swapFree=58800704/67111528
[pid=23785] ppid=23783 vsize=27744 CPUtime=0.59 cores=1,3,5,7
/proc/23785/stat : 23785 (scip-2.0.1.4.li) R 23783 23785 22695 0 -1 4202496 6986 0 0 0 53 6 0 0 25 0 1 0 803096414 28409856 5829 33554432000 4194304 9128323 140737353714768 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/23785/statm: 6936 5829 717 1205 0 5727 0
Current children cumulated CPU time (s) 0.59
Current children cumulated vsize (KiB) 27744
Child status: 0
Real time (s): 0.65245
CPU time (s): 0.652899
CPU user time (s): 0.578911
CPU system time (s): 0.073988
CPU usage (%): 100.069
Max. virtual memory (cumulated for all children) (KiB): 27744
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.578911
system time used= 0.073988
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7205
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 4
involuntary context switches= 2
runsolver used 0.010998 second user time and 0.010998 second system time
The end