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

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

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/QuadraticAssignment-m1-s1/
QuadraticAssignment-tai15a.xml
MD5SUM01e5f10d01ef86069967703c8ffb230e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark195605
Best CPU time to get the best result obtained on this benchmark251.938
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints105
Number of domains2
Minimum domain size15
Maximum domain size61
Distribution of domain sizes[{"size":15,"count":15},{"size":61,"count":104}]
Minimum variable degree0
Maximum variable degree15
Distribution of variable degrees[{"degree":0,"count":121},{"degree":2,"count":104},{"degree":14,"count":2},{"degree":15,"count":13}]
Minimum constraint arity3
Maximum constraint arity15
Distribution of constraint arities[{"arity":3,"count":104},{"arity":15,"count":1}]
Number of extensional constraints104
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":104},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2017-07-28 (complete)4259165SAT (TO)195605 251.938 252.011
OscaR - ALNS 2017-07-26 (complete)4255686SAT (TO)198327 248.672 240.032
Concrete 3.4 (complete)4259662SAT (TO)198845 256.931 240.041
OscaR - Hybrid 2017-07-26 (complete)4256680SAT (TO)199085 249.142 240.02499
choco-solver 4.0.5 par (2017-07-26) (complete)4254692SAT (TO)202503 1920.67 248.638
choco-solver 4.0.5 par (2017-08-09) (complete)4271664SAT (TO)203191 1666.25 252.091
choco-solver 4.0.5 par (2017-08-18) (complete)4281474SAT (TO)203191 1991.4301 252.11301
OscaR - Parallel with EPS 2017-07-26 (complete)4257177SAT (TO)206366 1921.3 245.505
AbsCon-basic 2017-06-11 (complete)4257674SAT (TO)206676 242.112 240.01199
OscaR - Parallel with EPS 2017-08-22 (complete)4285884SAT (TO)207696 1980.22 252.117
cosoco 1.12 (complete)4268724SAT (TO)207907 251.88901 252.00999
cosoco 1.1 (complete)4258668SAT (TO)207907 252.043 252.00999
choco-solver 5a (2017-07-26) (complete)4255189SAT (TO)208112 255.66 240.00999
choco-solver 5a (2017-08-18) (complete)4284414SAT (TO)208112 256.091 240.026
choco-solver 4.0.5 seq (2017-07-26) (complete)4254195SAT (TO)209702 246.71001 240.00999
choco-solver 4.0.5 seq (2017-08-09) (complete)4270194SAT (TO)209702 246.933 240.02499
choco-solver 4.0.5 seq (2017-08-18) (complete)4282944SAT (TO)209702 247.149 240.026
cosoco-sat 1.12 (complete)4266793SAT (TO)210445 251.93401 252.011
OscaR - Conflict Ordering 2017-07-26 (complete)4256183SAT (TO)211898 243.062 240.022
sat4j-CSP 2017-07-05 (complete)4258171SAT (TO)250281 247.81599 240.21899

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: 195605
Solution found:
<instantiation type="solution"> <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] d[0][0] 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[1][0] d[1][1] 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[2][0] d[2][1] d[2][2] 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[3][0] d[3][1] d[3][2] d[3][3] 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[4][0] d[4][1] d[4][2] d[4][3] d[4][4] 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[5][0] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] 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[6][0] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] 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[7][0] d[7][1] d[7][2] d[7][3] d[7][4] d[7][5] d[7][6] d[7][7] d[7][8] d[7][9] d[7][10] d[7][11] d[7][12]
d[7][13] d[7][14] d[8][0] d[8][1] d[8][2] d[8][3] d[8][4] d[8][5] d[8][6] d[8][7] d[8][8] d[8][9] d[8][10] d[8][11] d[8][12] d[8][13]
d[8][14] d[9][0] d[9][1] d[9][2] d[9][3] d[9][4] d[9][5] d[9][6] d[9][7] d[9][8] d[9][9] d[9][10] d[9][11] d[9][12] d[9][13] d[9][14]
d[10][0] d[10][1] d[10][2] d[10][3] d[10][4] d[10][5] d[10][6] d[10][7] d[10][8] d[10][9] d[10][10] d[10][11] d[10][12] d[10][13] d[10][14]
d[11][0] d[11][1] d[11][2] d[11][3] d[11][4] d[11][5] d[11][6] d[11][7] d[11][8] d[11][9] d[11][10] d[11][11] d[11][12] d[11][13] d[11][14]
d[12][0] d[12][1] d[12][2] d[12][3] d[12][4] d[12][5] d[12][6] d[12][7] d[12][8] d[12][9] d[12][10] d[12][11] d[12][12] d[12][13] d[12][14]
d[13][0] d[13][1] d[13][2] d[13][3] d[13][4] d[13][5] d[13][6] d[13][7] d[13][8] d[13][9] d[13][10] d[13][11] d[13][12] d[13][13] d[13][14]
d[14][0] d[14][1] d[14][2] d[14][3] d[14][4] d[14][5] d[14][6] d[14][7] d[14][8] d[14][9] d[14][10] d[14][11] d[14][12] d[14][13] d[14][14]
</list> <values> 0 1 5 4 2 9 6 11 14 3 12 13 10 8 7 * 21 41 56 95 4 6 6 75 82 44 40 63 10 25 * * 35 89 79 84 9 0 11 0 26 91 12 85 1 * * * 6
26 50 93 36 2 57 27 85 4 1 56 * * * * 82 74 71 89 40 18 76 * 30 77 8 * * * * * 45 69 59 39 35 18 76 91 86 56 * * * * * * 11 66 83 21 41 15
90 94 58 * * * * * * * 11 61 36 20 21 35 15 1 * * * * * * * * 83 11 40 54 96 51 76 * * * * * * * * * 82 71 77 65 29 85 * * * * * * * * * *
29 82 71 36 61 * * * * * * * * * * * 14 74 3 72 * * * * * * * * * * * * 45 48 44 * * * * * * * * * * * * * 90 21 * * * * * * * * * * * * * *
80 * * * * * * * * * * * * * * * </values> </instantiation>