2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
TravellingSalesman/TravellingSalesman-xcsp2-s20a4/
TravellingSalesman-4-20-001-a4_X2.xml

Jump to solvers results

General information on the benchmark

NameTravellingSalesman/TravellingSalesman-xcsp2-s20a4/
TravellingSalesman-4-20-001-a4_X2.xml
MD5SUMb8ea00653452363d0c81f6ef3102e485
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 benchmark0.830237
Satisfiable
(Un)Satisfiability was proved
Number of variables61
Number of constraints228
Number of domains5
Minimum domain size1
Maximum domain size1001
Distribution of domain sizes[{"size":1,"count":2},{"size":20,"count":20},{"size":161,"count":19},{"size":1001,"count":20}]
Minimum variable degree1
Maximum variable degree208
Distribution of variable degrees[{"degree":1,"count":2},{"degree":2,"count":37},{"degree":19,"count":1},{"degree":20,"count":18},{"degree":37,"count":1},{"degree":190,"count":1},{"degree":208,"count":1}]
Minimum constraint arity2
Maximum constraint arity4
Distribution of constraint arities[{"arity":2,"count":1},{"arity":3,"count":20},{"arity":4,"count":207}]
Number of extensional constraints228
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":228}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco 2.0 (complete)4407924SAT 0.830237 0.83189
cosoco 2 (complete)4389384SAT 0.833292 0.843365
cosoco 2.0 (complete)4396664SAT 0.941033 0.94307
BTD 19.07.01 (complete)4386879SAT 1.02273 1.02293
cosoco 2.0 parallel (complete)4409204SAT 3.60323 0.743451
choco-solver 2019-09-24 (complete)4405744SAT 3.91997 1.78893
AbsCon 2019-07-23 (complete)4390484SAT 6.36891 3.16069
cosoco 2.O parallel (complete)4397944SAT 6.5802 1.11767
choco-solver 2019-09-16 (complete)4398844SAT 9.93769 3.26993
choco-solver 2019-09-20 (complete)4403344SAT 10.3484 3.31276
choco-solver 2019-06-14 (complete)4392884SAT 10.4104 3.32326
Concrete 3.10 (complete)4387394SAT 10.4691 4.37463
Concrete 3.12.2 (complete)4400644SAT 10.6961 4.28314
Concrete 3.12.3 (complete)4402444SAT 11.5335 4.86716
Concrete 3.12.2 (complete)4395764SAT 11.7035 4.97076
PicatSAT 2019-09-12 (complete)4394864SAT 19.1204 19.1294
choco-solver 2019-09-20 parallel (complete)4404244SAT 21.52 4.48872
choco-solver 2019-09-16 parallel (complete)4399444SAT 22.4656 4.92608
choco-solver 2019-09-24 parallel (complete)4406644SAT 23.1892 4.7047
choco-solver 2019-06-14 parallel (complete)4393484SAT 23.2731 5.07691
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392284SAT 132.589 103.698
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405144SAT 134.825 105.607
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388215SAT 134.897 105.641
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388214SAT 138.026 108.775
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405444SAT 141.752 112.412
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392584SAT 142.118 112.219

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>160 0 10 3 16 12 4 9 5 18 8 14
13 2 15 7 1 19 6 17 20 11 13 3 1 15 6 0 5 11 2 1 2 20 7 26 0 21 0 3 15 9 16 17 32 38 38 43 54 56 57 59 79 86 112 112 133 133 136 151 160
</values> </instantiation>