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

Result page for benchmark
travellingSalesman/travellingSalesman-25/
tsp-25-523_ext.xml

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-523_ext.xml
MD5SUM574d05c6319781b81aa96225f5b39ad5
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 benchmark18.2322
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables76
Number of constraints350
Maximum constraint arity3
Maximum domain size1001
Number of constraints which are defined in extension350
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 AC207843SAT 18.2322 18.3598
Abscon 109 ESAC207842SAT 62.0026 62.6305
Mistral 2006-12-04207849SAT 200.606 202.2
Tramontane 2006-12-04207850SAT 309.398 309.75
sugar 0.40207851? 24.32 24.733
CSP4J - MAC 2006-12-19207845? 34.3278 34.4423
CSP4J - Combo 2006-12-19207844? 34.5058 35.0104
CSP4J - MAC 2007-01-16270695? 38.9901 39.237
galacJ beta 1207841? (problem) 101.4 102.195
CSPtoSAT+minisat 0.3207852? (MO) 13.5609 13.6898
sat4jCSP 1.7 RC BF3207848? (MO) 157.039 155.195
SAT4JCSP-CACHED 1.7 RC BF3207847? (MO) 192.835 192.493
galac 1207846? (TO) 1800.01 1810.46
BPrologCSPSolver70a 2006-12-13207840? (TO) 1800.05 1803.88