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

Result page for benchmark
QuadraticAssignment/QuadraticAssignment-m1-s1/
QuadraticAssignment-esc16d.xml

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/QuadraticAssignment-m1-s1/
QuadraticAssignment-esc16d.xml
MD5SUM797dd3ed6ca3fcac5df6221abf320949
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark8
Best CPU time to get the best result obtained on this benchmark13.3135
Satisfiable
(Un)Satisfiability was proved
Number of variables272
Number of constraints22
Number of domains2
Minimum domain size4
Maximum domain size16
Distribution of domain sizes[{"size":4,"count":21},{"size":16,"count":16}]
Minimum variable degree0
Maximum variable degree7
Distribution of variable degrees[{"degree":0,"count":235},{"degree":1,"count":2},{"degree":2,"count":22},{"degree":3,"count":6},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":1},{"degree":7,"count":1}]
Minimum constraint arity3
Maximum constraint arity16
Distribution of constraint arities[{"arity":3,"count":21},{"arity":16,"count":1}]
Number of extensional constraints21
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":21},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257662OPT8 13.3135 11.8108
choco-solver 4.0.5 seq (2017-08-18) (complete)4282932OPT8 47.936199 43.897099
choco-solver 4.0.5 seq (2017-07-26) (complete)4254183OPT8 47.936901 44.643799
choco-solver 4.0.5 seq (2017-08-09) (complete)4270182OPT8 47.957802 44.261799
choco-solver 5a (2017-08-18) (complete)4284402OPT8 86.676399 79.501701
choco-solver 4.0.5 par (2017-07-26) (complete)4254680OPT8 87.184196 11.5326
choco-solver 5a (2017-07-26) (complete)4255177OPT8 87.437302 80.471199
cosoco-sat 1.12 (complete)4266781OPT8 96.204399 96.201797
OscaR - Conflict Ordering 2017-07-26 (complete)4256171OPT8 97.2584 94.772102
choco-solver 4.0.5 par (2017-08-18) (complete)4281462OPT8 108.243 14.0418
OscaR - Parallel with EPS 2017-07-26 (complete)4257165OPT8 119.99 17.402
OscaR - Parallel with EPS 2017-08-22 (complete)4285872OPT8 122.54 21.629299
cosoco 1.12 (complete)4268712OPT8 131.233 131.302
cosoco 1.1 (complete)4258656OPT8 131.901 131.996
Mistral-2.0 2017-07-28 (complete)4259153OPT8 153.39999 153.48199
sat4j-CSP 2017-07-05 (complete)4258159OPT8 156.215 151.55
choco-solver 4.0.5 par (2017-08-09) (complete)4271652OPT8 204.688 26.180201
OscaR - ALNS 2017-07-26 (complete)4255674SAT (TO)8 247.636 240.01401
OscaR - Hybrid 2017-07-26 (complete)4256668SAT (TO)8 248.00101 240.01601
Concrete 3.4 (complete)4259650SAT (TO)8 251.998 240.032

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: 8
Solution found:
<instantiation id='sol8' type='solution' cost='8'>  <list> x[] d[][] </list>  <values> 9 1 5 13 11 12 0 8 3 10 14 2 4 6 7 15 * * * 0 0 * * *
* * * * * * * * * * * * * * 0 * 0 * * 1 * * 1 * * * * * * * * * * * * * 0 * 0 * * * * * 1 * * * * * * * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * 1 * * 0 * * 2 * * * * * * * * * * 0 * * * * * * * * * * * * * * * * * 0 * * 0 * * * * *
* * * * * * 0 * * * * * * * * * * * * * * * * * * 0 * * * * * * * * * * * * * * 1 0 1 * * * * * * * * * * * * * * 0 * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * </values>  </instantiation>