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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-312_ext.xml
MD5SUM18cb898c6d4e9c374a0c354fbac95ecf
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 benchmark55.6755
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 ESAC207881SAT 55.6755 55.7675
Mistral 2006-12-04207888SAT 63.6513 63.7233
Tramontane 2006-12-04207889SAT 155.684 155.929
Abscon 109 AC207882SAT 198.213 198.481
sugar 0.40207890? 28.01 28.428
CSP4J - Combo 2006-12-19207883? 33.142 33.5608
CSP4J - MAC 2006-12-19207884? 34.2738 34.61
CSP4J - MAC 2007-01-16270698? 46.7569 46.8207
galacJ beta 1207880? (problem) 98.458 99.2933
CSPtoSAT+minisat 0.3207891? (MO) 12.89 12.9752
sat4jCSP 1.7 RC BF3207887? (MO) 151.896 150.197
SAT4JCSP-CACHED 1.7 RC BF3207886? (MO) 160.154 158.092
galac 1207885? (TO) 1800 1819.45
BPrologCSPSolver70a 2006-12-13207879? (TO) 1800.04 1809.13