2019 XCSP3 competition: main track (CSP and COP, 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.7633
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)4390839OPT25570 22.7633 20.468
choco-solver 2019-09-24 (complete)4406099OPT25570 171.034 167.074
Concrete 3.10 (complete)4387066OPT25570 379.654 359.889
Concrete 3.12.2 (complete)4400999OPT25570 391.963 375.194
Concrete 3.12.3 (complete)4402799OPT25570 610.166 590.341
choco-solver 2019-09-24 parallel (complete)4406999OPT25570 673.397 85.0411
choco-solver 2019-09-20 (complete)4403699OPT25570 708.102 178.219
choco-solver 2019-09-16 parallel (complete)4399799OPT25570 718.815 90.7476
cosoco 2.0 (complete)4397019OPT25570 729.162 729.145
cosoco 2.0 (complete)4408279OPT25570 729.943 729.937
cosoco 2 (complete)4389739OPT25570 730.003 730.021
choco-solver 2019-09-16 (complete)4399199OPT25570 749.127 188.56
choco-solver 2019-06-14 parallel (complete)4393839OPT25570 757.356 148.868
choco-solver 2019-09-20 parallel (complete)4404599OPT25570 886.629 111.789
Concrete 3.12.2 (complete)4396119OPT25570 920.04 896.783
PicatSAT 2019-09-12 (complete)4395219OPT25570 1438.4 1438.43
choco-solver 2019-06-14 (complete)4393239OPT25570 1510.37 458.196
cosoco 2.0 parallel (complete)4409559OPT25570 2671.72 334.529
cosoco 2.O parallel (complete)4398299OPT25570 2675.21 334.98

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>