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

Result page for benchmark
OpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbop-10-20-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbop-10-20-1.xml
MD5SUMd4812570331b0d4fd95926de7f20690d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark5
Best CPU time to get the best result obtained on this benchmark59.030499
Satisfiable
(Un)Satisfiability was proved
Number of variables260
Number of constraints241
Number of domains3
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":200},{"size":20,"count":40},{"size":21,"count":20}]
Minimum variable degree2
Maximum variable degree21
Distribution of variable degrees[{"degree":2,"count":220},{"degree":5,"count":20},{"degree":21,"count":20}]
Minimum constraint arity3
Maximum constraint arity20
Distribution of constraint arities[{"arity":3,"count":200},{"arity":5,"count":20},{"arity":11,"count":20},{"arity":20,"count":1}]
Number of extensional constraints200
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":200},{"type":"allDifferent","count":1},{"type":"sum","count":20},{"type":"minimum","count":10},{"type":"maximum","count":10}]
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)4259111OPT5 59.030499 59.1175
choco-solver 4.0.5 par (2017-07-26) (complete)4254638OPT5 496.245 63.005901
choco-solver 4.0.5 par (2017-08-18) (complete)4281714OPT5 645.72699 81.629601
OscaR - Parallel with EPS 2017-08-22 (complete)4286124OPT5 1712.15 230.183
cosoco-sat 1.12 (complete)4267033SAT (TO)5 240.013 240.00999
AbsCon-basic 2017-06-11 (complete)4257620SAT (TO)5 243.71201 240.01199
choco-solver 4.0.5 seq (2017-08-09) (complete)4270434SAT (TO)5 243.935 240.021
choco-solver 4.0.5 seq (2017-07-26) (complete)4254141SAT (TO)5 243.96001 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4283184SAT (TO)5 244.129 240.02299
choco-solver 5a (2017-07-26) (complete)4255135SAT (TO)5 248.77 240.00999
choco-solver 5a (2017-08-18) (complete)4284654SAT (TO)5 250.39101 240.021
OscaR - Hybrid 2017-07-26 (complete)4256626SAT (TO)5 251.25 240.015
OscaR - ALNS 2017-07-26 (complete)4255632SAT (TO)5 251.87601 240.02699
cosoco 1.1 (complete)4258614SAT (TO)5 251.895 252.00999
cosoco 1.12 (complete)4268964SAT (TO)5 251.94099 252.009
Concrete 3.4 (complete)4259608SAT (TO)5 256.388 240.033
OscaR - Parallel with EPS 2017-07-26 (complete)4257123SAT (TO)5 1921.3 244.015
choco-solver 4.0.5 par (2017-08-09) (complete)4271904SAT (TO)5 2005.79 252.054
OscaR - Conflict Ordering 2017-07-26 (complete)4256129SAT (TO)7 246.022 240.02299
sat4j-CSP 2017-07-05 (complete)4258117? (TO) 249.834 240.22501

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