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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/
travellingSalesman-20/tsp-20-2_ext.xml
MD5SUMb9a7be1fad569e5c2e874ee391512cae
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 benchmark3.56646
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 ESAC206969SAT 3.56646 3.64384
Abscon 109 AC206970SAT 7.2189 7.26399
Mistral 2006-12-04206976SAT 23.4834 23.7235
Tramontane 2006-12-04206977SAT 30.8613 31.3517
galac 1206973SAT 954.91 962.769
sugar 0.40206978? 18.72 19.1132
CSP4J - MAC 2006-12-19206972? 33.5459 33.8882
CSP4J - Combo 2006-12-19206971? 33.7409 34.1256
CSP4J - MAC 2007-01-16270638? 41.9516 42.459
galacJ beta 1206968? (problem) 104.135 105.221
SAT4JCSP-CACHED 1.7 RC BF3206974? (MO) 171.358 169.329
sat4jCSP 1.7 RC BF3206975? (MO) 239.508 238.618
CSPtoSAT+minisat 0.3206979? (MO) 707.972 711.564
BPrologCSPSolver70a 2006-12-13206967? (TO) 1800.07 1802.05