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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-29_ext.xml
MD5SUM04b4795b77409afc7c05ce4059628839
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 benchmark0.945855
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 AC206892SAT 0.945855 0.993426
Abscon 109 ESAC206891SAT 1.58476 1.72202
Tramontane 2006-12-04206899SAT 12.5851 12.6524
Mistral 2006-12-04206898SAT 12.6581 12.7667
CSP4J - MAC 2007-01-16270632SAT 86.4179 86.9349
CSP4J - MAC 2006-12-19206894SAT 86.6218 87.0624
CSP4J - Combo 2006-12-19206893SAT 91.0322 91.2715
galac 1206895SAT 405.161 409.272
sugar 0.40206900? 10.1 10.3378
galacJ beta 1206890? (problem) 111.584 112.233
SAT4JCSP-CACHED 1.7 RC BF3206896? (MO) 181.395 179.763
sat4jCSP 1.7 RC BF3206897? (MO) 221.083 219.223
BPrologCSPSolver70a 2006-12-13206889? (TO) 1800.05 1804.15
CSPtoSAT+minisat 0.3206901? (TO) 1800.13 1801.01