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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-901_ext.xml
MD5SUMca0da3dc324e11d235214b7a2f0bb23c
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 benchmark16.9034
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 ESAC206956SAT 16.9034 17.0141
Abscon 109 AC206957SAT 18.4442 18.6172
Tramontane 2006-12-04206964SAT 36.5654 36.6871
Mistral 2006-12-04206963SAT 50.7503 51.251
sugar 0.40206965? 24.31 24.638
CSP4J - Combo 2006-12-19206958? 38.3502 38.6133
CSP4J - MAC 2006-12-19206959? 40.8458 41.3797
CSP4J - MAC 2007-01-16270637? 49.6435 49.7473
galacJ beta 1206955? (problem) 104.27 104.402
CSPtoSAT+minisat 0.3206966? (MO) 12.2611 12.3579
SAT4JCSP-CACHED 1.7 RC BF3206961? (MO) 226.22 224.454
sat4jCSP 1.7 RC BF3206962? (MO) 276.917 267.884
galac 1206960? (TO) 1800.02 1810.27
BPrologCSPSolver70a 2006-12-13206954? (TO) 1800.1 1808.81