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

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

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbop-10-20-1.xml
MD5SUM4579a6cf23fef813b27c8fe20d1b5728
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 benchmark27.9208
Satisfiable
(Un)Satisfiability was proved
Number of variables640
Number of constraints621
Number of domains4
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":400},{"size":5,"count":200},{"size":20,"count":20},{"size":21,"count":20}]
Minimum variable degree2
Maximum variable degree11
Distribution of variable degrees[{"degree":2,"count":230},{"degree":3,"count":390},{"degree":11,"count":20}]
Minimum constraint arity2
Maximum constraint arity20
Distribution of constraint arities[{"arity":2,"count":210},{"arity":3,"count":390},{"arity":11,"count":20},{"arity":20,"count":1}]
Number of extensional constraints200
Number of intensional constraints200
Distribution of constraint types[{"type":"extension","count":200},{"type":"intension","count":200},{"type":"allDifferent","count":1},{"type":"sum","count":20},{"type":"element","count":200}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395644OPT5 27.9208 27.9328
choco-solver 2019-09-16 (complete)4400524OPT5 185.19 46.9069
AbsCon 2019-07-23 (complete)4391264OPT5 185.342 180.883
choco-solver 2019-09-20 (complete)4404124OPT5 190.807 48.3465
choco-solver 2019-06-14 (complete)4394264OPT5 225.061 57.117
choco-solver 2019-09-20 parallel (complete)4405024OPT5 266.334 34.1827
choco-solver 2019-06-14 parallel (complete)4394564OPT5 330.736 42.7967
choco-solver 2019-09-16 parallel (complete)4400224OPT5 382.133 48.6729
choco-solver 2019-09-24 parallel (complete)4407424OPT5 437.004 55.7308
choco-solver 2019-09-24 (complete)4406524OPT5 804.555 797.693
Concrete 3.10 (complete)4392164OPT5 1139.32 1103.83
cosoco 2.0 parallel (complete)4409984SAT (TO)5 2011.49 252.024
Concrete 3.12.2 (complete)4396544SAT (TO)5 2400.04 2352.93
Concrete 3.12.2 (complete)4401424SAT (TO)5 2400.05 2347.34
Concrete 3.12.3 (complete)4403224SAT (TO)5 2400.07 2347.33
cosoco 2.O parallel (complete)4398724SAT (TO)6 2011.15 252.017
cosoco 2 (complete)4390364SAT (TO)6 2400.02 2400.11
cosoco 2.0 (complete)4409084SAT (TO)6 2400.08 2400.3
cosoco 2.0 (complete)4397824SAT (TO)6 2400.09 2400.2

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> <list> p[] o[][] so[] np[][] r[][]  </list> <values> 0 1 9 13 15 16 4 10 19 18 17 8 5 2 3 12 14 11 7 6  0 0 0 1 1 1 1 1 1 1
1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 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 1 1 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
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 1 1 1 1 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 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 0 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0  2 3 4 5 4 5 5 5 5 5 5 5 5 5 5 4 4 4 3 2
 0 0 0 1 2 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 0 0 0 0 0 1 2 2 2 3 3 3 3 3 3 3 3 4 4 4 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 2 3 3 4 4 0 0 1 1 1 1 1 2 3 3
4 4 4 4 4 4 4 4 4 4 1 1 1 1 1 1 2 3 3 3 3 4 4 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 2 2 2 3 4
1 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 2 3 3 4 0 1 1 1 2 2 2 2 3 4 4 4 4 4 4 4 4 4 4 4  0 0 0 1 1 1 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 1 0 1 0 0 0 1 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 1 1 0 0 0 1 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 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 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 0 0 0 0 0 0 0 1 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0   </values> </instantiation>