2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
TravellingSalesman/
TravellingSalesman-150-50-00_c18.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/
TravellingSalesman-150-50-00_c18.xml
MD5SUM784274e168c99e425b71be44c62c6ab3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark537
Best CPU time to get the best result obtained on this benchmark252.034
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 1.12 (complete)4302127SAT (TO)537 252.034 252.01
Choco-solver 4.0.7b seq (e747e1e) (complete)4302125SAT (TO)608 252.118 245.218
Concrete 3.9.2-SuperNG (complete)4302688SAT (TO)989 252.143 236.635
OscaR - Hybrid 2018-08-14 (complete)4310314SAT (TO)1008 252.095 240.636
Mistral-2.0 2018-08-01 (complete)4312741SAT (TO)1240 251.977 252.017
Concrete 3.9.2 (complete)4302338SAT (TO)1428 252.129 240.519
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309964SAT (TO)2640 252.089 244.226
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312174SAT (TO)2900 252.051 244.026
Sat4j-CSP 2018-07-11 (complete)4302126? (TO) 260.193 109.848

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