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

Result page for benchmark
Ramsey/Ramsey-int-s1/
Ramsey-int-21.xml

Jump to solvers results

General information on the benchmark

NameRamsey/Ramsey-int-s1/
Ramsey-int-21.xml
MD5SUM25b27bae3543dabdafa06e8069fa9092
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark3
Best CPU time to get the best result obtained on this benchmark240.01601
Satisfiable
(Un)Satisfiability was proved
Number of variables441
Number of constraints1330
Number of domains1
Minimum domain size210
Maximum domain size210
Distribution of domain sizes[{"size":210,"count":210}]
Minimum variable degree0
Maximum variable degree20
Distribution of variable degrees[{"degree":0,"count":231},{"degree":20,"count":210}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":1330}]
Number of extensional constraints0
Number of intensional constraints1330
Distribution of constraint types[{"type":"intension","count":1330}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco-sat 1.12 (complete)4266971SAT (TO)3 240.01601 240.015
AbsCon-basic 2017-06-11 (complete)4257703SAT (TO)3 243.659 240.013
OscaR - Conflict Ordering 2017-07-26 (complete)4256212SAT (TO)3 247.19099 240.037
OscaR - ALNS 2017-07-26 (complete)4255715SAT (TO)3 249.688 240.035
OscaR - Hybrid 2017-07-26 (complete)4256709SAT (TO)3 249.923 240.037
cosoco 1.12 (complete)4268902SAT (TO)3 251.92999 252.00999
Mistral-2.0 2017-07-28 (complete)4259194SAT (TO)3 251.967 252.00999
cosoco 1.1 (complete)4258697SAT (TO)3 251.968 252.00999
choco-solver 5a (2017-08-18) (complete)4284592SAT (TO)3 255.511 240.02299
choco-solver 5a (2017-07-26) (complete)4255218SAT (TO)3 256 240.00999
OscaR - Parallel with EPS 2017-08-22 (complete)4286062SAT (TO)3 816.08002 252.06799
OscaR - Parallel with EPS 2017-07-26 (complete)4257206SAT (TO)3 845.37598 252.056
choco-solver 4.0.5 par (2017-07-26) (complete)4254721SAT (TO)3 1920.09 241.735
choco-solver 4.0.5 par (2017-08-09) (complete)4271842SAT (TO)3 2004.1899 252.131
choco-solver 4.0.5 par (2017-08-18) (complete)4281652SAT (TO)3 2004.5 252.119
Concrete 3.4 (complete)4259691SAT (TO)4 258.26801 240.077
choco-solver 4.0.5 seq (2017-07-26) (complete)4254224? (TO) 245.14999 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270372? (TO) 245.174 240.03101
choco-solver 4.0.5 seq (2017-08-18) (complete)4283122? (TO) 245.651 240.032
sat4j-CSP 2017-07-05 (complete)4258200? (TO) 260.09799 87.180099

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: 3
Solution found:
<instantiation type='solution' cost='3'> <list>x[0][0] x[0][10] x[0][11] x[0][12] x[0][13] x[0][14] x[0][15] x[0][16] x[0][17] x[0][18]
x[0][19] x[0][1] x[0][20] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[10][0] x[10][10] x[10][11] x[10][12] x[10][13]
x[10][14] x[10][15] x[10][16] x[10][17] x[10][18] x[10][19] x[10][1] x[10][20] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7]
x[10][8] x[10][9] x[11][0] x[11][10] x[11][11] x[11][12] x[11][13] x[11][14] x[11][15] x[11][16] x[11][17] x[11][18] x[11][19] x[11][1]
x[11][20] x[11][2] x[11][3] x[11][4] x[11][5] x[11][6] x[11][7] x[11][8] x[11][9] x[12][0] x[12][10] x[12][11] x[12][12] x[12][13] x[12][14]
x[12][15] x[12][16] x[12][17] x[12][18] x[12][19] x[12][1] x[12][20] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9]
x[13][0] x[13][10] x[13][11] x[13][12] x[13][13] x[13][14] x[13][15] x[13][16] x[13][17] x[13][18] x[13][19] x[13][1] x[13][20] x[13][2]
x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9] x[14][0] x[14][10] x[14][11] x[14][12] x[14][13] x[14][14] x[14][15]
x[14][16] x[14][17] x[14][18] x[14][19] x[14][1] x[14][20] x[14][2] x[14][3] x[14][4] x[14][5] x[14][6] x[14][7] x[14][8] x[14][9] x[15][0]
x[15][10] x[15][11] x[15][12] x[15][13] x[15][14] x[15][15] x[15][16] x[15][17] x[15][18] x[15][19] x[15][1] x[15][20] x[15][2] x[15][3]
x[15][4] x[15][5] x[15][6] x[15][7] x[15][8] x[15][9] x[16][0] x[16][10] x[16][11] x[16][12] x[16][13] x[16][14] x[16][15] x[16][16]
x[16][17] x[16][18] x[16][19] x[16][1] x[16][20] x[16][2] x[16][3] x[16][4] x[16][5] x[16][6] x[16][7] x[16][8] x[16][9] x[17][0] x[17][10]
x[17][11] x[17][12] x[17][13] x[17][14] x[17][15] x[17][16] x[17][17] x[17][18] x[17][19] x[17][1] x[17][20] x[17][2] x[17][3] x[17][4]
x[17][5] x[17][6] x[17][7] x[17][8] x[17][9] x[18][0] x[18][10] x[18][11] x[18][12] x[18][13] x[18][14] x[18][15] x[18][16] x[18][17]
x[18][18] x[18][19] x[18][1] x[18][20] x[18][2] x[18][3] x[18][4] x[18][5] x[18][6] x[18][7] x[18][8] x[18][9] x[19][0] x[19][10] x[19][11]
x[19][12] x[19][13] x[19][14] x[19][15] x[19][16] x[19][17] x[19][18] x[19][19] x[19][1] x[19][20] x[19][2] x[19][3] x[19][4] x[19][5]
x[19][6] x[19][7] x[19][8] x[19][9] x[1][0] x[1][10] x[1][11] x[1][12] x[1][13] x[1][14] x[1][15] x[1][16] x[1][17] x[1][18] x[1][19]
x[1][1] x[1][20] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[20][0] x[20][10] x[20][11] x[20][12] x[20][13] x[20][14]
x[20][15] x[20][16] x[20][17] x[20][18] x[20][19] x[20][1] x[20][20] x[20][2] x[20][3] x[20][4] x[20][5] x[20][6] x[20][7] x[20][8] x[20][9]
x[2][0] x[2][10] x[2][11] x[2][12] x[2][13] x[2][14] x[2][15] x[2][16] x[2][17] x[2][18] x[2][19] x[2][1] x[2][20] x[2][2] x[2][3] x[2][4]
x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0] x[3][10] x[3][11] x[3][12] x[3][13] x[3][14] x[3][15] x[3][16] x[3][17] x[3][18] x[3][19]
x[3][1] x[3][20] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[4][0] x[4][10] x[4][11] x[4][12] x[4][13] x[4][14]
x[4][15] x[4][16] x[4][17] x[4][18] x[4][19] x[4][1] x[4][20] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0]
x[5][10] x[5][11] x[5][12] x[5][13] x[5][14] x[5][15] x[5][16] x[5][17] x[5][18] x[5][19] x[5][1] x[5][20] x[5][2] x[5][3] x[5][4] x[5][5]
x[5][6] x[5][7] x[5][8] x[5][9] x[6][0] x[6][10] x[6][11] x[6][12] x[6][13] x[6][14] x[6][15] x[6][16] x[6][17] x[6][18] x[6][19] x[6][1]
x[6][20] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][10] x[7][11] x[7][12] x[7][13] x[7][14] x[7][15]
x[7][16] x[7][17] x[7][18] x[7][19] x[7][1] x[7][20] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][10]
x[8][11] x[8][12] x[8][13] x[8][14] x[8][15] x[8][16] x[8][17] x[8][18] x[8][19] x[8][1] x[8][20] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6]
x[8][7] x[8][8] x[8][9] x[9][0] x[9][10] x[9][11] x[9][12] x[9][13] x[9][14] x[9][15] x[9][16] x[9][17] x[9][18] x[9][19] x[9][1] x[9][20]
x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] </list> <values>* 1 1 0 1 2 3 2 2 2 0 1 2 1 0 2 0 2 0 0 1 * * 2 2 0 0 1 0 2
1 1 * 1 * * * * * * * * * * * 1 0 2 1 2 0 1 2 * 2 * * * * * * * * * * * * 0 2 0 1 0 2 1 * 1 * * * * * * * * * * * * * 2 1 2 1 0 0 * 2 * * *
* * * * * * * * * * * 2 3 0 0 0 * 1 * * * * * * * * * * * * * * * 3 2 0 0 * 2 * * * * * * * * * * * * * * * * 0 0 0 * 3 * * * * * * * * * *
* * * * * * * 1 1 * 1 * * * * * * * * * * * * * * * * * * 2 * 0 * * * * * * * * * * * * * * * * * * * * 0 * * * * * * * * * 0 0 0 3 1 1 1 1
0 0 * 2 2 2 0 1 1 1 0 0 * * * * * * * * * * * * * * * * * * * * * * 2 0 0 2 1 1 1 1 0 0 * 3 * 0 2 1 1 1 0 2 * 0 1 2 1 1 0 1 0 3 1 * 0 * * 0
1 2 3 2 0 * 1 1 2 0 0 2 0 1 3 2 * 3 * * * 0 1 0 2 1 * 0 0 1 3 2 0 3 2 1 2 * 0 * * * * 2 2 1 0 * 2 0 0 1 0 2 0 3 1 1 * 0 * * * * * 0 0 2 * 0
1 2 1 3 2 2 0 0 1 * 1 * * * * * * 2 0 * 2 1 3 0 1 0 1 0 2 1 * 2 * * * * * * * 2 * 3 2 2 0 0 1 0 2 1 1 * 1 * * * * * * * * </values>
</instantiation>