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
Mistral-2.0 2018-08-01 (complete)	4312453	SAT (TO)	2248	251.955	252.011
OscaR - Hybrid 2018-08-14 (complete)	4310399	SAT (TO)	2331	252.104	238.321
Choco-solver 4.0.7b seq (e747e1e) (complete)	4301249	SAT (TO)	2428	252.114	245.926
Sat4j-CSP 2018-07-11 (complete)	4301250	SAT (TO)	2583	252.266	246.369
cosoco 1.12 (complete)	4301251	SAT (TO)	2979	251.98	252.01
Concrete 3.9.2-SuperNG (complete)	4302773	SAT (TO)	3169	252.066	228.941
Concrete 3.9.2 (complete)	4302423	SAT (TO)	3552	252.08	229.544
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)	4312259	SAT (TO)	4001	252.043	244.717
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)	4310049	SAT (TO)	4305	252.099	244.818

<instantiation type="solution"> <list> x[0][0] x[0][1] 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[1][0] x[1][1]
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[2][0] x[2][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6]
x[9][7] x[9][8] x[9][9] x[10][0] x[10][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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][1] 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[20][0] x[20][1] 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[21][0] x[21][1] x[21][2] x[21][3] x[21][4] x[21][5] x[21][6] x[21][7]
x[21][8] x[21][9] x[22][0] x[22][1] x[22][2] x[22][3] x[22][4] x[22][5] x[22][6] x[22][7] x[22][8] x[22][9] x[23][0] x[23][1] x[23][2]
x[23][3] x[23][4] x[23][5] x[23][6] x[23][7] x[23][8] x[23][9] x[24][0] x[24][1] x[24][2] x[24][3] x[24][4] x[24][5] x[24][6] x[24][7]
x[24][8] x[24][9] x[25][0] x[25][1] x[25][2] x[25][3] x[25][4] x[25][5] x[25][6] x[25][7] x[25][8] x[25][9] x[26][0] x[26][1] x[26][2]
x[26][3] x[26][4] x[26][5] x[26][6] x[26][7] x[26][8] x[26][9] x[27][0] x[27][1] x[27][2] x[27][3] x[27][4] x[27][5] x[27][6] x[27][7]
x[27][8] x[27][9] ps[0][0] ps[0][1] ps[0][2] ps[1][0] ps[1][1] ps[1][2] ps[2][0] ps[2][1] ps[2][2] ps[3][0] ps[3][1] ps[3][2] ps[4][0]
ps[4][1] ps[4][2] ps[5][0] ps[5][1] ps[5][2] ps[6][0] ps[6][1] ps[6][2] ps[7][0] ps[7][1] ps[7][2] ps[8][0] ps[8][1] ps[8][2] ps[9][0]
ps[9][1] ps[9][2] ds[0][0] ds[0][1] ds[0][2] ds[1][0] ds[1][1] ds[1][2] ds[2][0] ds[2][1] ds[2][2] ds[3][0] ds[3][1] ds[3][2] ds[4][0]
ds[4][1] ds[4][2] ds[5][0] ds[5][1] ds[5][2] ds[6][0] ds[6][1] ds[6][2] ds[7][0] ds[7][1] ds[7][2] ds[8][0] ds[8][1] ds[8][2] ds[9][0]
ds[9][1] ds[9][2] ds[10][0] ds[10][1] ds[10][2] ds[11][0] ds[11][1] ds[11][2] ds[12][0] ds[12][1] ds[12][2] ds[13][0] ds[13][1] ds[13][2]
ds[14][0] ds[14][1] ds[14][2] ds[15][0] ds[15][1] ds[15][2] ds[16][0] ds[16][1] ds[16][2] ds[17][0] ds[17][1] ds[17][2] ds[18][0] ds[18][1]
ds[18][2] ds[19][0] ds[19][1] ds[19][2] ds[20][0] ds[20][1] ds[20][2] ds[21][0] ds[21][1] ds[21][2] ds[22][0] ds[22][1] ds[22][2] ds[23][0]
ds[23][1] ds[23][2] ds[24][0] ds[24][1] ds[24][2] ds[25][0] ds[25][1] ds[25][2] ds[26][0] ds[26][1] ds[26][2] ds[27][0] ds[27][1] ds[27][2]
wk[0][0] wk[0][1] wk[0][2] wk[0][3] wk[1][0] wk[1][1] wk[1][2] wk[1][3] wk[2][0] wk[2][1] wk[2][2] wk[2][3] wk[3][0] wk[3][1] wk[3][2]
wk[3][3] wk[4][0] wk[4][1] wk[4][2] wk[4][3] wk[5][0] wk[5][1] wk[5][2] wk[5][3] wk[6][0] wk[6][1] wk[6][2] wk[6][3] wk[7][0] wk[7][1]
wk[7][2] wk[7][3] wk[8][0] wk[8][1] wk[8][2] wk[8][3] wk[9][0] wk[9][1] wk[9][2] wk[9][3] cn[0] cn[1] cn[2] cn[3] cn[4] cn[5] cn[6] cn[7]
cn[8] cn[9] cn[10] cn[11] cn[12] cn[13] cn[14] cn[15] cn[16] cn[17] cn[18] cn[19] cn[20] cn[21] cn[22] cn[23] cn[24] cn[25] cn[26] cn[27]
cn[28] cn[29] cn[30] cn[31] cn[32] cn[33] cn[34] cn[35] cn[36] cn[37] cn[38] cn[39] cn[40] cn[41] cn[42] cn[43] cn[44] cn[45] cn[46] cn[47]
cn[48] cn[49] cn[50] cn[51] cf[0] cf[1] cf[2] cf[3] cf[4] cf[5] cf[6] cf[7] cf[8] cf[9] cf[10] cf[11] cf[12] cf[13] cf[14] cf[15] cf[16]
cf[17] cf[18] cc[0][0] cc[0][1] cc[0][2] cc[1][0] cc[1][1] cc[1][2] cc[2][0] cc[2][1] cc[2][2] cc[3][0] cc[3][1] cc[3][2] cc[4][0] cc[4][1]
cc[4][2] cc[5][0] cc[5][1] cc[5][2] cc[6][0] cc[6][1] cc[6][2] cc[7][0] cc[7][1] cc[7][2] cc[8][0] cc[8][1] cc[8][2] cc[9][0] cc[9][1]
cc[9][2] cc[10][0] cc[10][1] cc[10][2] cc[11][0] cc[11][1] cc[11][2] cc[12][0] cc[12][1] cc[12][2] cc[13][0] cc[13][1] cc[13][2] cc[14][0]
cc[14][1] cc[14][2] cc[15][0] cc[15][1] cc[15][2] cc[16][0] cc[16][1] cc[16][2] cc[17][0] cc[17][1] cc[17][2] cc[18][0] cc[18][1] cc[18][2]
cc[19][0] cc[19][1] cc[19][2] cc[20][0] cc[20][1] cc[20][2] cc[21][0] cc[21][1] cc[21][2] cc[22][0] cc[22][1] cc[22][2] cc[23][0] cc[23][1]
cc[23][2] cc[24][0] cc[24][1] cc[24][2] cc[25][0] cc[25][1] cc[25][2] cc[26][0] cc[26][1] cc[26][2] cc[27][0] cc[27][1] cc[27][2] </list>
<values> 2 2 2 1 2 1 2 1 0 0 2 0 0 1 2 1 2 1 0 1 1 0 0 2 0 1 2 1 0 1 1 0 2 2 0 2 1 2 2 1 1 0 2 2 0 2 1 2 2 1 2 2 0 2 2 1 1 0 1 2 2 2 0 2 2 1
1 0 1 2 1 0 0 0 2 1 2 1 2 0 1 0 0 1 2 2 2 1 2 0 2 0 2 1 0 2 1 1 0 2 2 0 2 1 0 2 1 2 1 2 0 2 0 1 0 2 1 2 1 0 0 2 1 2 2 1 2 2 1 0 0 2 2 2 2 1
2 2 1 0 2 0 2 2 0 1 0 1 2 1 2 0 0 0 0 1 0 1 2 1 1 2 1 0 0 1 0 1 0 2 1 2 1 0 2 2 0 2 0 2 1 2 1 0 2 2 2 2 0 1 2 0 2 0 0 2 2 0 2 1 2 0 2 2 1 2
1 0 2 2 2 0 0 2 1 1 1 2 0 2 2 2 0 2 1 1 1 2 0 0 0 2 0 0 2 1 1 0 0 1 0 2 0 0 2 1 1 1 0 2 0 0 0 1 0 1 2 1 1 2 0 0 2 1 0 2 2 2 2 2 0 0 2 1 0 2
2 2 2 2 8 8 12 16 0 12 13 4 11 8 9 11 13 3 12 0 16 12 4 12 12 5 11 12 11 7 10 7 9 12 2 3 5 3 4 3 4 4 2 2 3 5 2 3 5 2 3 5 2 3 5 4 3 3 3 3 4 3
3 4 2 3 5 4 3 3 2 3 5 2 2 6 3 3 4 5 3 2 4 4 2 3 2 5 2 3 5 4 1 5 2 2 6 3 3 4 3 3 4 5 3 2 4 3 3 4 4 2 3 1 6 3 1 6 0 1 0 1 0 0 1 1 1 1 0 0 0 0
1 1 0 0 1 1 1 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 2 0 2 2 2 2 0 1 1 1 0 0 0 0 3 0 0 0 0 3 3 0 0 3 3 3 3 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 1 1 0 2 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 100 0 0 0 1 0 0 0 0 0 0 0 0 0 0 300
100 0 0 100 0 0 100 0 0 0 0 0 0 0 0 0 0 200 300 0 0 0 0 100 100 0 0 1 0 0 0 0 0 100 0 0 200 0 100 300 0 100 0 0 </values> </instantiation>

