2018 XCSP3 competition: sequential solvers tracks: 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 benchmark7.02875
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
Sat4j-CSP 2018-07-11 (complete)4289907OPT607 7.02875 3.60197
Mistral-2.0 2018-08-01 (complete)4303706OPT607 7.77782 7.77928
Mistral-2.0 2018-06-15 (complete)4289289OPT607 7.84688 7.86247
PicatSAT 2018-06-15 (complete)4292964OPT607 18.0245 18.0305
PicatSAT 2018-08-14 (complete)4309460OPT607 18.4197 18.4194
cosoco 1.12 (complete)4292963OPT607 20.8582 20.8595
PicatSAT 2018-08-02 (complete)4303120OPT607 21.0339 21.042
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311674OPT607 44.1031 39.416
OscaR - Hybrid 2018-08-14 (complete)4308524OPT607 47.7975 43.7522
OscaR - Hybrid 2018-07-02 (complete)4291592OPT607 48.2418 44.7642
Choco-solver 4.0.7 seq (493a269) (complete)4292350OPT607 134.022 129.177
Choco-solver 4.0.7b seq (e747e1e) (complete)4306644OPT607 134.962 129.748
Concrete 3.8-SuperNG 2018-06-13 (complete)4292962OPT607 142.389 128.293
Concrete 3.8 2018-06-13 (complete)4292961OPT607 232.457 216.852
Concrete 3.9.2-SuperNG (complete)4304170OPT607 234.792 218.742
Concrete 3.9.2 (complete)4304169OPT607 339.207 321.21
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290394SAT (TO)607 2400.04 2370.52
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307938SAT (TO)607 2520.03 2492.81

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="optimum" cost="607"> <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[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] 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] 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] 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] wk[5][0] wk[5][1] wk[6][0]
wk[6][1] wk[7][0] wk[7][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] cn[14] cn[15] cn[16]
cn[17] cn[18] cn[19] cn[20] cf[0] cf[1] cf[2] cf[3] cf[4] 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 1 0 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 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 1 1 0 1 0 1 0 1 0 1 1 0 1 1 1 1 0 0 1 0 1 0 1 0 0 0 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1
9 5 9 5 8 6 7 7 9 5 7 7 8 6 8 6 5 3 7 1 6 2 4 4 5 3 3 5 4 4 6 2 6 2 4 4 2 6 5 3 4 4 4 4 0 1 0 1 1 0 1 0 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0 1 1 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 200 0 100 0 0 0 100 0 0 0 0 0 0 0 200 0 0 0 </values> </instantiation>