2019 XCSP3 competition: fast COP track (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 benchmark67.0084
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)4395735OPT14 67.0084 67.0167
choco-solver 2019-09-16 (complete)4400615OPT14 120.103 30.5346
choco-solver 2019-09-20 (complete)4404215OPT14 120.307 30.5898
AbsCon 2019-07-23 (complete)4391355OPT14 149.377 143.6
choco-solver 2019-06-14 (complete)4394355OPT14 168.549 42.9096
choco-solver 2019-09-24 (complete)4406615OPT14 173.808 168.233
choco-solver 2019-09-20 parallel (complete)4405115OPT14 218.896 28.3066
choco-solver 2019-09-16 parallel (complete)4400315OPT14 226.154 29.229
choco-solver 2019-06-14 parallel (complete)4394655OPT14 265.457 34.2091
choco-solver 2019-09-24 parallel (complete)4407515OPT14 305.051 39.2438
cosoco 2.O parallel (complete)4398815SAT (TO)14 2009.64 252.01
Concrete 3.10 (complete)4392255SAT (TO)14 2400.1 2340.53
Concrete 3.12.2 (complete)4401515SAT (TO)14 2400.13 2346.63
Concrete 3.12.2 (complete)4396635SAT (TO)14 2400.14 2355.34
Concrete 3.12.3 (complete)4403315SAT (TO)14 2400.14 2349.53
cosoco 2.0 parallel (complete)4410075SAT (TO)15 2010.53 252.025
cosoco 2.0 (complete)4397915? (TO) 2400.03 2400.11
cosoco 2 (complete)4390455? (TO) 2400.09 2400.01
cosoco 2.0 (complete)4409175? (TO) 2400.11 2400.5

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