2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameNurseRostering/
NurseRostering-01_c18.xml
MD5SUM0c15b35a08e73d195c67cb94b6fc4864
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark607
Best CPU time to get the best result obtained on this benchmark6.23891
Satisfiable
(Un)Satisfiability was proved
Number of variables226
Number of constraints427
Number of domains11
Minimum domain size1
Maximum domain size15
Distribution of domain sizes[{"size":1,"count":14},{"size":2,"count":154},{"size":9,"count":42},{"size":15,"count":16}]
Minimum variable degree2
Maximum variable degree18
Distribution of variable degrees[{"degree":2,"count":98},{"degree":3,"count":16},{"degree":8,"count":4},{"degree":9,"count":10},{"degree":10,"count":2},{"degree":11,"count":4},{"degree":12,"count":10},{"degree":13,"count":12},{"degree":14,"count":17},{"degree":15,"count":16},{"degree":16,"count":17},{"degree":17,"count":18},{"degree":18,"count":2}]
Minimum constraint arity2
Maximum constraint arity15
Distribution of constraint arities[{"arity":2,"count":118},{"arity":3,"count":192},{"arity":6,"count":72},{"arity":8,"count":1},{"arity":9,"count":28},{"arity":15,"count":16}]
Number of extensional constraints28
Number of intensional constraints74
Distribution of constraint types[{"type":"extension","count":28},{"type":"intension","count":74},{"type":"regular","count":192},{"type":"sum","count":16},{"type":"count","count":116},{"type":"instantiation","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 (complete)4396960OPT607 6.23891 6.23941
cosoco 2.0 (complete)4408220OPT607 6.26066 6.2619
cosoco 2 (complete)4389680OPT607 6.2614 6.26128
AbsCon 2019-07-23 (complete)4390780OPT607 9.36881 5.19567
cosoco 2.O parallel (complete)4398240OPT607 18.5006 2.39287
cosoco 2.0 parallel (complete)4409500OPT607 23.3096 2.99054
PicatSAT 2019-09-12 (complete)4395160OPT607 49.577 49.578
Concrete 3.12.2 (complete)4400940OPT607 65.2392 55.2872
Concrete 3.10 (complete)4387509OPT607 72.2627 58.8826
choco-solver 2019-09-16 (complete)4399140OPT607 82.4203 21.1671
choco-solver 2019-09-20 (complete)4403640OPT607 88.4633 22.7054
choco-solver 2019-06-14 (complete)4393180OPT607 90.2356 41.5271
Concrete 3.12.3 (complete)4402740OPT607 114.754 105.332
choco-solver 2019-06-14 parallel (complete)4393780OPT607 161.818 23.3388
choco-solver 2019-09-24 parallel (complete)4406940OPT607 169.912 22.2407
choco-solver 2019-09-20 parallel (complete)4404540OPT607 179.227 23.4176
choco-solver 2019-09-16 parallel (complete)4399740OPT607 191.851 24.9972
choco-solver 2019-09-24 (complete)4406040OPT607 398.145 393.961
Concrete 3.12.2 (complete)4396060OPT607 461.575 447.085

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