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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-66_ext.xml
MD5SUMfcadb94f08912b090e26967068500721
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 benchmark2.03269
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 ESAC207894SAT 2.03269 2.06395
Abscon 109 AC207895SAT 3.2735 3.33838
Tramontane 2006-12-04207902SAT 14.1229 14.184
Mistral 2006-12-04207901SAT 16.8294 17.0194
CSP4J - MAC 2007-01-16270699SAT 84.4792 84.9419
CSP4J - MAC 2006-12-19207897SAT 90.2723 90.3889
CSP4J - Combo 2006-12-19207896SAT 92.377 92.8654
galac 1207898SAT 362.851 364.856
galacJ beta 1207893? (problem) 125.029 125.237
SAT4JCSP-CACHED 1.7 RC BF3207899? (MO) 144.834 142.354
sat4jCSP 1.7 RC BF3207900? (MO) 151.435 148.893
BPrologCSPSolver70a 2006-12-13207892? (TO) 1800.03 1809.15
CSPtoSAT+minisat 0.3207904? (TO) 1800.21 1807.37
sugar 0.40207903? (TO) 1800.24 1804.28