2019 XCSP3 competition: main track (CSP and COP, 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.4726
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)4395340OPT5 26.4726 26.4764
choco-solver 2019-09-16 (complete)4399320OPT5 185.749 47.0606
AbsCon 2019-07-23 (complete)4390960OPT5 187.762 183
choco-solver 2019-09-20 (complete)4403820OPT5 190.348 48.2156
choco-solver 2019-06-14 (complete)4393360OPT5 199.478 50.5378
choco-solver 2019-09-20 parallel (complete)4404720OPT5 401.169 51.1247
choco-solver 2019-09-16 parallel (complete)4399920OPT5 405.017 51.592
choco-solver 2019-09-24 parallel (complete)4407120OPT5 407.476 51.8961
choco-solver 2019-06-14 parallel (complete)4393960OPT5 431.628 55.2614
choco-solver 2019-09-24 (complete)4406220OPT5 687.702 682.412
Concrete 3.10 (complete)4387156OPT5 919.399 887.946
Concrete 3.12.2 (complete)4401120OPT5 1549.91 1509.39
Concrete 3.12.3 (complete)4402920OPT5 2124.3 2076.13
Concrete 3.12.2 (complete)4396240SAT (TO)5 2520.1 2471.63
cosoco 2.O parallel (complete)4398420SAT (TO)5 20124.8 2520.02
cosoco 2 (complete)4389860SAT (TO)6 2519.68 2520
cosoco 2.0 (complete)4397140SAT (TO)6 2520.07 2520.01
cosoco 2.0 (complete)4408400SAT (TO)6 2520.08 2519.8
cosoco 2.0 parallel (complete)4409680SAT (TO)6 20125.5 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> so[] p[] np[][] o[][] r[][]  </list> <values> 2 3 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 4 3 2  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 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 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  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   </values> </instantiation>