2018 XCSP3 competition: fast COP track: solvers results per benchmarks

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

Solver Name	TraceID	Answer	objective function	CPU time	Wall clock time
OscaR - Hybrid 2018-08-14 (complete)	4310491	SAT (TO)	66	252.098	243.133
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)	4312351	SAT (TO)	66	252.118	244.718
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)	4310141	SAT (TO)	70	252.061	245.027
Sat4j-CSP 2018-07-11 (complete)	4301886	SAT (TO)	70	252.07	248.726
Mistral-2.0 2018-08-01 (complete)	4312661	SAT (TO)	74	251.988	252.01
Concrete 3.9.2 (complete)	4302515	SAT (TO)	82	252.139	232.536
Concrete 3.9.2-SuperNG (complete)	4302865	SAT (TO)	86	252.089	229.148
Choco-solver 4.0.7b seq (e747e1e) (complete)	4301885	SAT (TO)	94	252.093	247.415
cosoco 1.12 (complete)	4301887	SAT (TO)	170	251.996	252.01

<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] x[16] x[17] x[18] x[19] x[20]
x[21] x[22] x[23] x[24] x[25] x[26] x[27] y[0][0] 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[0][16] y[0][17] y[0][18] y[0][19] y[0][20] y[0][21] y[0][22] y[0][23] y[0][24] y[0][25] y[0][26]
y[1][0] y[1][1] 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[1][16] y[1][17] y[1][18] y[1][19] y[1][20] y[1][21] y[1][22] y[1][23] y[1][24] y[1][25] y[2][0] y[2][1] y[2][2] 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[2][16] y[2][17] y[2][18] y[2][19] y[2][20] y[2][21]
y[2][22] y[2][23] y[2][24] y[3][0] y[3][1] y[3][2] y[3][3] 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[3][16] y[3][17] y[3][18] y[3][19] y[3][20] y[3][21] y[3][22] y[3][23] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4]
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[4][16] y[4][17] y[4][18] y[4][19] y[4][20]
y[4][21] y[4][22] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] 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[5][16] y[5][17] y[5][18] y[5][19] y[5][20] y[5][21] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] 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[6][16] y[6][17] y[6][18] y[6][19] y[6][20] y[7][0] y[7][1] y[7][2]
y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] 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[7][16] y[7][17] y[7][18]
y[7][19] y[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[8][14]
y[8][15] y[8][16] y[8][17] y[8][18] y[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9] y[9][10] y[9][11]
y[9][12] y[9][13] y[9][14] y[9][15] y[9][16] y[9][17] y[10][0] y[10][1] y[10][2] y[10][3] y[10][4] y[10][5] y[10][6] y[10][7] y[10][8]
y[10][9] y[10][10] y[10][11] y[10][12] y[10][13] y[10][14] y[10][15] y[10][16] y[11][0] y[11][1] y[11][2] y[11][3] y[11][4] y[11][5]
y[11][6] y[11][7] y[11][8] y[11][9] y[11][10] y[11][11] y[11][12] y[11][13] y[11][14] y[11][15] y[12][0] y[12][1] y[12][2] y[12][3] y[12][4]
y[12][5] y[12][6] y[12][7] y[12][8] y[12][9] y[12][10] y[12][11] y[12][12] y[12][13] y[12][14] y[13][0] y[13][1] y[13][2] y[13][3] y[13][4]
y[13][5] y[13][6] y[13][7] y[13][8] y[13][9] y[13][10] y[13][11] y[13][12] y[13][13] y[14][0] y[14][1] y[14][2] y[14][3] y[14][4] y[14][5]
y[14][6] y[14][7] y[14][8] y[14][9] y[14][10] y[14][11] y[14][12] y[15][0] y[15][1] y[15][2] y[15][3] y[15][4] y[15][5] y[15][6] y[15][7]
y[15][8] y[15][9] y[15][10] y[15][11] y[16][0] y[16][1] y[16][2] y[16][3] y[16][4] y[16][5] y[16][6] y[16][7] y[16][8] y[16][9] y[16][10]
y[17][0] y[17][1] y[17][2] y[17][3] y[17][4] y[17][5] y[17][6] y[17][7] y[17][8] y[17][9] y[18][0] y[18][1] y[18][2] y[18][3] y[18][4]
y[18][5] y[18][6] y[18][7] y[18][8] y[19][0] y[19][1] y[19][2] y[19][3] y[19][4] y[19][5] y[19][6] y[19][7] y[20][0] y[20][1] y[20][2]
y[20][3] y[20][4] y[20][5] y[20][6] y[21][0] y[21][1] y[21][2] y[21][3] y[21][4] y[21][5] y[22][0] y[22][1] y[22][2] y[22][3] y[22][4]
y[23][0] y[23][1] y[23][2] y[23][3] y[24][0] y[24][1] y[24][2] y[25][0] y[25][1] y[26][0] c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9]
c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20] c[21] c[22] c[23] c[24] c[25] c[26] s[0] s[1] s[2] s[3] s[4] s[5] s[6]
s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[20] s[21] s[22] s[23] s[24] s[25] s[26] </list> <values> 1 -1 1
-1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1
-1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1
-1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 -1
-1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 1
-1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1
1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1
-1 1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1
-1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 0 3 0 -1 0 1 -2 1 -2 -3 -2 1 2 -1 -2 3 -2 -1 -2 -1 0 1 0 1 0 1 1 0 9 0 1 0 1 4 1 4 9 4 1 4 1 4 9 4 1 4 1 0 1
0 1 0 1 </values> </instantiation>

