2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
TravellingSalesman/TravellingSalesman-xcsp2-s25/
TravellingSalesman-25-715_X2.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-xcsp2-s25/
TravellingSalesman-25-715_X2.xml
MD5SUM0286d8cb8f351d75271acd0c64dfc747
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark3.29109
Satisfiable
(Un)Satisfiability was proved
Number of variables76
Number of constraints350
Number of domains5
Minimum domain size1
Maximum domain size1001
Distribution of domain sizes[{"size":1,"count":2},{"size":25,"count":25},{"size":181,"count":24},{"size":1001,"count":25}]
Minimum variable degree1
Maximum variable degree25
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":49},{"degree":25,"count":25}]
Minimum constraint arity2
Maximum constraint arity3
Distribution of constraint arities[{"arity":2,"count":325},{"arity":3,"count":25}]
Number of extensional constraints350
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":350}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2.0 (complete)4396738SAT 3.29109 3.2926
cosoco 2.0 (complete)4407998SAT 3.30059 3.30188
cosoco 2 (complete)4389458SAT 3.38798 3.39044
Concrete 3.10 (complete)4387378SAT 17.6623 8.9342
Concrete 3.12.3 (complete)4402518SAT 37.9628 29.9768
Concrete 3.12.2 (complete)4400718SAT 41.1321 31.4473
choco-solver 2019-06-14 (complete)4392958SAT 91.4647 23.4363
AbsCon 2019-07-23 (complete)4390558SAT 125.075 119.675
PicatSAT 2019-09-12 (complete)4394938SAT 163.391 163.395
BTD 19.07.01 (complete)4386878SAT 168.046 168.06
choco-solver 2019-06-14 parallel (complete)4393558SAT 183.468 24.2046
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388212SAT 237.921 204.152
Concrete 3.12.2 (complete)4395838SAT 247.655 235.766
cosoco 2.O parallel (complete)4398018SAT 265.281 33.4058
cosoco 2.0 parallel (complete)4409278SAT 271.515 34.1753
choco-solver 2019-09-24 (complete)4405818SAT 277.982 273.665
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392658SAT 279.368 167.271
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405218SAT 280.008 166.803
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392358SAT 280.706 166.987
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388211SAT 286.426 253.814
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405518SAT 292.884 181.597
choco-solver 2019-09-20 (complete)4403418SAT 415.85 104.907
choco-solver 2019-09-16 (complete)4398918SAT 429.555 108.367
choco-solver 2019-09-20 parallel (complete)4404318SAT 665.982 84.6293
choco-solver 2019-09-16 parallel (complete)4399518SAT 689.312 87.6981
choco-solver 2019-09-24 parallel (complete)4406718SAT 710.571 90.355

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:
Solution found:
<instantiation type='solution'> <list>w3 w4 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] x[16]
x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] y[0] y[1] y[2] y[3] y[4] y[5] y[6] y[7] y[8] y[9] y[10] y[11] y[12] y[13] y[14] y[15] y[16]
y[17] y[18] y[19] y[20] y[21] y[22] y[23] y[24] z[0] z[1] z[2] z[3] z[4] z[5] z[6] z[7] z[8] z[9] z[10] z[11] z[12] z[13] z[14] z[15] z[16]
z[17] z[18] z[19] z[20] z[21] z[22] z[23] </list> <values>180 0 15 21 24 5 3 16 8 14 7 4 1 19 25 13 17 22 9 20 10 2 11 6 12 23 18 4 9 21 19
18 9 16 0 8 2 3 5 1 10 14 0 5 1 20 1 0 6 3 4 1 13 34 53 71 80 96 96 104 106 109 114 115 125 139 139 144 145 165 166 166 172 175 179 180
</values> </instantiation>