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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-54_ext.xml
MD5SUM36c7ad288916c589556169f97cb0ef4b
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.41978
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 AC207921SAT 1.41978 1.43821
Abscon 109 ESAC207920SAT 1.52877 1.55926
Tramontane 2006-12-04207928SAT 15.2027 15.2082
Mistral 2006-12-04207927SAT 15.6256 15.704
galac 1207924SAT 752.099 760.069
CSPtoSAT+minisat 0.3207930SAT 1661.47 1662.27
sugar 0.40207929? 14.12 14.4483
CSP4J - MAC 2006-12-19207923? 40.7428 40.8327
CSP4J - Combo 2006-12-19207922? 42.2456 43.3699
CSP4J - MAC 2007-01-16270701? 44.0043 44.107
galacJ beta 1207919? (problem) 98.709 99.654
sat4jCSP 1.7 RC BF3207926? (MO) 156.548 154.353
SAT4JCSP-CACHED 1.7 RC BF3207925? (MO) 157.888 155.998
BPrologCSPSolver70a 2006-12-13207918? (TO) 1800.03 1807.06