| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) | SAT | 1.25581 | 1.25776 |
| Name | normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/ wnqueen/normalized-t2001.13queen13.1111219399.opb |
| MD5SUM | 1476879b9f55ab2af66e74aac1d720c1 |
| Bench Category | DEC-SMALLINT (no optimisation, small integers) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.020996 |
| Has Objective Function | NO |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | NO |
| Number of variables | 169 |
| Total number of constraints | 101 |
| Number of constraints which are clauses | 30 |
| Number of constraints which are cardinality constraints (but not clauses) | 70 |
| Number of constraints which are nor clauses,nor cardinality constraints | 1 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 169 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 38 |
| Number of bits of the biggest number in a constraint | 6 |
| Biggest sum of numbers in a constraint | 1177 |
| Number of bits of the biggest sum of numbers | 11 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.00/0.00 c SCIP version 1.1.0.7
0.00/0.00 c LP-Solver SoPlex 1.4.1
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c read problem <HOME/instance-3729461-1338679280.opb>
0.00/0.00 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c start presolving problem
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.01 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 8 implications, 68 cliques
0.00/0.01 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 68 constraints of type <setppc>
0.00/0.01 c 4 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c SATUNSAT-LIN
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/flowcover/freq = c -1
0.00/0.01 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c separating/cmir/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/veclendiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/simplerounding/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/shifting/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/rounding/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/rootsoldiving/freq = c -1
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/rens/nodesofs = c 2000
0.00/0.01 c # minimum percentage of integer variables that have to be fixable
0.00/0.01 c # [type: real, range: [0,1], default: 0.5]
0.00/0.01 c heuristics/rens/minfixingrate = c 0.3
0.00/0.01 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/rens/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/pscostdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c heuristics/oneopt/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01 c # [type: real, range: [0,1], default: 0.01]
0.00/0.01 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.01 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/objpscostdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/linesearchdiving/freq = c -1
0.00/0.01 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/intshifting/freq = c -1
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/guideddiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/fracdiving/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.01 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01 c heuristics/feaspump/freq = c -1
0.00/0.01 c # minimum percentage of integer variables that have to be fixed
0.00/0.01 c # [type: real, range: [0,1], default: 0.666]
0.00/0.01 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.01 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01 c # [type: real, range: [0,1], default: 0.1]
0.00/0.01 c heuristics/crossover/nodesquot = c 0.15
0.00/0.01 c # number of nodes without incumbent change that heuristic should wait
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.01 c # number of nodes added to the contingent of the total nodes
0.00/0.01 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01 c heuristics/crossover/nodesofs = c 750
0.00/0.01 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01 c heuristics/crossover/freq = c -1
0.00/0.01 c # additional number of allowed LP iterations
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.01 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.01 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01 c heuristics/coefdiving/freq = c -1
0.00/0.01 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c presolving/probing/maxrounds = c 0
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.01 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01 c constraints/knapsack/disaggregation = c FALSE
0.00/0.01 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/maxroundsroot = c 5
0.00/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01 c separating/maxrounds = c 1
0.00/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c limits/solutions = c 1
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = c 13950
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = c 1791
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = c 10000
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving problem
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 126 | 593k| 0 | 45 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 147 | 796k| 0 | 52 | 169 | 73 | 73 | 169 | 85 | 12 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.03 c 0.0s| 1 | 0 | 183 |1073k| 0 | 56 | 169 | 73 | 73 | 169 | 93 | 20 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 232 |1156k| 0 | 56 | 169 | 73 | 73 | 169 | 97 | 24 | 0 | 0 | 1.300000e+01 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 251 |1207k| 0 | 63 | 169 | 73 | 73 | 169 | 102 | 29 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.05 c 0.0s| 1 | 0 | 279 |1218k| 0 | 67 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.39/0.42 c 0.4s| 1 | 2 | 279 |1219k| 0 | 67 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 33 | 1.300000e+01 | -- | Inf
1.19/1.25 c * 1.2s| 14 | 0 | 1124 |1285k| 5 | - | 169 | 75 | 5 | 169 | 100 | 32 | 3 | 448 | 1.300000e+01 | 1.300000e+01 | 0.00%
1.19/1.25 c
1.19/1.25 c SCIP Status : problem is solved [optimal solution found]
1.19/1.25 c Solving Time (sec) : 1.21
1.19/1.25 c Solving Nodes : 14
1.19/1.25 c Primal Bound : +1.30000000000000e+01 (1 solutions)
1.19/1.25 c Dual Bound : +1.30000000000000e+01
1.19/1.25 c Gap : 0.00 %
1.19/1.25 c NODE 14
1.19/1.25 c DUAL BOUND 13
1.19/1.25 c PRIMAL BOUND 13
1.19/1.25 c GAP 0
1.19/1.25 s SATISFIABLE
1.19/1.25 v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.19/1.25 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.19/1.25 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106
1.19/1.25 v -x105 -x104 -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
1.19/1.25 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 x59 -x58 -x57 -x56
1.19/1.25 v -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 x36 -x35 -x34 -x33 -x32 -x31
1.19/1.25 v -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5
1.19/1.25 v -x4 -x3 -x2 -x1
1.19/1.25 c SCIP Status : problem is solved [optimal solution found]
1.19/1.25 c Solving Time : 1.21
1.19/1.25 c Original Problem :
1.19/1.25 c Problem name : HOME/instance-3729461-1338679280.opb
1.19/1.25 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.25 c Constraints : 101 initial, 101 maximal
1.19/1.25 c Presolved Problem :
1.19/1.25 c Problem name : t_HOME/instance-3729461-1338679280.opb
1.19/1.25 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.19/1.25 c Constraints : 73 initial, 75 maximal
1.19/1.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.19/1.25 c trivial : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c implics : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c probing : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c setppc : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c linear : 0.00 0 0 0 0 0 28 0 0
1.19/1.25 c logicor : 0.00 0 0 0 0 0 0 0 0
1.19/1.25 c root node : - 1 - - 1 - - - -
1.19/1.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.19/1.25 c integral : 0 0 0 67 0 3 174 0 0 14
1.19/1.25 c knapsack : 1 5 90 1 0 0 0 0 0 0
1.19/1.25 c setppc : 68 5 89 0 0 0 229 0 0 0
1.19/1.25 c logicor : 4+ 5 6 1 0 0 1 0 0 0
1.19/1.25 c countsols : 0 0 0 1 0 0 0 0 0 0
1.19/1.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.19/1.25 c integral : 1.12 0.00 0.00 1.12 0.00
1.19/1.25 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.19/1.25 c setppc : 0.00 0.00 0.00 0.00 0.00
1.19/1.25 c logicor : 0.00 0.00 0.00 0.00 0.00
1.19/1.25 c countsols : 0.00 0.00 0.00 0.00 0.00
1.19/1.25 c Propagators : Time Calls Cutoffs DomReds
1.19/1.25 c rootredcost : 0.00 0 0 0
1.19/1.25 c pseudoobj : 0.00 91 0 0
1.19/1.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.19/1.25 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.25 c infeasible LP : 0.00 3 3 9 34.7 0 0.0 0
1.19/1.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.19/1.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.19/1.25 c applied globally : - - - 2 18.0 - - -
1.19/1.25 c applied locally : - - - 1 35.0 - - -
1.19/1.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.19/1.25 c cut pool : 0.00 4 - - 24 - (maximal pool size: 158)
1.19/1.25 c redcost : 0.00 17 0 0 0 0
1.19/1.25 c impliedbounds : 0.00 5 0 0 0 0
1.19/1.25 c intobj : 0.00 0 0 0 0 0
1.19/1.25 c gomory : 0.01 5 0 0 0 0
1.19/1.25 c strongcg : 0.01 5 0 0 144 0
1.19/1.25 c cmir : 0.00 0 0 0 0 0
1.19/1.25 c flowcover : 0.00 0 0 0 0 0
1.19/1.25 c clique : 0.01 5 0 0 19 0
1.19/1.25 c zerohalf : 0.00 0 0 0 0 0
1.19/1.25 c mcf : 0.00 1 0 0 0 0
1.19/1.25 c Pricers : Time Calls Vars
1.19/1.25 c problem variables: 0.00 0 0
1.19/1.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.19/1.25 c relpscost : 1.12 66 3 174 0 0 14
1.19/1.25 c pscost : 0.00 0 0 0 0 0 0
1.19/1.25 c inference : 0.00 0 0 0 0 0 0
1.19/1.25 c mostinf : 0.00 0 0 0 0 0 0
1.19/1.25 c leastinf : 0.00 0 0 0 0 0 0
1.19/1.25 c fullstrong : 0.00 0 0 0 0 0 0
1.19/1.25 c allfullstrong : 0.00 0 0 0 0 0 0
1.19/1.25 c random : 0.00 0 0 0 0 0 0
1.19/1.25 c Primal Heuristics : Time Calls Found
1.19/1.25 c LP solutions : 0.00 - 1
1.19/1.25 c pseudo solutions : 0.00 - 0
1.19/1.25 c simplerounding : 0.00 0 0
1.19/1.25 c rounding : 0.00 0 0
1.19/1.25 c shifting : 0.00 0 0
1.19/1.25 c intshifting : 0.00 0 0
1.19/1.25 c oneopt : 0.00 0 0
1.19/1.25 c fixandinfer : 0.00 0 0
1.19/1.25 c feaspump : 0.00 0 0
1.19/1.25 c coefdiving : 0.00 0 0
1.19/1.25 c pscostdiving : 0.00 0 0
1.19/1.25 c fracdiving : 0.00 0 0
1.19/1.25 c veclendiving : 0.00 0 0
1.19/1.25 c intdiving : 0.00 0 0
1.19/1.25 c actconsdiving : 0.00 0 0
1.19/1.25 c objpscostdiving : 0.00 0 0
1.19/1.25 c rootsoldiving : 0.00 0 0
1.19/1.25 c linesearchdiving : 0.00 0 0
1.19/1.25 c guideddiving : 0.00 0 0
1.19/1.25 c octane : 0.00 0 0
1.19/1.25 c rens : 0.00 0 0
1.19/1.25 c rins : 0.00 0 0
1.19/1.25 c localbranching : 0.00 0 0
1.19/1.25 c mutation : 0.00 0 0
1.19/1.25 c crossover : 0.00 0 0
1.19/1.25 c dins : 0.00 0 0
1.19/1.25 c LP : Time Calls Iterations Iter/call Iter/sec
1.19/1.25 c primal LP : 0.00 0 0 0.00 -
1.19/1.25 c dual LP : 0.06 75 1124 14.99 18733.33
1.19/1.25 c barrier LP : 0.00 0 0 0.00 -
1.19/1.25 c diving/probing LP: 0.00 0 0 0.00 -
1.19/1.25 c strong branching : 1.11 448 29959 66.87 26990.09
1.19/1.25 c (at root node) : - 33 6936 210.18 -
1.19/1.25 c conflict analysis: 0.00 0 0 0.00 -
1.19/1.25 c B&B Tree :
1.19/1.25 c number of runs : 1
1.19/1.25 c nodes : 14
1.19/1.25 c nodes (total) : 14
1.19/1.25 c nodes left : 0
1.19/1.25 c max depth : 5
1.19/1.25 c max depth (total): 5
1.19/1.25 c backtracks : 2 (14.3%)
1.19/1.25 c delayed cutoffs : 0
1.19/1.25 c repropagations : 1 (1 domain reductions, 0 cutoffs)
1.19/1.25 c avg switch length: 2.00
1.19/1.25 c switching time : 0.00
1.19/1.25 c Solution :
1.19/1.25 c Solutions found : 1 (1 improvements)
1.19/1.25 c Primal Bound : +1.30000000000000e+01 (in run 1, after 14 nodes, 1.21 seconds, depth 3, found by <relaxation>)
1.19/1.25 c Dual Bound : +1.30000000000000e+01
1.19/1.25 c Gap : 0.00 %
1.19/1.25 c Root Dual Bound : +1.30000000000000e+01
1.19/1.25 c Time complete: 1.25.
OK 0
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL This is runsolver version 3.3.1 (svn: 989) 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-3729461-1338679280/watcher-3729461-1338679280 -o /tmp/evaluation-result-3729461-1338679280/solver-3729461-1338679280 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3729461-1338679280.opb 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.50 0.56 0.49 3/176 13584 /proc/meminfo: memFree=30525312/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=8696 CPUtime=0 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 1518 0 0 0 0 0 0 0 20 0 1 0 334053830 8904704 1469 33554432000 4194304 7823515 140734220423504 140736347523992 6962503 0 0 4096 0 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 2174 1469 351 887 0 1284 0 [startup+0.0488639 s] /proc/loadavg: 1.50 0.56 0.49 3/176 13584 /proc/meminfo: memFree=30525312/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=0.04 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3049 0 0 0 4 0 0 0 20 0 1 0 334053830 14098432 2647 33554432000 4194304 7823515 140734220423504 140736347523992 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2647 547 887 0 2552 0 Current children cumulated CPU time (s) 0.04 Current children cumulated vsize (KiB) 13768 [startup+0.100232 s] /proc/loadavg: 1.50 0.56 0.49 3/176 13584 /proc/meminfo: memFree=30525312/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=0.09 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3082 0 0 0 9 0 0 0 20 0 1 0 334053830 14098432 2680 33554432000 4194304 7823515 140734220423504 140736347523992 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2680 551 887 0 2552 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 13768 [startup+0.300176 s] /proc/loadavg: 1.50 0.56 0.49 3/176 13584 /proc/meminfo: memFree=30525312/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=0.29 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3091 0 0 0 28 1 0 0 20 0 1 0 334053830 14098432 2689 33554432000 4194304 7823515 140734220423504 140736347523992 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2689 551 887 0 2552 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 13768 [startup+0.700176 s] /proc/loadavg: 1.50 0.56 0.49 3/176 13584 /proc/meminfo: memFree=30525312/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=0.69 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3095 0 0 0 68 1 0 0 20 0 1 0 334053830 14098432 2693 33554432000 4194304 7823515 140734220423504 140734220417880 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2693 554 887 0 2552 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 13768 Solver just ended. Dumping a history of the last processes samples [startup+1.10643 s] /proc/loadavg: 1.50 0.56 0.49 3/177 13585 /proc/meminfo: memFree=30516880/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=1.09 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3102 0 0 0 107 2 0 0 20 0 1 0 334053830 14098432 2700 33554432000 4194304 7823515 140734220423504 140734220417880 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2700 561 887 0 2552 0 Current children cumulated CPU time (s) 1.09 Current children cumulated vsize (KiB) 13768 [startup+1.2002 s] /proc/loadavg: 1.50 0.56 0.49 3/177 13585 /proc/meminfo: memFree=30516880/32873648 swapFree=6860/6860 [pid=13584] ppid=13582 vsize=13768 CPUtime=1.19 cores=1,3,5,7 /proc/13584/stat : 13584 (pbscip.linux.x8) R 13582 13584 4790 0 -1 4202496 3102 0 0 0 116 3 0 0 20 0 1 0 334053830 14098432 2700 33554432000 4194304 7823515 140734220423504 140734220417880 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0 /proc/13584/statm: 3442 2700 561 887 0 2552 0 Current children cumulated CPU time (s) 1.19 Current children cumulated vsize (KiB) 13768 Child status: 0 Real time (s): 1.25776 CPU time (s): 1.25581 CPU user time (s): 1.22081 CPU system time (s): 0.034994 CPU usage (%): 99.8446 Max. virtual memory (cumulated for all children) (KiB): 13768 getrusage(RUSAGE_CHILDREN,...) data: user time used= 1.22081 system time used= 0.034994 maximum resident set size= 10828 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 3113 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= 3 involuntary context switches= 2 runsolver used 0.002999 second user time and 0.009998 second system time The end
Begin job on node124 at 2012-06-03 01:21:20 IDJOB=3729461 IDBENCH=1252 IDSOLVER=2321 FILE ID=node124/3729461-1338679280 RUNJOBID= node124-1338679211-13480 PBS_JOBID= 14636689 Free space on /tmp= 70700 MiB SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1111219399.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3729461-1338679280/watcher-3729461-1338679280 -o /tmp/evaluation-result-3729461-1338679280/solver-3729461-1338679280 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3729461-1338679280.opb TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 1476879b9f55ab2af66e74aac1d720c1 RANDOM SEED=1761795877 node124.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 initial apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5334.65 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 initial apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.03 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 initial apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.04 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 initial apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5357.53 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 initial apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.03 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 initial apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.04 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 initial apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.03 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2667.325 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5385.03 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873648 kB MemFree: 30525584 kB Buffers: 170004 kB Cached: 1347780 kB SwapCached: 8192 kB Active: 442132 kB Inactive: 1137236 kB Active(anon): 55932 kB Inactive(anon): 8016 kB Active(file): 386200 kB Inactive(file): 1129220 kB Unevictable: 6860 kB Mlocked: 6860 kB SwapTotal: 67108856 kB SwapFree: 67091440 kB Dirty: 9892 kB Writeback: 0 kB AnonPages: 64620 kB Mapped: 10944 kB Shmem: 0 kB Slab: 628984 kB SReclaimable: 73244 kB SUnreclaim: 555740 kB KernelStack: 1472 kB PageTables: 4172 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545680 kB Committed_AS: 177080 kB VmallocTotal: 34359738367 kB VmallocUsed: 346400 kB VmallocChunk: 34341988052 kB HardwareCorrupted: 0 kB AnonHugePages: 49152 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7680 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 70688 MiB End job on node124 at 2012-06-03 01:21:21