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

Result page for benchmark
OpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-wbo-10-30-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-wbo-10-30-1.xml
MD5SUM4c43adae21bac384dbb29a10e46c8da1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark6
Best CPU time to get the best result obtained on this benchmark82.6905
Satisfiable
(Un)Satisfiability was proved
Number of variables960
Number of constraints931
Number of domains8
Minimum domain size2
Maximum domain size31
Distribution of domain sizes[{"size":2,"count":600},{"size":5,"count":30},{"size":6,"count":90},{"size":7,"count":60},{"size":8,"count":90},{"size":9,"count":30},{"size":30,"count":30},{"size":31,"count":30}]
Minimum variable degree2
Maximum variable degree11
Distribution of variable degrees[{"degree":2,"count":340},{"degree":3,"count":590},{"degree":11,"count":30}]
Minimum constraint arity2
Maximum constraint arity30
Distribution of constraint arities[{"arity":2,"count":310},{"arity":3,"count":590},{"arity":11,"count":30},{"arity":30,"count":1}]
Number of extensional constraints300
Number of intensional constraints300
Distribution of constraint types[{"type":"extension","count":300},{"type":"intension","count":300},{"type":"allDifferent","count":1},{"type":"sum","count":30},{"type":"element","count":300}]
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)4407624OPT6 82.6905 82.6813
cosoco 2.0 (complete)4408839SAT (TO)7 2400.01 2399.7
cosoco 2 (complete)4394709SAT (TO)7 2400.06 2399.9
cosoco 2.0 (complete)4397579SAT (TO)7 2400.08 2400.11

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