2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
TravellingSalesman/TravellingSalesman-m1-n100/
TravellingSalesman-100-50-08.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-m1-n100/
TravellingSalesman-100-50-08.xml
MD5SUM8e11a97c7673f129a8c4890bd1c1105b
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark443
Best CPU time to get the best result obtained on this benchmark2011.47
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints101
Number of domains2
Minimum domain size62
Maximum domain size100
Distribution of domain sizes[{"size":62,"count":100},{"size":100,"count":100}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":100},{"degree":3,"count":100}]
Minimum constraint arity3
Maximum constraint arity100
Distribution of constraint arities[{"arity":3,"count":100},{"arity":100,"count":1}]
Number of extensional constraints100
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":100},{"type":"allDifferent","count":1}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.O parallel (complete)4398779SAT (TO)443 2011.25 252.025
cosoco 2.0 parallel (complete)4410039SAT (TO)443 2011.47 252.023
choco-solver 2019-06-14 parallel (complete)4394619SAT (TO)462 20069.9 2520.11
AbsCon 2019-07-23 (complete)4391319SAT (TO)494 2400.07 2390.02
choco-solver 2019-09-16 parallel (complete)4400279SAT (TO)500 1998.03 252.106
choco-solver 2019-09-20 parallel (complete)4405079SAT (TO)500 1998.51 252.104
choco-solver 2019-09-24 parallel (complete)4407479SAT (TO)500 2000.33 252.141
choco-solver 2019-09-24 (complete)4406579SAT (TO)505 2400.05 2393.02
choco-solver 2019-09-20 (complete)4404179SAT (TO)554 2400.51 604.296
choco-solver 2019-09-16 (complete)4400579SAT (TO)554 2400.71 604.199
choco-solver 2019-06-14 (complete)4394319SAT (TO)663 2400.39 604.221
Concrete 3.12.2 (complete)4396599SAT (TO)782 2400.1 2352.72
cosoco 2.0 (complete)4397879SAT (TO)816 2400.01 2399.8
cosoco 2 (complete)4390419SAT (TO)816 2400.03 2399.7
cosoco 2.0 (complete)4409139SAT (TO)816 2400.11 2400.5
Concrete 3.12.2 (complete)4401479SAT (TO)827 2400.1 2356.43
Concrete 3.10 (complete)4392219SAT (TO)836 2400.12 2365.33
Concrete 3.12.3 (complete)4403279SAT (TO)864 2400.04 2359.14
PicatSAT 2019-09-12 (complete)4395699? (TO) 2400.05 2399.91

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: 443
Solution found:
<instantiation type='solution' cost='443'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22]
c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[3] c[40] c[41] c[42] c[43]
c[44] c[45] c[46] c[47] c[48] c[49] c[4] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[5] c[60] c[61] c[62] c[63] c[64]
c[65] c[66] c[67] c[68] c[69] c[6] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[7] c[80] c[81] c[82] c[83] c[84] c[85]
c[86] c[87] c[88] c[89] c[8] c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16]
d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] d[35] d[36] d[37]
d[38] d[39] d[3] d[40] d[41] d[42] d[43] d[44] d[45] d[46] d[47] d[48] d[49] d[4] d[50] d[51] d[52] d[53] d[54] d[55] d[56] d[57] d[58]
d[59] d[5] d[60] d[61] d[62] d[63] d[64] d[65] d[66] d[67] d[68] d[69] d[6] d[70] d[71] d[72] d[73] d[74] d[75] d[76] d[77] d[78] d[79] d[7]
d[80] d[81] d[82] d[83] d[84] d[85] d[86] d[87] d[88] d[89] d[8] d[90] d[91] d[92] d[93] d[94] d[95] d[96] d[97] d[98] d[99] d[9] </list>
<values>46 83 75 72 92 96 97 99 87 93 94 40 98 88 89 85 84 78 74 70 69 77 41 73 76 80 57 51 38 34 39 44 56 81 45 31 30 14 1 0 2 11 17 21 86
27 15 12 16 6 3 8 10 20 19 90 32 35 36 47 49 53 42 37 28 22 91 13 9 7 4 5 18 25 24 26 29 95 23 33 43 48 50 54 55 62 66 60 82 59 65 68 61 64
67 71 63 58 52 79 2 2 5 15 5 2 1 4 2 1 1 1 3 5 5 2 4 2 2 2 5 9 18 4 3 14 4 5 7 3 2 4 4 6 6 2 7 19 30 5 6 2 2 4 4 5 1 1 5 2 4 4 8 2 7 9 1 1 7
1 2 6 6 6 3 5 2 6 3 1 4 7 3 1 2 4 4 7 5 5 3 1 1 1 5 2 7 1 1 9 2 4 4 1 2 4 4 4 3 3 </values> </instantiation>