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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/
travellingSalesman-25/tsp-25-3_ext.xml
MD5SUMbecd11c6854c882d506c44f3436c1dde
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 benchmark5.43817
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 AC207947SAT 5.43817 5.51556
Abscon 109 ESAC207946SAT 8.76367 8.83136
Tramontane 2006-12-04207954SAT 19.907 20.0027
Mistral 2006-12-04207953SAT 22.4946 23.5683
galac 1207950SAT 1072.38 1082.83
sugar 0.40207955? 16.59 16.7378
CSP4J - MAC 2006-12-19207949? 37.5773 37.6468
CSP4J - Combo 2006-12-19207948? 37.9642 38.0023
CSP4J - MAC 2007-01-16270703? 46.5569 46.8242
galacJ beta 1207945? (problem) 106.206 106.777
SAT4JCSP-CACHED 1.7 RC BF3207951? (MO) 135.929 134.322
sat4jCSP 1.7 RC BF3207952? (MO) 148.571 146.342
BPrologCSPSolver70a 2006-12-13207944? (TO) 1800.04 1808.59
CSPtoSAT+minisat 0.3207956? (TO) 1800.18 1806.48