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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-142_ext.xml
MD5SUM144010786dd3cca51eaddf77d449271f
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 benchmark29.6705
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 AC206944SAT 29.6705 29.8294
Tramontane 2006-12-04206951SAT 31.3072 31.608
Abscon 109 ESAC206943SAT 42.5975 43.0342
Mistral 2006-12-04206950SAT 77.5272 77.6167
sugar 0.40206952? 19.97 20.4049
CSP4J - MAC 2006-12-19206946? 34.7297 35.2006
CSP4J - Combo 2006-12-19206945? 35.3006 35.7001
CSP4J - MAC 2007-01-16270636? 40.1899 40.2374
galacJ beta 1206942? (problem) 101.032 101.15
sat4jCSP 1.7 RC BF3206949? (MO) 215.226 214.966
SAT4JCSP-CACHED 1.7 RC BF3206948? (MO) 233.587 231.612
CSPtoSAT+minisat 0.3206953? (MO) 593.134 596.017
BPrologCSPSolver70a 2006-12-13206941? (TO) 1800.07 1802.2
galac 1206947? (TO) 1800.09 1813.82