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

Result page for benchmark
TravellingSalesman/
TravellingSalesman-25-30-00_c18.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/
TravellingSalesman-25-30-00_c18.xml
MD5SUMfffb7bc75ae44a730e23d85d48ed452e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark113
Best CPU time to get the best result obtained on this benchmark2520.06
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints26
Number of domains2
Minimum domain size25
Maximum domain size32
Distribution of domain sizes[{"size":25,"count":25},{"size":32,"count":25}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":25},{"degree":3,"count":25}]
Minimum constraint arity3
Maximum constraint arity25
Distribution of constraint arities[{"arity":3,"count":25},{"arity":25,"count":1}]
Number of extensional constraints25
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":25},{"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)4289702SAT (TO)113 2400.06 2400.3
Concrete 3.9.2 (complete)4304727SAT (TO)113 2520.06 2483.63
Mistral-2.0 2018-08-01 (complete)4303627SAT (TO)113 2520.07 2520.01
Concrete 3.9.2-SuperNG (complete)4304728SAT (TO)113 2520.08 2492.93
OscaR - Hybrid 2018-08-14 (complete)4308445SAT (TO)113 2520.09 2463.41
OscaR - Hybrid 2018-07-02 (complete)4291513SAT (TO)115 2400.13 2337.04
Concrete 3.8-SuperNG 2018-06-13 (complete)4295959SAT (TO)115 2520.11 2490.63
cosoco 1.12 (complete)4295960SAT (TO)118 2520.01 2519.8
Choco-solver 4.0.7 seq (493a269) (complete)4292271SAT (TO)119 2400.09 2392.81
Choco-solver 4.0.7b seq (e747e1e) (complete)4306565SAT (TO)119 2520.06 2512.21
Concrete 3.8 2018-06-13 (complete)4295958SAT (TO)126 2520.12 2484.83
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311595SAT (TO)144 2520.06 2508.61
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4307859SAT (TO)151 2520.12 2508.12
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290315SAT (TO)154 2400.12 2389.14
Sat4j-CSP 2018-07-11 (complete)4289828SAT (TO)253 2400.27 2377.92
PicatSAT 2018-06-15 (complete)4295961? (TO) 2519.82 2520.01
PicatSAT 2018-08-02 (complete)4303041? (TO) 2519.9 2520.02
PicatSAT 2018-08-14 (complete)4309381? (TO) 2519.98 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: 113
Solution found:
<instantiation type="solution"> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17]
c[18] c[19] c[20] c[21] c[22] c[23] c[24] d[0] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17]
d[18] d[19] d[20] d[21] d[22] d[23] d[24] </list> <values> 23 21 20 18 19 17 10 5 1 0 2 3 4 6 7 8 11 14 12 9 13 15 16 22 24 2 4 3 2 1 8 8 4
7 2 1 2 4 5 1 8 4 4 4 6 5 5 8 12 3 </values> </instantiation>