2017 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-xcsp2-s25/
TravellingSalesman-25-003_X2.xml
MD5SUMd6e988770bc6f2507c309b4f4f3312cf
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 benchmark2.1796
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":149,"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-mini 1.12 (complete)4267496SAT 2.1796 2.1849599
cosoco-mini 1.1 (2017-07-29) (complete)4260315SAT 2.1887 2.25226
cosoco-mini 1.1 (2017-06-27) (complete)4253452SAT 2.19888 2.19953
miniBTD 2017-06-30 (complete)4253451SAT 5.61175 5.61301
miniBTD 2017-08-10 (complete)4265055SAT 5.6381602 5.6392798
Naxos 1.1.0 (complete)4253453SAT 325.61 325.626

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>148 0 13 11 4 6 9 23 1 16 20 22 7 24 5 12 18 14 15 2 25 10 8 17 21 19 3 2 12 1 2 4
3 7 19 1 1 0 14 12 8 2 15 7 10 10 4 2 2 8 2 0 14 15 17 21 24 31 50 51 52 52 66 78 86 88 103 110 120 130 134 136 138 146 148 148 </values>
</instantiation>