2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameNurseRostering/
NurseRostering-00_c18.xml
MD5SUM7966b03e526ceecd0ca6bc8193050685
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1202
Best CPU time to get the best result obtained on this benchmark43.9415
Satisfiable
(Un)Satisfiability was proved
Number of variables162
Number of constraints288
Number of domains10
Minimum domain size1
Maximum domain size15
Distribution of domain sizes[{"size":1,"count":14},{"size":2,"count":96},{"size":6,"count":42},{"size":15,"count":10}]
Minimum variable degree2
Maximum variable degree18
Distribution of variable degrees[{"degree":2,"count":82},{"degree":3,"count":10},{"degree":8,"count":2},{"degree":9,"count":7},{"degree":10,"count":1},{"degree":11,"count":3},{"degree":12,"count":6},{"degree":13,"count":7},{"degree":14,"count":11},{"degree":15,"count":9},{"degree":16,"count":12},{"degree":17,"count":11},{"degree":18,"count":1}]
Minimum constraint arity2
Maximum constraint arity15
Distribution of constraint arities[{"arity":2,"count":84},{"arity":3,"count":120},{"arity":5,"count":1},{"arity":6,"count":73},{"arity":15,"count":10}]
Number of extensional constraints28
Number of intensional constraints46
Distribution of constraint types[{"type":"extension","count":28},{"type":"intension","count":46},{"type":"regular","count":120},{"type":"sum","count":10},{"type":"count","count":83},{"type":"instantiation","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297517OPT1202 43.9415 6.4818
OscaR - Parallel with EPS 2018-08-14 (complete)4308873Wrong Opt.1207 23.5098 5.0193
OscaR - Parallel with EPS 2018-07-02 (complete)4291104Wrong Cert. 17.3886 4.77248

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: 1202
Solution found:
<instantiation> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3]
x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[6][0]
x[6][1] x[6][2] x[6][3] x[6][4] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[9][0] x[9][1] x[9][2]
x[9][3] x[9][4] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[11][0] x[11][1] x[11][2] x[11][3] x[11][4] x[12][0] x[12][1] x[12][2]
x[12][3] x[12][4] x[13][0] x[13][1] x[13][2] x[13][3] x[13][4] 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] ds[0][0] ds[0][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] ds[10][0] ds[10][1] ds[11][0] ds[11][1] ds[12][0] ds[12][1] ds[13][0]
ds[13][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] 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] cf[0] cf[1] cc[0][0] cc[0][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] cc[10][0] cc[10][1] cc[11][0]
cc[11][1] cc[12][0] cc[12][1] cc[13][0] cc[13][1] </list> <values>1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 0 0 1 0 0 1 1 0 0 1 1 1 0 1 1 0 0
0 1 0 0 0 1 0 0 0 1 1 0 1 1 1 0 0 1 1 0 0 0 0 0 0 1 1 0 0 1 1 1 0 9 5 9 5 8 6 8 6 9 5 3 2 5 0 4 1 3 2 4 1 2 3 1 4 4 1 4 1 2 3 2 3 4 1 3 2 2
3 0 1 0 1 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 100 0 0 0 0 0 200 0 300 0 100 0 100 0 100 0 0 0 0 0 200 0 100 0 </values>
</instantiation>