2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
QuadraticAssignment/
QuadraticAssignment-esc16d_c18.xml

Jump to solvers results

General information on the benchmark

NameQuadraticAssignment/
QuadraticAssignment-esc16d_c18.xml
MD5SUM797dd3ed6ca3fcac5df6221abf320949
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark8
Best CPU time to get the best result obtained on this benchmark52.9065
Satisfiable
(Un)Satisfiability was proved
Number of variables272
Number of constraints22
Number of domains2
Minimum domain size4
Maximum domain size16
Distribution of domain sizes[{"size":4,"count":21},{"size":16,"count":16}]
Minimum variable degree0
Maximum variable degree7
Distribution of variable degrees[{"degree":0,"count":235},{"degree":1,"count":2},{"degree":2,"count":22},{"degree":3,"count":6},{"degree":4,"count":2},{"degree":5,"count":3},{"degree":6,"count":1},{"degree":7,"count":1}]
Minimum constraint arity3
Maximum constraint arity16
Distribution of constraint arities[{"arity":3,"count":21},{"arity":16,"count":1}]
Number of extensional constraints21
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":21},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Concrete 3.9.2-SuperNG (complete)4302752OPT8 52.9065 43.3119
Mistral-2.0 2018-08-01 (complete)4312578OPT8 53.0391 53.0593
Choco-solver 4.0.7b seq (e747e1e) (complete)4301636OPT8 56.8913 52.4184
Concrete 3.9.2 (complete)4302402OPT8 96.4271 86.9856
cosoco 1.12 (complete)4301638OPT8 138.792 138.8
Sat4j-CSP 2018-07-11 (complete)4301637OPT8 157.52 152.826
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312238OPT8 207.433 204.323
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310028SAT8 251.763 247.379
OscaR - Hybrid 2018-08-14 (complete)4310378SAT (TO)8 252.029 244.917

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