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

Result page for benchmark
QuadraticAssignment/
QuadraticAssignment-esc16a_c18.xml

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/
QuadraticAssignment-esc16a_c18.xml
MD5SUM33cd07532de3d8b94fe29f3b9aee1e6b
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark34
Best CPU time to get the best result obtained on this benchmark2400.22
Satisfiable
(Un)Satisfiability was proved
Number of variables272
Number of constraints39
Number of domains2
Minimum domain size4
Maximum domain size16
Distribution of domain sizes[{"size":4,"count":38},{"size":16,"count":16}]
Minimum variable degree0
Maximum variable degree10
Distribution of variable degrees[{"degree":0,"count":218},{"degree":1,"count":6},{"degree":2,"count":38},{"degree":7,"count":2},{"degree":8,"count":4},{"degree":10,"count":4}]
Minimum constraint arity3
Maximum constraint arity16
Distribution of constraint arities[{"arity":3,"count":38},{"arity":16,"count":1}]
Number of extensional constraints38
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":38},{"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 2018-06-15 (complete)4289402SAT (TO)34 2400.08 2399.8
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290375SAT (TO)34 2400.09 2380.72
Choco-solver 4.0.7 seq (493a269) (complete)4292331SAT (TO)34 2400.11 2390.32
Sat4j-CSP 2018-07-11 (complete)4289888SAT (TO)34 2400.22 2389.13
Mistral-2.0 2018-08-01 (complete)4303687SAT (TO)34 2519.8 2520.01
cosoco 1.12 (complete)4293883SAT (TO)34 2519.99 2520.01
Concrete 3.8-SuperNG 2018-06-13 (complete)4293882SAT (TO)34 2520.06 2480.23
Concrete 3.8 2018-06-13 (complete)4293881SAT (TO)34 2520.08 2477.83
Choco-solver 4.0.7b seq (e747e1e) (complete)4306625SAT (TO)34 2520.09 2509.05
Concrete 3.9.2 (complete)4304413SAT (TO)34 2520.09 2473.83
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307919SAT (TO)34 2520.11 2499.43
Concrete 3.9.2-SuperNG (complete)4304414SAT (TO)34 2520.12 2478.83
OscaR - Hybrid 2018-08-14 (complete)4308505SAT (TO)34 2520.12 2470.13
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311655SAT (TO)34 2520.12 2500.42
OscaR - Hybrid 2018-07-02 (complete)4291573SAT (TO)35 2400.12 2361.82
PicatSAT 2018-08-02 (complete)4303101? (TO) 2519.62 2520.01
PicatSAT 2018-06-15 (complete)4293884? (TO) 2519.99 2520.01
PicatSAT 2018-08-14 (complete)4309441? (TO) 2520.05 2520.02

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