CSP 2006 Competition (second round): solvers results per benchmarks

Result page for benchmark
travellingSalesman/travellingSalesman-20/
tsp-20-366_ext.xml

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-366_ext.xml
MD5SUM9fb868b7560f00f44a58b95ae201c2fb
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark1.56976
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables61
Number of constraints230
Maximum constraint arity3
Maximum domain size1001
Number of constraints which are defined in extension230
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Abscon 109 AC206996SAT 1.56976 1.59923
Abscon 109 ESAC206995SAT 2.39364 2.48293
Tramontane 2006-12-04207003SAT 24.7582 24.7744
Mistral 2006-12-04207002SAT 28.2037 28.465
sugar 0.40207004? 19.57 19.8049
CSP4J - Combo 2006-12-19206997? 34.0628 34.4637
CSP4J - MAC 2006-12-19206998? 35.8775 36.1358
CSP4J - MAC 2007-01-16270640? 37.3913 37.7877
galacJ beta 1206994? (problem) 82.8914 83.3976
sat4jCSP 1.7 RC BF3207001? (MO) 162.925 163.777
SAT4JCSP-CACHED 1.7 RC BF3207000? (MO) 169.628 170.15
CSPtoSAT+minisat 0.3207005? (MO) 1076.57 1085.45
BPrologCSPSolver70a 2006-12-13206993? (TO) 1800.02 1803.31
galac 1206999? (TO) 1800.04 1807.94