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

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m1-s1/
OpenStacks-m1-pb-30-15-1.xml
MD5SUM1892dc6bbe7f4411da75bff22067cf15
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 benchmark69.5267
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)4395342OPT14 69.5267 69.5358
choco-solver 2019-09-20 (complete)4403822OPT14 119.659 30.5305
AbsCon 2019-07-23 (complete)4390962OPT14 148.641 142.891
choco-solver 2019-09-16 (complete)4399322OPT14 151.006 38.3122
choco-solver 2019-06-14 (complete)4393362OPT14 156.88 39.7615
choco-solver 2019-09-24 (complete)4406222OPT14 171.58 166.712
choco-solver 2019-09-16 parallel (complete)4399922OPT14 223.48 29.3176
choco-solver 2019-09-20 parallel (complete)4404722OPT14 230.502 29.8205
choco-solver 2019-06-14 parallel (complete)4393962OPT14 241.586 31.1991
choco-solver 2019-09-24 parallel (complete)4407122OPT14 265.407 34.3508
Concrete 3.10 (complete)4387153OPT14 1876.06 1824.51
Concrete 3.12.2 (complete)4401122SAT (TO)14 2520.07 2464.54
Concrete 3.12.2 (complete)4396242SAT (TO)14 2520.12 2476.83
Concrete 3.12.3 (complete)4402922SAT (TO)14 2520.13 2465.23
cosoco 2.0 parallel (complete)4409682SAT (TO)14 20120.8 2520.02
cosoco 2.O parallel (complete)4398422SAT (TO)14 20121.6 2520.02
cosoco 2.0 (complete)4408402? (TO) 2519.8 2520.01
cosoco 2 (complete)4389862? (TO) 2520.05 2520.01
cosoco 2.0 (complete)4397142? (TO) 2520.06 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> p[] so[] o[][] np[][] r[][]  </list> <values> 6 5 7 1 12 2 14 9 8 10 11 3 4 13 0  5 11 11 14 13 14 14 14 13 14 14 11
13 10 8  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 1 0 0 0 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 1 1 1 1 0 0 0 0 0 0
0 0 0 1 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 1 1 1 1 1 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 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 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 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 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 1 1 1 0 0 0 1 1 1 1 1 1 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 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 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 0 0 0 0 0 1 1 1 1 0 0 0 0 0
0 0 0 0 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 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 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  0 1 1 1 1 1 2 2 3 3 3 3 4 5 6 0 1 1 1 1 1 1 1 1 1 2 2 2 2 2 0 0 0 0 0 0
0 0 0 1 2 2 2 2 3 0 0 0 0 0 0 0 0 0 0 0 1 2 2 3 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 1 1 2 2 0 0 0 0 0 0 1 1 2 2 3 3 3 3 3 0
0 0 0 0 0 1 1 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 1 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 4
5 5 5 6 0 0 0 0 0 0 0 0 0 0 0 0 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 0 1 1 2 3 0 0 0 0 0 0 0 0 0 0 1 1 1 1 2 0 0 0 1 1 1
2 2 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 4 4 0 0 0 1 1 1 2 3 3 3 4 4 4 4 4 1 1 1 1 2 2 2 2 2 2 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 1 1 1 2 2 2 2 2 0 0 0 0 0 1 1 1 2 2 2 3 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 0 1 2 2 2 2 2 3 3 3 3
3 3 3 4 0 0 0 0 1 1 2 2 3 3 3 4 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 0 1 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 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 1 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 1 0 1 0 1 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 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 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 0 1 0 0 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 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0 1 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 1 0 0
0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0 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 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 1 1 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   </values> </instantiation>