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

Result page for benchmark
OpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-nrwsLarge-4-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-nrwsLarge-4-1.xml
MD5SUMfb1196d60740a5b5329aac25a5f07e84
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark12
Best CPU time to get the best result obtained on this benchmark899.249
Satisfiable
(Un)Satisfiability was proved
Number of variables1860
Number of constraints1831
Number of domains6
Minimum domain size2
Maximum domain size31
Distribution of domain sizes[{"size":2,"count":1200},{"size":7,"count":90},{"size":8,"count":30},{"size":9,"count":480},{"size":30,"count":30},{"size":31,"count":30}]
Minimum variable degree2
Maximum variable degree21
Distribution of variable degrees[{"degree":2,"count":650},{"degree":3,"count":1180},{"degree":21,"count":30}]
Minimum constraint arity2
Maximum constraint arity30
Distribution of constraint arities[{"arity":2,"count":620},{"arity":3,"count":1180},{"arity":21,"count":30},{"arity":30,"count":1}]
Number of extensional constraints600
Number of intensional constraints600
Distribution of constraint types[{"type":"extension","count":600},{"type":"intension","count":600},{"type":"allDifferent","count":1},{"type":"sum","count":30},{"type":"element","count":600}]
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)4407622OPT12 899.249 899.284
cosoco 2.0 (complete)4397616SAT (TO)19 2400.05 2400.11
cosoco 2 (complete)4394707SAT (TO)19 2400.09 2400.01
cosoco 2.0 (complete)4408876SAT (TO)19 2400.11 2399.9

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: 12
Solution found:
<instantiation> <list> so[] np[][] r[][] p[] o[][]  </list> <values> 5 7 8 12 12 12 12 12 12 12 11 12 12 12 12 11 11 11 11 12 10 10 10 10 10
10 10 9 9 7  1 2 3 4 4 4 5 6 6 6 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 0 0 0 0 0 0 0 0 0 0 0 0 1 2 2 2 3 4 4 4 5 5 5 5 5 6 6 6 7 8 0 1 2 2
2 3 4 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 0 0 0 1 1 1 1 1 1 2 3 3 4 4 5 5 6 6 6 6 6 6 6 6 6 6 7 7 7 8 0 0 0 1 2 2 2 2 2 3 3 4 4 4
5 5 6 7 7 8 8 8 8 8 8 8 8 8 8 8 0 0 0 0 0 0 0 0 0 0 0 1 2 2 2 2 3 3 3 4 5 5 5 6 7 7 7 7 7 8 1 1 1 1 2 3 4 5 5 6 6 7 8 8 8 8 8 8 8 8 8 8 8 8
8 8 8 8 8 8 1 1 2 3 4 4 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 0 1 2 2 3 3 4 5 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 1 1 2 3 3 3 3 3 4 5 5 6 7 8 8 1 1 2 3 4 4 5 5 5 5 5 5 6 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 0 0 0 1 2 3 4 4 4 5 5 6 7 7
7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 2 2 2 3 3 3 4 5 5 5 6 6 7 8 0 0 0 0 0 0 0 0 0 1 2 3 4 5 5 5 5 5 5 6 7 7 7 7
7 7 8 8 8 8 1 2 3 4 4 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 0 0 0 1 2 2 3 3 3 3 4 4 5 6 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 0 0 1 2
3 4 4 4 4 4 5 6 6 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 4 4 5 5 5 5 5 5 6 6 6 7 7 7 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 2 3 3 3 3 4 5 6 7 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 5 6 7 7 7 7 7 8 8  1 1 1 1 0 0 1 1 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 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 0 0 0 0 1 0 0 1 1 0 1 1 0 0 1 1 1 0 0 1 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 0 0 0 1 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0
0 0 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 1 0 1 0 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 0 0 0 0 0 1 0 1 1 0 0 0 0 1 1 0 1 1 1 0 1 0 1 1
1 0 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 1 1 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 1 0 0 1 0 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 1 1 1 1 0 1 0 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 1 0 1 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 0 1 0 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 1 1 1 0 0 1 0 0 0 0 0 1 0 0 1 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 0 0 0 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 0 0 0 0 1 0  4 23 24 7 29 10 14 28 12 2 5 6 13 1 16 15 26 22 20 19 21 0 18 17 3 11 9 8 27 25  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 1 1 1 1 1 1 1 1 1 1 1 1 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 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 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 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 0 0 0 0 0 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 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 1 1 1 1 1 1 1 1 1 1 1 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 1 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 1 1 1 1 1 1 1 1 1 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 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 1 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 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 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 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 1 1 0   </values> </instantiation>