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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-453_ext.xml
MD5SUMbb6b398e728c9278bcb5c6d8b41c0637
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 benchmark24.3123
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 AC206918SAT 24.3123 24.4296
Abscon 109 ESAC206917SAT 41.8166 42.256
Mistral 2006-12-04206924SAT 73.2969 73.78
Tramontane 2006-12-04206925SAT 95.6165 96.0109
sugar 0.40206926? 19.53 19.8187
CSP4J - Combo 2006-12-19206919? 31.9391 32.2499
CSP4J - MAC 2007-01-16270634? 39.1311 39.4022
CSP4J - MAC 2006-12-19206920? 39.679 40.2224
galacJ beta 1206916? (problem) 98.0301 99.8583
SAT4JCSP-CACHED 1.7 RC BF3206922? (MO) 194.705 193.102
sat4jCSP 1.7 RC BF3206923? (MO) 202.934 201.013
CSPtoSAT+minisat 0.3206927? (MO) 584.555 587.947
galac 1206921? (TO) 1800.01 1807.64
BPrologCSPSolver70a 2006-12-13206915? (TO) 1800.11 1814.5