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

Result page for benchmark
travellingSalesman/travellingSalesman-25/
tsp-25-561_ext.xml

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-561_ext.xml
MD5SUM39d209d9e0072422fe268a5af741f940
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 benchmark19.54
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables76
Number of constraints350
Maximum constraint arity3
Maximum domain size1001
Number of constraints which are defined in extension350
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 AC207791SAT 19.54 19.5953
Tramontane 2006-12-04207798SAT 38.6821 39.0465
Abscon 109 ESAC207790SAT 47.8547 48.1725
Mistral 2006-12-04207797SAT 80.0358 80.4293
sugar 0.40207799? 24.4 29.4277
CSP4J - MAC 2007-01-16270691? 37.5203 37.7142
CSP4J - MAC 2006-12-19207793? 41.9246 42.1087
CSP4J - Combo 2006-12-19207792? 42.5285 42.7916
galacJ beta 1207789? (problem) 105.378 105.502
CSPtoSAT+minisat 0.3207800? (MO) 13.8029 14.1103
SAT4JCSP-CACHED 1.7 RC BF3207795? (MO) 137.738 136.006
sat4jCSP 1.7 RC BF3207796? (MO) 143.032 140.546
galac 1207794? (TO) 1800.07 1807.79
BPrologCSPSolver70a 2006-12-13207788? (TO) 1800.09 1805.65