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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-715_ext.xml
MD5SUMb560b2188dccf33930e15d7e9eea996b
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 benchmark205.171
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 AC207934SAT 205.171 205.388
Abscon 109 ESAC207933SAT 491.037 491.943
Mistral 2006-12-04207940SAT 1332.07 1334.97
Tramontane 2006-12-04207941SAT 1492.45 1498.75
sugar 0.40207942? 25.98 26.2178
CSP4J - MAC 2006-12-19207936? 32.574 32.6485
CSP4J - Combo 2006-12-19207935? 33.176 33.4462
CSP4J - MAC 2007-01-16270702? 37.5823 37.8064
galacJ beta 1207932? (problem) 106.592 106.733
CSPtoSAT+minisat 0.3207943? (MO) 12.7281 12.8669
sat4jCSP 1.7 RC BF3207939? (MO) 183.758 182.167
SAT4JCSP-CACHED 1.7 RC BF3207938? (MO) 208.851 199.743
BPrologCSPSolver70a 2006-12-13207931? (TO) 1800.02 1808.43
galac 1207937? (TO) 1800.1 1815.71