Name	LowAutocorrelation/ LowAutocorrelation-028_c18.xml
MD5SUM	6d24c16a7684a366ea9600406f2e8dbf
Bench Category	COP (optimization problem)
Best result obtained on this benchmark	SAT
Best value of the objective obtained on this benchmark	66
Best CPU time to get the best result obtained on this benchmark	252.098
Satisfiable
(Un)Satisfiability was proved
Number of variables	811
Number of constraints	432
Number of domains	55
Minimum domain size	2
Maximum domain size	55
Distribution of domain sizes	[{"size":2,"count":407},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":2},{"size":10,"count":1},{"size":11,"count":2},{"size":12,"count":1},{"size":13,"count":2},{"size":14,"count":1},{"size":15,"count":2},{"size":16,"count":1},{"size":17,"count":2},{"size":18,"count":1},{"size":19,"count":2},{"size":20,"count":1},{"size":21,"count":2},{"size":22,"count":1},{"size":23,"count":2},{"size":24,"count":1},{"size":25,"count":2},{"size":26,"count":1},{"size":27,"count":2},{"size":28,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1},{"size":35,"count":1},{"size":37,"count":1},{"size":39,"count":1},{"size":41,"count":1},{"size":43,"count":1},{"size":45,"count":1},{"size":47,"count":1},{"size":49,"count":1},{"size":51,"count":1},{"size":53,"count":1},{"size":55,"count":1}]
Minimum variable degree	0
Maximum variable degree	27
Distribution of variable degrees	[{"degree":0,"count":351},{"degree":2,"count":432},{"degree":27,"count":28}]
Minimum constraint arity	2
Maximum constraint arity	28
Distribution of constraint arities	[{"arity":2,"count":28},{"arity":3,"count":379},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"count":1},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":1},{"arity":17,"count":1},{"arity":18,"count":1},{"arity":19,"count":1},{"arity":20,"count":1},{"arity":21,"count":1},{"arity":22,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":25,"count":1},{"arity":26,"count":1},{"arity":27,"count":1},{"arity":28,"count":1}]
Number of extensional constraints	0
Number of intensional constraints	405
Distribution of constraint types	[{"type":"intension","count":405},{"type":"sum","count":27}]
Optimization problem	YES
Type of objective	min SUM

2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
LowAutocorrelation/
LowAutocorrelation-028_c18.xml

General information on the benchmark

Results of the different solvers on this benchmark

Additionnal information

2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmarkLowAutocorrelation/LowAutocorrelation-028_c18.xml

General information on the benchmark

Results of the different solvers on this benchmark

Additionnal information

Result page for benchmark
LowAutocorrelation/
LowAutocorrelation-028_c18.xml