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-pb-30-15-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1c-s1/
OpenStacks-m1c-pb-30-15-1.xml
MD5SUM200d8ff13be0114d953e34120514972f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark14
Best CPU time to get the best result obtained on this benchmark66.689
Satisfiable
(Un)Satisfiability was proved
Number of variables1380
Number of constraints1366
Number of domains8
Minimum domain size2
Maximum domain size16
Distribution of domain sizes[{"size":2,"count":960},{"size":3,"count":120},{"size":4,"count":165},{"size":5,"count":60},{"size":6,"count":15},{"size":7,"count":30},{"size":15,"count":15},{"size":16,"count":15}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":495},{"degree":3,"count":870},{"degree":31,"count":15}]
Minimum constraint arity2
Maximum constraint arity31
Distribution of constraint arities[{"arity":2,"count":480},{"arity":3,"count":870},{"arity":15,"count":1},{"arity":31,"count":15}]
Number of extensional constraints450
Number of intensional constraints450
Distribution of constraint types[{"type":"extension","count":450},{"type":"intension","count":450},{"type":"allDifferent","count":1},{"type":"sum","count":15},{"type":"element","count":450}]
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)4395435OPT14 66.689 66.6837
choco-solver 2019-09-16 (complete)4399415OPT14 122.237 31.0657
choco-solver 2019-06-14 (complete)4393455OPT14 133.338 33.8591
AbsCon 2019-07-23 (complete)4391055OPT14 147.836 141.81
choco-solver 2019-09-20 (complete)4403915OPT14 151.123 38.7702
choco-solver 2019-09-24 (complete)4406315OPT14 178.767 173.229
choco-solver 2019-09-16 parallel (complete)4400015OPT14 223.579 28.929
choco-solver 2019-09-20 parallel (complete)4404815OPT14 225.037 29.1255
choco-solver 2019-09-24 parallel (complete)4407215OPT14 253.205 32.6466
choco-solver 2019-06-14 parallel (complete)4394055OPT14 281.86 36.2325
Concrete 3.12.2 (complete)4396335SAT (TO)14 2520.07 2474.93
Concrete 3.12.2 (complete)4401215SAT (TO)14 2520.1 2467.34
Concrete 3.10 (complete)4387502SAT (TO)14 2520.11 2457.83
Concrete 3.12.3 (complete)4403015SAT (TO)14 2520.12 2466.94
cosoco 2.O parallel (complete)4398515SAT (TO)14 20120.4 2520.02
cosoco 2.0 parallel (complete)4409775SAT (TO)14 20123.6 2520.02
cosoco 2 (complete)4389955? (TO) 2519.93 2520.01
cosoco 2.0 (complete)4397235? (TO) 2519.94 2520.01
cosoco 2.0 (complete)4408495? (TO) 2520.04 2520

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