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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-38_ext.xml
MD5SUM0c2fc7f76e883b767656d993cf4bfd5c
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.57661
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 AC207869SAT 2.57661 2.64596
Abscon 109 ESAC207868SAT 6.31304 6.3984
Mistral 2006-12-04207875SAT 21.4557 21.6378
Tramontane 2006-12-04207876SAT 22.6246 22.7203
galac 1207872SAT 773.637 775.948
sugar 0.40207877? 15.9 16.2594
CSP4J - Combo 2006-12-19207870? 33.5959 33.9526
CSP4J - MAC 2006-12-19207871? 37.9152 38.9138
CSP4J - MAC 2007-01-16270697? 46.8099 47.329
galacJ beta 1207867? (problem) 101.789 101.899
sat4jCSP 1.7 RC BF3207874? (MO) 164.496 162.939
SAT4JCSP-CACHED 1.7 RC BF3207873? (MO) 171.36 170.483
BPrologCSPSolver70a 2006-12-13207866? (TO) 1800.04 1802.75
CSPtoSAT+minisat 0.3207878? (TO) 1800.16 1814.08