2017 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
OpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbo-15-30-1.xml

Jump to solvers results

General information on the benchmark

NameOpenStacks/OpenStacks-m2c-s1/
OpenStacks-m2c-wbo-15-30-1.xml
MD5SUM42e0d1a2247f38e5f07d6f797d7a9923
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark153.28799
Satisfiable
(Un)Satisfiability was proved
Number of variables540
Number of constraints511
Number of domains3
Minimum domain size2
Maximum domain size31
Distribution of domain sizes[{"size":2,"count":450},{"size":30,"count":60},{"size":31,"count":30}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":480},{"degree":5,"count":30},{"degree":31,"count":30}]
Minimum constraint arity3
Maximum constraint arity30
Distribution of constraint arities[{"arity":3,"count":452},{"arity":4,"count":10},{"arity":5,"count":10},{"arity":6,"count":4},{"arity":7,"count":2},{"arity":8,"count":2},{"arity":16,"count":30},{"arity":30,"count":1}]
Number of extensional constraints450
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":450},{"type":"allDifferent","count":1},{"type":"sum","count":30},{"type":"minimum","count":15},{"type":"maximum","count":15}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257619OPT4 153.28799 146.575
choco-solver 4.0.5 seq (2017-07-26) (complete)4254140OPT4 184.181 178.826
choco-solver 4.0.5 seq (2017-08-18) (complete)4283183OPT4 184.653 178.927
choco-solver 4.0.5 seq (2017-08-09) (complete)4270433OPT4 185.536 179.67599
choco-solver 4.0.5 par (2017-08-18) (complete)4281713OPT4 865.93298 110.606
choco-solver 4.0.5 par (2017-07-26) (complete)4254637OPT4 1293.15 164.25999
choco-solver 4.0.5 par (2017-08-09) (complete)4271903OPT4 1711.72 216.66499
Mistral-2.0 2017-07-28 (complete)4259110SAT (TO)4 251.881 252.011
cosoco-sat 1.12 (complete)4267032SAT (TO)5 240.02 240.00999
choco-solver 5a (2017-08-18) (complete)4284653SAT (TO)5 252.418 240.024
choco-solver 5a (2017-07-26) (complete)4255134SAT (TO)5 253.72 240.00999
Concrete 3.4 (complete)4259607SAT (TO)5 261.39999 240.03799
cosoco 1.12 (complete)4268963SAT (TO)6 240.039 240.00999
OscaR - Hybrid 2017-07-26 (complete)4256625SAT (TO)6 248.01199 240.022
cosoco 1.1 (complete)4258613SAT (TO)6 251.94099 252.00999
OscaR - Parallel with EPS 2017-07-26 (complete)4257122SAT (TO)6 1921.0699 243.627
OscaR - Parallel with EPS 2017-08-22 (complete)4286123SAT (TO)6 1987.61 252.14
OscaR - ALNS 2017-07-26 (complete)4255631SAT (TO)7 246.463 240.02
OscaR - Conflict Ordering 2017-07-26 (complete)4256128SAT (TO)11 244.89999 240.033
sat4j-CSP 2017-07-05 (complete)4258116? (TO) 252.306 180.55099

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: 4
Solution found:
<instantiation id='sol6' type='solution' cost='4'>  <list> p[] min[] max[] o[][] so[] </list>  <values> 19 4 8 5 11 29 25 10 16 20 9 15 7 3
6 22 23 24 12 17 1 18 14 26 13 2 21 27 0 28 13 12 4 21 25 18 23 3 8 15 19 28 0 1 0 17 24 11 28 27 22 27 18 12 20 29 29 3 7 14 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 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 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 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 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 1 1
1 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 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 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 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 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 0 0 0 0 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 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 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 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 2 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 2 </values>  </instantiation>