2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
GolombRuler/GolombRuler-a3-s1/
GolombRuler-15-a3.xml

Jump to solvers results

General information on the benchmark

NameGolombRuler/GolombRuler-a3-s1/
GolombRuler-15-a3.xml
MD5SUM0ccf44bf6198d309f3039e2504907429
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark164
Best CPU time to get the best result obtained on this benchmark2000.47
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints108
Number of domains2
Minimum domain size500
Maximum domain size501
Distribution of domain sizes[{"size":500,"count":105},{"size":501,"count":15}]
Minimum variable degree0
Maximum variable degree16
Distribution of variable degrees[{"degree":0,"count":120},{"degree":2,"count":105},{"degree":15,"count":13},{"degree":16,"count":2}]
Minimum constraint arity1
Maximum constraint arity105
Distribution of constraint arities[{"arity":1,"count":1},{"arity":3,"count":105},{"arity":15,"count":1},{"arity":105,"count":1}]
Number of extensional constraints0
Number of intensional constraints106
Distribution of constraint types[{"type":"intension","count":106},{"type":"allDifferent","count":1},{"type":"ordered","count":1}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
choco-solver 4.0.5 par (2017-08-18) (complete)4281347SAT (TO)164 2000.47 252.104
choco-solver 4.0.5 par (2017-07-26) (complete)4254515SAT (TO)165 1920.05 241.836
choco-solver 4.0.5 par (2017-08-09) (complete)4271537SAT (TO)165 2003.87 252.089
Mistral-2.0 2017-07-28 (complete)4258988SAT (TO)174 251.89101 252.009
choco-solver 4.0.5 seq (2017-07-26) (complete)4254018SAT (TO)193 244.38 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282817SAT (TO)193 244.939 240.021
choco-solver 4.0.5 seq (2017-08-09) (complete)4270067SAT (TO)193 245.114 240.019
choco-solver 5a (2017-07-26) (complete)4255012SAT (TO)201 250.39799 240.01401
choco-solver 5a (2017-08-18) (complete)4284287SAT (TO)201 250.72501 240.024
AbsCon-basic 2017-06-11 (complete)4257497SAT (TO)203 242.256 240.011
cosoco-sat 1.12 (complete)4266666? (TO) 240.056 240.067
OscaR - ALNS 2017-07-26 (complete)4255509? (TO) 242.726 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256503? (TO) 244.547 240.011
OscaR - Conflict Ordering 2017-07-26 (complete)4256006? (TO) 245.088 240.01199
Concrete 3.4 (complete)4259485? (TO) 250.342 240.20599
cosoco 1.12 (complete)4268597? (TO) 251.952 252.00999
cosoco 1.1 (complete)4258491? (TO) 251.96001 252.00999
sat4j-CSP 2017-07-05 (complete)4257994? (TO) 259.92999 87.6661
OscaR - Parallel with EPS 2017-07-26 (complete)4257000? (TO) 1921.36 251.39101
OscaR - Parallel with EPS 2017-08-22 (complete)4285757? (TO) 1924.9399 252.127

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 164
Solution found:
<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] y[0][1] y[0][2] y[0][3] y[0][4]
y[0][5] y[0][6] y[0][7] y[0][8] y[0][9] y[0][10] y[0][11] y[0][12] y[0][13] y[0][14] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8]
y[1][9] y[1][10] y[1][11] y[1][12] y[1][13] y[1][14] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[2][10] y[2][11] y[2][12]
y[2][13] y[2][14] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[3][10] y[3][11] y[3][12] y[3][13] y[3][14] y[4][5] y[4][6] y[4][7]
y[4][8] y[4][9] y[4][10] y[4][11] y[4][12] y[4][13] y[4][14] y[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[5][12] y[5][13] y[5][14]
y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[6][13] y[6][14] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[7][14] y[8][9]
y[8][10] y[8][11] y[8][12] y[8][13] y[8][14] y[9][10] y[9][11] y[9][12] y[9][13] y[9][14] y[10][11] y[10][12] y[10][13] y[10][14] y[11][12]
y[11][13] y[11][14] y[12][13] y[12][14] y[13][14] </list> <values>0 11 23 32 58 63 78 91 120 139 147 157 161 163 164 11 23 32 58 63 78 91
120 139 147 157 161 163 164 12 21 47 52 67 80 109 128 136 146 150 152 153 9 35 40 55 68 97 116 124 134 138 140 141 26 31 46 59 88 107 115
125 129 131 132 5 20 33 62 81 89 99 103 105 106 15 28 57 76 84 94 98 100 101 13 42 61 69 79 83 85 86 29 48 56 66 70 72 73 19 27 37 41 43 44
8 18 22 24 25 10 14 16 17 4 6 7 2 3 1 </values> </instantiation>