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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-13_ext.xml
MD5SUM98a2bcb80321031da0c1cebada5e3a5d
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.51262
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 AC207765SAT 2.51262 2.52817
Abscon 109 ESAC207764SAT 2.87756 3.00809
Mistral 2006-12-04207771SAT 17.9503 17.9621
Tramontane 2006-12-04207772SAT 21.5507 21.5598
CSP4J - MAC 2007-01-16270689SAT 115.86 116.47
CSP4J - MAC 2006-12-19207767SAT 120.31 121.081
CSP4J - Combo 2006-12-19207766SAT 148.061 148.88
galac 1207768SAT 869.971 871.373
sugar 0.40207773? 13.75 14.0915
galacJ beta 1207763? (problem) 81.3536 81.8481
SAT4JCSP-CACHED 1.7 RC BF3207769? (MO) 140.075 132.903
sat4jCSP 1.7 RC BF3207770? (MO) 164.468 162.034
BPrologCSPSolver70a 2006-12-13207762? (TO) 1800.03 1800.42
CSPtoSAT+minisat 0.3207774? (TO) 1800.16 1806.33