2019 XCSP3 competition: fast COP track (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.789
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)4395642OPT14 69.789 69.7956
choco-solver 2019-09-20 (complete)4404122OPT14 118.076 30.0402
choco-solver 2019-06-14 (complete)4394262OPT14 126.322 32.1106
choco-solver 2019-09-16 (complete)4400522OPT14 127.17 32.3238
AbsCon 2019-07-23 (complete)4391262OPT14 148.919 143.143
choco-solver 2019-09-24 (complete)4406522OPT14 171.898 165.782
choco-solver 2019-09-16 parallel (complete)4400222OPT14 214.472 27.775
choco-solver 2019-09-20 parallel (complete)4405022OPT14 223.751 29.2598
choco-solver 2019-06-14 parallel (complete)4394562OPT14 241.746 31.5747
choco-solver 2019-09-24 parallel (complete)4407422OPT14 243.936 31.5002
Concrete 3.12.2 (complete)4396542SAT (TO)14 2400.04 2355.53
Concrete 3.12.3 (complete)4403222SAT (TO)14 2400.09 2347.53
Concrete 3.10 (complete)4392162SAT (TO)14 2400.13 2341.33
Concrete 3.12.2 (complete)4401422SAT (TO)14 2400.14 2347.15
cosoco 2.O parallel (complete)4398722SAT (TO)15 2010.43 252.024
cosoco 2.0 parallel (complete)4409982SAT (TO)15 2010.46 252.025
cosoco 2.0 (complete)4397822? (TO) 2400.02 2399.8
cosoco 2.0 (complete)4409082? (TO) 2400.04 2400.11
cosoco 2 (complete)4390362? (TO) 2400.05 2400.01

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