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

Result page for benchmark
travellingSalesman/travellingSalesman-20/
tsp-20-30_ext.xml

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-30_ext.xml
MD5SUM99508601b0bee9d74f9de02c0f7f18b1
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.07883
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables61
Number of constraints230
Maximum constraint arity3
Maximum domain size1001
Number of constraints which are defined in extension230
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 AC206879SAT 1.07883 1.13602
Abscon 109 ESAC206878SAT 1.90571 1.97995
Tramontane 2006-12-04206886SAT 14.0559 14.079
Mistral 2006-12-04206885SAT 15.3127 15.3193
CSP4J - MAC 2007-01-16270631SAT 105.853 106.628
CSP4J - MAC 2006-12-19206881SAT 111.213 111.406
CSP4J - Combo 2006-12-19206880SAT 111.665 112.74
galac 1206882SAT 598.19 601.899
sugar 0.40206887? 12.23 12.4601
galacJ beta 1206877? (problem) 98.614 99.1949
sat4jCSP 1.7 RC BF3206884? (MO) 199.224 198.464
SAT4JCSP-CACHED 1.7 RC BF3206883? (MO) 236.924 236.099
BPrologCSPSolver70a 2006-12-13206876? (TO) 1800.05 1802.45
CSPtoSAT+minisat 0.3206888? (TO) 1800.12 1801.55