Name	NurseRostering/ NurseRostering-04_c18.xml
MD5SUM	3e14d2a5b30f836b117ab38c1a042f13
Bench Category	COP (optimization problem)
Best result obtained on this benchmark	SAT
Best value of the objective obtained on this benchmark	2331
Best CPU time to get the best result obtained on this benchmark	252.104
Satisfiable
(Un)Satisfiability was proved
Number of variables	589
Number of constraints	1410
Number of domains	13
Minimum domain size	1
Maximum domain size	29
Distribution of domain sizes	[{"size":1,"count":30},{"size":2,"count":111},{"size":3,"count":280},{"size":11,"count":140},{"size":29,"count":28}]
Minimum variable degree	2
Maximum variable degree	21
Distribution of variable degrees	[{"degree":2,"count":269},{"degree":3,"count":40},{"degree":11,"count":9},{"degree":12,"count":11},{"degree":14,"count":8},{"degree":15,"count":10},{"degree":16,"count":15},{"degree":17,"count":23},{"degree":18,"count":18},{"degree":19,"count":79},{"degree":20,"count":85},{"degree":21,"count":22}]
Minimum constraint arity	2
Maximum constraint arity	29
Distribution of constraint arities	[{"arity":2,"count":525},{"arity":3,"count":530},{"arity":4,"count":10},{"arity":6,"count":230},{"arity":11,"count":84},{"arity":20,"count":1},{"arity":29,"count":30}]
Number of extensional constraints	354
Number of intensional constraints	171
Distribution of constraint types	[{"type":"extension","count":354},{"type":"intension","count":171},{"type":"regular","count":520},{"type":"sum","count":20},{"type":"count","count":344},{"type":"instantiation","count":1}]
Optimization problem	YES
Type of objective	min SUM

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

Result page for benchmark
NurseRostering/
NurseRostering-04_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 benchmarkNurseRostering/NurseRostering-04_c18.xml

General information on the benchmark

Results of the different solvers on this benchmark

Additionnal information

Result page for benchmark
NurseRostering/
NurseRostering-04_c18.xml