2019 XCSP3 competition: fast COP 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.9384
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
PicatSAT 2019-09-12 (complete)4395640OPT5 26.9384 26.9412
choco-solver 2019-06-14 (complete)4394260OPT5 186.518 47.2581
choco-solver 2019-09-20 (complete)4404120OPT5 192.345 48.7411
choco-solver 2019-09-16 (complete)4400520OPT5 193.74 49.5253
AbsCon 2019-07-23 (complete)4391260OPT5 210.856 205.406
choco-solver 2019-09-16 parallel (complete)4400220OPT5 363.824 46.4293
choco-solver 2019-09-24 parallel (complete)4407420OPT5 387.221 49.3309
choco-solver 2019-09-20 parallel (complete)4405020OPT5 407.926 51.9742
choco-solver 2019-06-14 parallel (complete)4394560OPT5 411.912 52.5208
choco-solver 2019-09-24 (complete)4406520OPT5 684.23 678.361
Concrete 3.10 (complete)4392160OPT5 1158.13 1122.85
Concrete 3.12.3 (complete)4403220OPT5 1811.16 1768.4
cosoco 2.O parallel (complete)4398720SAT (TO)5 2011.62 252.023
cosoco 2.0 parallel (complete)4409980SAT (TO)5 2011.88 252.023
Concrete 3.12.2 (complete)4401420SAT (TO)5 2400.07 2345.23
Concrete 3.12.2 (complete)4396540SAT (TO)5 2400.13 2357.83
cosoco 2 (complete)4390360SAT (TO)6 2400.01 2400.01
cosoco 2.0 (complete)4409080SAT (TO)6 2400.07 2400.11
cosoco 2.0 (complete)4397820SAT (TO)6 2400.08 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: 5
Solution found:
<instantiation> <list> so[] np[][] r[][] p[] o[][]  </list> <values> 2 3 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 4 3 2  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   </values> </instantiation>