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

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

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-wbp-15-15-1.xml
MD5SUM5e70d8b90a79902ca57f9a23b37af6a1
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.6429
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
PicatSAT 2019-09-12 (complete)4395508OPT4 15.6429 15.6429
choco-solver 2019-09-16 (complete)4400388OPT4 15.739 4.46096
choco-solver 2019-09-24 (complete)4406388OPT4 18.703 13.7594
choco-solver 2019-09-20 (complete)4403988OPT4 21.3642 5.74879
choco-solver 2019-06-14 (complete)4394128OPT4 22.1178 5.94878
choco-solver 2019-06-14 parallel (complete)4394428OPT4 25.6263 4.02088
choco-solver 2019-09-24 parallel (complete)4407288OPT4 28.278 4.62037
choco-solver 2019-09-20 parallel (complete)4404888OPT4 37.7582 5.51309
choco-solver 2019-09-16 parallel (complete)4400088OPT4 41.0228 6.02217
AbsCon 2019-07-23 (complete)4391128OPT4 41.3626 36.162
Concrete 3.12.2 (complete)4401288OPT4 502.218 482.028
Concrete 3.12.3 (complete)4403088OPT4 2055.22 2013.24
Concrete 3.12.2 (complete)4396408OPT4 2238.68 2200.37
cosoco 2.O parallel (complete)4398588SAT (TO)4 2011.79 252.022
cosoco 2.0 parallel (complete)4409848SAT (TO)4 2011.91 252.023
cosoco 2 (complete)4390228SAT (TO)4 2400.04 2400.11
cosoco 2.0 (complete)4408948SAT (TO)4 2400.07 2400.6
cosoco 2.0 (complete)4397688SAT (TO)4 2400.08 2400.5
Concrete 3.10 (complete)4392028SAT (TO)4 2400.09 2344.83

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