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

Result page for benchmark
TravellingSalesman/TravellingSalesman-m1-n150/
TravellingSalesman-150-50-13.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-m1-n150/
TravellingSalesman-150-50-13.xml
MD5SUMd698eba466bb4d42bacc008ef87467ee
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark549
Best CPU time to get the best result obtained on this benchmark2009.97
Satisfiable
(Un)Satisfiability was proved
Number of variables300
Number of constraints151
Number of domains2
Minimum domain size66
Maximum domain size150
Distribution of domain sizes[{"size":66,"count":150},{"size":150,"count":150}]
Minimum variable degree2
Maximum variable degree3
Distribution of variable degrees[{"degree":2,"count":150},{"degree":3,"count":150}]
Minimum constraint arity3
Maximum constraint arity150
Distribution of constraint arities[{"arity":3,"count":150},{"arity":150,"count":1}]
Number of extensional constraints150
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":150},{"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.0 parallel (complete)4410034SAT (TO)549 2009.97 252.026
cosoco 2.O parallel (complete)4398774SAT (TO)549 2010.03 252.026
choco-solver 2019-06-14 parallel (complete)4394614SAT (TO)564 19997.7 2520.12
AbsCon 2019-07-23 (complete)4391314SAT (TO)821 2400.07 2389.61
Concrete 3.12.2 (complete)4401474SAT (TO)956 2400.07 2344.93
choco-solver 2019-09-24 (complete)4406574SAT (TO)999 2400.08 2390.91
Concrete 3.12.3 (complete)4403274SAT (TO)1100 2400.08 2350.93
Concrete 3.10 (complete)4392214SAT (TO)1174 2400.08 2362.33
choco-solver 2019-09-16 (complete)4400574SAT (TO)1244 2400.63 616.399
choco-solver 2019-09-20 (complete)4404174SAT (TO)1244 2400.73 620.112
Concrete 3.12.2 (complete)4396594SAT (TO)1272 2400.05 2357.54
choco-solver 2019-09-20 parallel (complete)4405074SAT (TO)1294 1794.7 252.13
cosoco 2 (complete)4390414SAT (TO)1300 2400.05 2400.2
cosoco 2.0 (complete)4397874SAT (TO)1300 2400.05 2399.8
cosoco 2.0 (complete)4409134SAT (TO)1300 2400.06 2399.9
choco-solver 2019-09-24 parallel (complete)4407474SAT (TO)1362 1829.29 252.131
choco-solver 2019-09-16 parallel (complete)4400274SAT (TO)1516 1846.38 252.125
choco-solver 2019-06-14 (complete)4394314SAT (TO)1997 2400.43 613.799
PicatSAT 2019-09-12 (complete)4395694? (TO) 2400.06 2400.04

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: 549
Solution found:
<instantiation type='solution' cost='549'> <list>c[0] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[10] c[110]
c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[11] c[120] c[121] c[122] c[123] c[124] c[125] c[126] c[127] c[128] c[129]
c[12] c[130] c[131] c[132] c[133] c[134] c[135] c[136] c[137] c[138] c[139] c[13] c[140] c[141] c[142] c[143] c[144] c[145] c[146] c[147]
c[148] c[149] 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[100] d[101] d[102] d[103] d[104] d[105] d[106] d[107] d[108] d[109] d[10] d[110] d[111] d[112] d[113]
d[114] d[115] d[116] d[117] d[118] d[119] d[11] d[120] d[121] d[122] d[123] d[124] d[125] d[126] d[127] d[128] d[129] d[12] d[130] d[131]
d[132] d[133] d[134] d[135] d[136] d[137] d[138] d[139] d[13] d[140] d[141] d[142] d[143] d[144] d[145] d[146] d[147] d[148] d[149] 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>103 138 147 143 142 137 130 90 83 80 77 84 14 46 43 32 25 34 47 41 35 36 85 37 44 48 59 57 55 54 53 52 49 79 66
70 69 62 68 75 76 78 82 86 72 89 108 111 146 148 129 126 122 118 112 64 63 50 39 40 31 95 28 29 21 17 3 2 4 11 16 10 92 1 20 15 19 7 9 18 0
23 26 96 27 30 22 12 8 13 5 6 24 33 109 38 42 56 51 45 58 60 65 67 71 113 81 91 101 107 110 100 102 106 99 94 104 88 105 116 114 119 123 127
131 120 134 97 139 149 144 140 135 128 124 132 136 141 93 145 125 121 117 74 73 61 98 115 133 87 2 2 7 1 1 3 14 4 8 4 28 5 10 1 4 3 3 4 3 2
1 4 2 5 1 5 1 2 1 1 3 1 6 2 2 1 4 2 4 2 1 2 2 1 3 5 2 12 3 7 2 1 2 4 2 2 5 4 2 3 2 1 2 2 1 4 1 4 2 1 3 3 1 6 4 3 4 1 3 5 9 1 15 5 1 16 4 1 1
2 5 5 8 4 3 3 7 3 2 4 1 2 2 2 6 3 4 2 2 3 4 1 1 3 1 5 2 5 6 1 3 2 1 2 3 5 2 2 5 4 1 1 3 1 3 3 1 3 2 6 4 2 20 1 4 16 7 6 2 2 </values>
</instantiation>