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

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

Jump to solvers results

General information on the benchmark

NameGolombRuler/GolombRuler-a3-s1/
GolombRuler-16-a3.xml
MD5SUM0e9e24bc5c9dc7ecc0ccfc6ea7d62ad7
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark196
Best CPU time to get the best result obtained on this benchmark2000.05
Satisfiable
(Un)Satisfiability was proved
Number of variables272
Number of constraints123
Number of domains2
Minimum domain size500
Maximum domain size501
Distribution of domain sizes[{"size":500,"count":120},{"size":501,"count":16}]
Minimum variable degree0
Maximum variable degree17
Distribution of variable degrees[{"degree":0,"count":136},{"degree":2,"count":120},{"degree":16,"count":14},{"degree":17,"count":2}]
Minimum constraint arity1
Maximum constraint arity120
Distribution of constraint arities[{"arity":1,"count":1},{"arity":3,"count":120},{"arity":16,"count":1},{"arity":120,"count":1}]
Number of extensional constraints0
Number of intensional constraints121
Distribution of constraint types[{"type":"intension","count":121},{"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-07-26) (complete)4254516SAT (TO)196 1920.4 241.83501
choco-solver 4.0.5 par (2017-08-18) (complete)4281348SAT (TO)196 2000.05 252.10001
choco-solver 4.0.5 par (2017-08-09) (complete)4271538SAT (TO)196 2003.52 252.117
Mistral-2.0 2017-07-28 (complete)4258989SAT (TO)206 251.86099 252.00999
AbsCon-basic 2017-06-11 (complete)4257498SAT (TO)251 242.524 240.01199
choco-solver 4.0.5 seq (2017-07-26) (complete)4254019SAT (TO)265 243.84 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282818SAT (TO)265 244.086 240.02
choco-solver 4.0.5 seq (2017-08-09) (complete)4270068SAT (TO)265 244.13499 240.021
cosoco-sat 1.12 (complete)4266667SAT (TO)271 240.08099 240.077
choco-solver 5a (2017-07-26) (complete)4255013SAT (TO)281 249.7 240.00999
choco-solver 5a (2017-08-18) (complete)4284288SAT (TO)281 249.825 240.022
OscaR - ALNS 2017-07-26 (complete)4255510? (TO) 242.423 240.011
OscaR - Conflict Ordering 2017-07-26 (complete)4256007? (TO) 244.51199 240.01199
OscaR - Hybrid 2017-07-26 (complete)4256504? (TO) 244.77499 240.015
Concrete 3.4 (complete)4259486? (TO) 249.658 240.213
cosoco 1.1 (complete)4258492? (TO) 251.924 252.00999
cosoco 1.12 (complete)4268598? (TO) 251.94701 252.00999
sat4j-CSP 2017-07-05 (complete)4257995? (TO) 260.02399 85.953003
OscaR - Parallel with EPS 2017-08-22 (complete)4285758? (TO) 1916.73 252.119
OscaR - Parallel with EPS 2017-07-26 (complete)4257001? (TO) 1921.08 252.80099

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: 196
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] x[15] 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[0][15] 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[1][15] 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[2][15] 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[3][15] 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[4][15] 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[5][15] 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[6][15]
y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[7][14] y[7][15] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[8][14] y[8][15] y[9][10]
y[9][11] y[9][12] y[9][13] y[9][14] y[9][15] y[10][11] y[10][12] y[10][13] y[10][14] y[10][15] y[11][12] y[11][13] y[11][14] y[11][15]
y[12][13] y[12][14] y[12][15] y[13][14] y[13][15] y[14][15] </list> <values>0 1 3 7 12 25 48 56 75 90 110 127 156 170 186 196 1 3 7 12 25 48
56 75 90 110 127 156 170 186 196 2 6 11 24 47 55 74 89 109 126 155 169 185 195 4 9 22 45 53 72 87 107 124 153 167 183 193 5 18 41 49 68 83
103 120 149 163 179 189 13 36 44 63 78 98 115 144 158 174 184 23 31 50 65 85 102 131 145 161 171 8 27 42 62 79 108 122 138 148 19 34 54 71
100 114 130 140 15 35 52 81 95 111 121 20 37 66 80 96 106 17 46 60 76 86 29 43 59 69 14 30 40 16 26 10 </values> </instantiation>