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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-68_ext.xml
MD5SUMfc0652b76d1c37a99baababb747c85cb
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 benchmark0.857869
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 AC206866SAT 0.857869 0.920179
Abscon 109 ESAC206865SAT 0.876865 0.925981
Mistral 2006-12-04206872SAT 6.67398 6.67758
Tramontane 2006-12-04206873SAT 6.72898 6.75524
BPrologCSPSolver70a 2006-12-13206863SAT 46.262 46.6461
CSP4J - Combo 2006-12-19206867SAT 54.2537 54.8093
CSP4J - MAC 2007-01-16270630SAT 55.4246 55.5693
CSP4J - MAC 2006-12-19206868SAT 56.2035 56.348
galacJ beta 1206864SAT 135.092 137.058
galac 1206869SAT 249.581 251.459
CSPtoSAT+minisat 0.3206875SAT 305.877 306.217
SAT4JCSP-CACHED 1.7 RC BF3206870? (MO) 448.284 448.421
sat4jCSP 1.7 RC BF3206871? (MO) 450.347 452.04
sugar 0.40206874? (TO) 1800.39 1804.96