2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
OpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbp-15-15-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbp-15-15-1.xml
MD5SUM7f3a0b8bae0e1da0b41ee1d30bebf3d5
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark0.074662
Satisfiable
(Un)Satisfiability was proved
Number of variables285
Number of constraints271
Number of domains3
Minimum domain size2
Maximum domain size16
Distribution of domain sizes[{"size":2,"count":225},{"size":15,"count":45},{"size":16,"count":15}]
Minimum variable degree2
Maximum variable degree16
Distribution of variable degrees[{"degree":2,"count":240},{"degree":3,"count":5},{"degree":5,"count":7},{"degree":7,"count":1},{"degree":9,"count":2},{"degree":16,"count":30}]
Minimum constraint arity3
Maximum constraint arity16
Distribution of constraint arities[{"arity":3,"count":255},{"arity":15,"count":1},{"arity":16,"count":15}]
Number of extensional constraints225
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":225},{"type":"allDifferent","count":1},{"type":"sum","count":15},{"type":"minimum","count":15},{"type":"maximum","count":15}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2017-07-28 (complete)4259114OPT4 0.074662 0.15691
cosoco-sat 1.12 (complete)4267036OPT4 0.90115798 0.905927
AbsCon-basic 2017-06-11 (complete)4257623OPT4 2.5095899 1.08743
cosoco 1.12 (complete)4268967OPT4 2.6566 2.6570499
cosoco 1.1 (complete)4258617OPT4 2.66359 2.7179101
choco-solver 4.0.5 seq (2017-08-18) (complete)4283187OPT4 7.86796 3.81094
choco-solver 4.0.5 seq (2017-08-09) (complete)4270437OPT4 8.0220098 4.02776
choco-solver 4.0.5 seq (2017-07-26) (complete)4254144OPT4 8.0305204 3.98473
choco-solver 4.0.5 par (2017-08-18) (complete)4281717OPT4 8.7194204 1.76405
choco-solver 4.0.5 par (2017-07-26) (complete)4254641OPT4 9.3687401 1.94856
choco-solver 4.0.5 par (2017-08-09) (complete)4271907OPT4 12.0601 2.15115
choco-solver 5a (2017-07-26) (complete)4255138OPT4 13.7449 7.24053
choco-solver 5a (2017-08-18) (complete)4284657OPT4 15.9405 7.4341898
OscaR - Conflict Ordering 2017-07-26 (complete)4256132OPT4 24.534401 20.250299
OscaR - Parallel with EPS 2017-07-26 (complete)4257126OPT4 63.538799 9.7333803
OscaR - Parallel with EPS 2017-08-22 (complete)4286127OPT4 72.176201 10.8491
Concrete 3.4 (complete)4259611OPT4 118.906 106.325
OscaR - Hybrid 2017-07-26 (complete)4256629OPT4 218.855 208.13901
OscaR - ALNS 2017-07-26 (complete)4255635SAT (TO)4 250.411 240.02
sat4j-CSP 2017-07-05 (complete)4258120SAT (TO)8 245.46001 240.22701

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: 4
Solution found:
<instantiation type="optimum" cost="4"> <list> p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] min[0] min[1]
min[2] min[3] min[4] min[5] min[6] min[7] min[8] min[9] min[10] min[11] min[12] min[13] min[14] max[0] max[1] max[2] max[3] max[4] max[5]
max[6] max[7] max[8] max[9] max[10] max[11] max[12] max[13] max[14] o[0][0] o[0][1] o[0][2] o[0][3] o[0][4] o[0][5] o[0][6] o[0][7] o[0][8]
o[0][9] o[0][10] o[0][11] o[0][12] o[0][13] o[0][14] o[1][0] o[1][1] o[1][2] o[1][3] o[1][4] o[1][5] o[1][6] o[1][7] o[1][8] o[1][9]
o[1][10] o[1][11] o[1][12] o[1][13] o[1][14] o[2][0] o[2][1] o[2][2] o[2][3] o[2][4] o[2][5] o[2][6] o[2][7] o[2][8] o[2][9] o[2][10]
o[2][11] o[2][12] o[2][13] o[2][14] o[3][0] o[3][1] o[3][2] o[3][3] o[3][4] o[3][5] o[3][6] o[3][7] o[3][8] o[3][9] o[3][10] o[3][11]
o[3][12] o[3][13] o[3][14] o[4][0] o[4][1] o[4][2] o[4][3] o[4][4] o[4][5] o[4][6] o[4][7] o[4][8] o[4][9] o[4][10] o[4][11] o[4][12]
o[4][13] o[4][14] o[5][0] o[5][1] o[5][2] o[5][3] o[5][4] o[5][5] o[5][6] o[5][7] o[5][8] o[5][9] o[5][10] o[5][11] o[5][12] o[5][13]
o[5][14] o[6][0] o[6][1] o[6][2] o[6][3] o[6][4] o[6][5] o[6][6] o[6][7] o[6][8] o[6][9] o[6][10] o[6][11] o[6][12] o[6][13] o[6][14]
o[7][0] o[7][1] o[7][2] o[7][3] o[7][4] o[7][5] o[7][6] o[7][7] o[7][8] o[7][9] o[7][10] o[7][11] o[7][12] o[7][13] o[7][14] o[8][0] o[8][1]
o[8][2] o[8][3] o[8][4] o[8][5] o[8][6] o[8][7] o[8][8] o[8][9] o[8][10] o[8][11] o[8][12] o[8][13] o[8][14] o[9][0] o[9][1] o[9][2] o[9][3]
o[9][4] o[9][5] o[9][6] o[9][7] o[9][8] o[9][9] o[9][10] o[9][11] o[9][12] o[9][13] o[9][14] o[10][0] o[10][1] o[10][2] o[10][3] o[10][4]
o[10][5] o[10][6] o[10][7] o[10][8] o[10][9] o[10][10] o[10][11] o[10][12] o[10][13] o[10][14] o[11][0] o[11][1] o[11][2] o[11][3] o[11][4]
o[11][5] o[11][6] o[11][7] o[11][8] o[11][9] o[11][10] o[11][11] o[11][12] o[11][13] o[11][14] o[12][0] o[12][1] o[12][2] o[12][3] o[12][4]
o[12][5] o[12][6] o[12][7] o[12][8] o[12][9] o[12][10] o[12][11] o[12][12] o[12][13] o[12][14] o[13][0] o[13][1] o[13][2] o[13][3] o[13][4]
o[13][5] o[13][6] o[13][7] o[13][8] o[13][9] o[13][10] o[13][11] o[13][12] o[13][13] o[13][14] o[14][0] o[14][1] o[14][2] o[14][3] o[14][4]
o[14][5] o[14][6] o[14][7] o[14][8] o[14][9] o[14][10] o[14][11] o[14][12] o[14][13] o[14][14] so[0] so[1] so[2] so[3] so[4] so[5] so[6]
so[7] so[8] so[9] so[10] so[11] so[12] so[13] so[14] </list> <values> 4 1 7 9 12 8 2 11 10 3 5 13 6 14 0 0 1 4 9 5 8 1 6 6 10 0 2 11 5 12 2
4 5 11 8 10 5 11 9 11 1 3 14 7 13 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0
0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 2 4 4 3 3 4 4 4 4 4 4 4 2 2 1 </values> </instantiation>