2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
QuadraticAssignment/
QuadraticAssignment-had18_c18.xml

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/
QuadraticAssignment-had18_c18.xml
MD5SUM2bd2b017ef1b8aef080ffc7cd9cfea3a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark2742
Best CPU time to get the best result obtained on this benchmark20062.4
Satisfiable
(Un)Satisfiability was proved
Number of variables342
Number of constraints154
Number of domains2
Minimum domain size11
Maximum domain size18
Distribution of domain sizes[{"size":11,"count":153},{"size":18,"count":18}]
Minimum variable degree0
Maximum variable degree18
Distribution of variable degrees[{"degree":0,"count":171},{"degree":2,"count":153},{"degree":18,"count":18}]
Minimum constraint arity3
Maximum constraint arity18
Distribution of constraint arities[{"arity":3,"count":153},{"arity":18,"count":1}]
Number of extensional constraints153
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":153},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b par (e747e1e) (complete)4297507SAT (TO)2742 20062.4 2520.09
OscaR - Parallel with EPS 2018-07-02 (complete)4291094SAT (TO)2759 19990.2 2520.23
OscaR - Parallel with EPS 2018-08-14 (complete)4308863SAT (TO)2761 19998.3 2520.27

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: 2742
Solution found:
<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] d[0][1] d[0][2]
d[0][3] d[0][4] d[0][5] d[0][6] d[0][7] d[0][8] d[0][9] d[0][10] d[0][11] d[0][12] d[0][13] d[0][14] d[0][15] d[0][16] d[0][17] d[1][2]
d[1][3] d[1][4] d[1][5] d[1][6] d[1][7] d[1][8] d[1][9] d[1][10] d[1][11] d[1][12] d[1][13] d[1][14] d[1][15] d[1][16] d[1][17] d[2][3]
d[2][4] d[2][5] d[2][6] d[2][7] d[2][8] d[2][9] d[2][10] d[2][11] d[2][12] d[2][13] d[2][14] d[2][15] d[2][16] d[2][17] d[3][4] d[3][5]
d[3][6] d[3][7] d[3][8] d[3][9] d[3][10] d[3][11] d[3][12] d[3][13] d[3][14] d[3][15] d[3][16] d[3][17] d[4][5] d[4][6] d[4][7] d[4][8]
d[4][9] d[4][10] d[4][11] d[4][12] d[4][13] d[4][14] d[4][15] d[4][16] d[4][17] d[5][6] d[5][7] d[5][8] d[5][9] d[5][10] d[5][11] d[5][12]
d[5][13] d[5][14] d[5][15] d[5][16] d[5][17] d[6][7] d[6][8] d[6][9] d[6][10] d[6][11] d[6][12] d[6][13] d[6][14] d[6][15] d[6][16] d[6][17]
d[7][8] d[7][9] d[7][10] d[7][11] d[7][12] d[7][13] d[7][14] d[7][15] d[7][16] d[7][17] d[8][9] d[8][10] d[8][11] d[8][12] d[8][13] d[8][14]
d[8][15] d[8][16] d[8][17] d[9][10] d[9][11] d[9][12] d[9][13] d[9][14] d[9][15] d[9][16] d[9][17] d[10][11] d[10][12] d[10][13] d[10][14]
d[10][15] d[10][16] d[10][17] d[11][12] d[11][13] d[11][14] d[11][15] d[11][16] d[11][17] d[12][13] d[12][14] d[12][15] d[12][16] d[12][17]
d[13][14] d[13][15] d[13][16] d[13][17] d[14][15] d[14][16] d[14][17] d[15][16] d[15][17] d[16][17] </list> <values>5 7 15 0 17 9 6 16 14 13
4 1 10 12 11 2 8 3 5 4 5 3 5 8 3 5 8 4 9 7 1 5 4 5 5 4 6 4 5 6 4 9 5 4 2 5 7 3 4 1 3 5 8 5 6 6 8 3 3 2 8 4 5 6 5 8 8 1 6 6 4 5 8 3 4 1 6 4 5
6 10 6 3 6 4 4 6 3 2 6 7 7 2 4 6 5 6 7 7 7 5 7 6 4 4 7 5 8 3 9 6 1 7 4 8 3 5 2 4 6 5 5 4 5 4 3 5 3 3 1 7 4 2 4 7 3 6 5 5 5 6 5 4 7 6 7 7 6 5
5 4 9 7 6 2 3 6 9 3 5 3 6 5 4 3 6 2 6 2 2 9 </values> </instantiation>