2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
TravellingSalesman/TravellingSalesman-m1-n20/
TravellingSalesman-20-30-05.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-m1-n20/
TravellingSalesman-20-30-05.xml
MD5SUM6b55f0e9dc993e2546b868899e60f341
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark114
Best CPU time to get the best result obtained on this benchmark740.811
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints21
Number of domains2
Minimum domain size20
Maximum domain size32
Distribution of domain sizes[{"size":20,"count":20},{"size":32,"count":20}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":20},{"degree":3,"count":20}]
Minimum constraint arity3
Maximum constraint arity20
Distribution of constraint arities[{"arity":3,"count":20},{"arity":20,"count":1}]
Number of extensional constraints20
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":20},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
(reference) PicatSAT 2019-09-12 (complete)4407797OPT114 740.811 740.794
cosoco 2.0 (complete)4408872SAT (TO)151 2400.04 2399.7
cosoco 2.0 (complete)4397612SAT (TO)151 2400.06 2400.2
cosoco 2 (complete)4394790SAT (TO)151 2400.12 2400.01

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