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

Result page for benchmark
TravellingSalesman/TravellingSalesman-xcsp2-s20/
TravellingSalesman-20-453_X2.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-xcsp2-s20/
TravellingSalesman-20-453_X2.xml
MD5SUM925e5fe90f97cdf1c5e5ffd441a363a2
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 benchmark1.13183
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints230
Number of domains5
Minimum domain size1
Maximum domain size1001
Distribution of domain sizes[{"size":1,"count":2},{"size":20,"count":20},{"size":180,"count":19},{"size":1001,"count":20}]
Minimum variable degree1
Maximum variable degree20
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":39},{"degree":20,"count":20}]
Minimum constraint arity2
Maximum constraint arity3
Distribution of constraint arities[{"arity":2,"count":210},{"arity":3,"count":20}]
Number of extensional constraints230
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":230}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2 (complete)4390050SAT 1.13183 1.13987
cosoco 2.0 (complete)4408590SAT 1.13374 1.13497
cosoco 2.0 (complete)4397330SAT 1.14734 1.14929
miniBTD 19.06.16 (complete)4391850SAT 20.448 20.4511
NACRE 1.0.5 (complete)4391650SAT 23.5435 23.5471
NACRE 1.0.5-Hybrid (complete)4391450SAT 25.0325 25.0368
(reference) PicatSAT 2019-09-12 (complete)4407798SAT 28.8184 28.8186

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] 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] 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] </list> <values>179 0 6 11 10 20 4 14 8 19 7
12 16 1 18 17 2 3 9 5 13 15 11 6 1 13 2 4 4 21 6 22 40 0 5 15 23 1 2 2 0 1 17 18 31 33 37 41 62 68 90 130 130 135 150 173 174 176 178 178
179 </values> </instantiation>