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

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

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/QuadraticAssignment-m1-s1/
QuadraticAssignment-scr15.xml
MD5SUM9fad1afbbcb60e61b17bf96c72dc570b
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark25570
Best CPU time to get the best result obtained on this benchmark22.6297
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints43
Number of domains2
Minimum domain size7
Maximum domain size15
Distribution of domain sizes[{"size":7,"count":42},{"size":15,"count":15}]
Minimum variable degree0
Maximum variable degree10
Distribution of variable degrees[{"degree":0,"count":183},{"degree":2,"count":42},{"degree":4,"count":2},{"degree":5,"count":2},{"degree":6,"count":3},{"degree":7,"count":4},{"degree":8,"count":2},{"degree":9,"count":1},{"degree":10,"count":1}]
Minimum constraint arity3
Maximum constraint arity15
Distribution of constraint arities[{"arity":3,"count":42},{"arity":15,"count":1}]
Number of extensional constraints42
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":42},{"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 2019-07-23 (complete)4391139OPT25570 22.6297 20.2513
choco-solver 2019-09-24 (complete)4406399OPT25570 170.158 165.721
choco-solver 2019-09-24 parallel (complete)4407299OPT25570 405.178 51.4133
choco-solver 2019-09-20 parallel (complete)4404899OPT25570 416.403 52.8168
Concrete 3.10 (complete)4392039OPT25570 485.821 463.928
Concrete 3.12.3 (complete)4403099OPT25570 488.604 471.195
Concrete 3.12.2 (complete)4401299OPT25570 647.101 626.265
cosoco 2.0 (complete)4397699OPT25570 727.61 727.546
cosoco 2 (complete)4390239OPT25570 730.524 730.524
cosoco 2.0 (complete)4408959OPT25570 732.092 732.12
choco-solver 2019-09-16 (complete)4400399OPT25570 736.466 185.452
choco-solver 2019-09-16 parallel (complete)4400099OPT25570 885.926 111.723
Concrete 3.12.2 (complete)4396419OPT25570 917.313 893.45
PicatSAT 2019-09-12 (complete)4395519OPT25570 1441.24 1441.31
choco-solver 2019-06-14 parallel (complete)4394439OPT25570 1537.23 272.31
choco-solver 2019-06-14 (complete)4394139OPT25570 1618.38 498.835
cosoco 2.0 parallel (complete)4409859SAT (TO)25860 2012.47 252.014
cosoco 2.O parallel (complete)4398599SAT (TO)26489 2012.35 252.014
choco-solver 2019-09-20 (complete)4403999SAT (MO)33951 2.29029 0.867796

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