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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-190_ext.xml
MD5SUMa89bb561468359a06ccad831f3aba8c2
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 benchmark4.79527
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 AC206905SAT 4.79527 4.88782
Abscon 109 ESAC206904SAT 5.83211 5.90622
Mistral 2006-12-04206911SAT 19.2211 19.3432
Tramontane 2006-12-04206912SAT 24.0483 24.1522
CSP4J - Combo 2006-12-19206906SAT 143.512 143.657
CSP4J - MAC 2006-12-19206907SAT 149.232 150.067
galac 1206908SAT 921.032 924.347
sugar 0.40206913? 14.25 14.5232
CSP4J - MAC 2007-01-16270633? 44.5702 44.6918
galacJ beta 1206903? (problem) 111.985 112.689
sat4jCSP 1.7 RC BF3206910? (MO) 181.293 182.354
SAT4JCSP-CACHED 1.7 RC BF3206909? (MO) 190.859 191.628
BPrologCSPSolver70a 2006-12-13206902? (TO) 1800.07 1813.47
CSPtoSAT+minisat 0.3206914? (TO) 1800.14 1815.63