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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/
travellingSalesman-20/tsp-20-1_ext.xml
MD5SUM7569ce1a1609d9840c3e44b4ffff2c0c
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 benchmark1.3118
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 AC207022SAT 1.3118 1.33727
Abscon 109 ESAC207021SAT 1.72774 1.85608
Mistral 2006-12-04207028SAT 13.8209 13.9086
Tramontane 2006-12-04207029SAT 15.6316 15.7805
galac 1207025SAT 665.841 669.482
sugar 0.40207030? 16.44 16.6376
CSP4J - MAC 2007-01-16270642? 44.8102 45.3326
CSP4J - Combo 2006-12-19207023? 45.942 46.1544
CSP4J - MAC 2006-12-19207024? 53.0779 53.7479
galacJ beta 1207020? (problem) 106.247 106.705
sat4jCSP 1.7 RC BF3207027? (MO) 182.602 181.546
SAT4JCSP-CACHED 1.7 RC BF3207026? (MO) 246.618 245.753
BPrologCSPSolver70a 2006-12-13207019? (TO) 1800.05 1811.92
CSPtoSAT+minisat 0.3207031? (TO) 1800.16 1808.73