2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
OpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbop-10-20-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-wbop-10-20-1.xml
MD5SUM4579a6cf23fef813b27c8fe20d1b5728
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 benchmark27.9238
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)4395344OPT5 27.9238 27.9259
choco-solver 2019-09-16 (complete)4399324OPT5 179.091 45.3672
AbsCon 2019-07-23 (complete)4390964OPT5 186.083 181.511
choco-solver 2019-06-14 (complete)4393364OPT5 205.549 52.0882
choco-solver 2019-09-20 (complete)4403824OPT5 210.454 53.2978
choco-solver 2019-09-24 parallel (complete)4407124OPT5 390.808 49.7856
choco-solver 2019-09-16 parallel (complete)4399924OPT5 392.599 50.2303
choco-solver 2019-09-20 parallel (complete)4404724OPT5 398.39 50.7731
choco-solver 2019-06-14 parallel (complete)4393964OPT5 461.889 58.8854
choco-solver 2019-09-24 (complete)4406224OPT5 721.863 715.713
Concrete 3.10 (complete)4387504OPT5 872.401 841.127
Concrete 3.12.2 (complete)4401124OPT5 1308.3 1272.31
Concrete 3.12.3 (complete)4402924OPT5 1758.9 1717.34
Concrete 3.12.2 (complete)4396244SAT (TO)5 2520.09 2475.73
cosoco 2.O parallel (complete)4398424SAT (TO)5 20123.3 2520.02
cosoco 2 (complete)4389864SAT (TO)6 2519.96 2520.01
cosoco 2.0 (complete)4397144SAT (TO)6 2520.03 2519.7
cosoco 2.0 (complete)4408404SAT (TO)6 2520.03 2519.7
cosoco 2.0 parallel (complete)4409684SAT (TO)6 20125 2520.02

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