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

Result page for benchmark
OpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbp-15-15-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbp-15-15-1.xml
MD5SUMa951848c4e631b36882baf30b58f4449
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark15.7178
Satisfiable
(Un)Satisfiability was proved
Number of variables705
Number of constraints691
Number of domains4
Minimum domain size2
Maximum domain size16
Distribution of domain sizes[{"size":2,"count":450},{"size":3,"count":225},{"size":15,"count":15},{"size":16,"count":15}]
Minimum variable degree2
Maximum variable degree16
Distribution of variable degrees[{"degree":2,"count":255},{"degree":3,"count":435},{"degree":16,"count":15}]
Minimum constraint arity2
Maximum constraint arity16
Distribution of constraint arities[{"arity":2,"count":240},{"arity":3,"count":435},{"arity":15,"count":1},{"arity":16,"count":15}]
Number of extensional constraints225
Number of intensional constraints225
Distribution of constraint types[{"type":"extension","count":225},{"type":"intension","count":225},{"type":"allDifferent","count":1},{"type":"sum","count":15},{"type":"element","count":225}]
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)4407878OPT4 15.7178 15.7196
cosoco 2 (complete)4394823SAT (TO)4 2400.01 2399.7
cosoco 2.0 (complete)4408809SAT (TO)4 2400.02 2400.11
cosoco 2.0 (complete)4397549SAT (TO)4 2400.02 2399.7

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