2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-wbop-10-20-1.xml
MD5SUM81c67383229f275c0057c3a1b360ed12
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 benchmark26.7637
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
(reference) PicatSAT 2019-09-12 (complete)4407630OPT5 26.7637 26.7606
cosoco 2.0 (complete)4408815SAT (TO)6 2400.01 2399.8
cosoco 2.0 (complete)4397555SAT (TO)6 2400.02 2399.7
cosoco 2 (complete)4394715SAT (TO)6 2400.07 2400.3

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