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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-75_ext.xml
MD5SUM9ff095dafb0e8171c6629ca2683c9aa0
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 benchmark25.9381
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 ESAC207008SAT 25.9381 26.4337
Mistral 2006-12-04207015SAT 30.4124 30.6198
Abscon 109 AC207009SAT 31.2672 31.3636
Tramontane 2006-12-04207016SAT 52.437 53.1716
sugar 0.40207017? 19.75 20.1343
CSP4J - Combo 2006-12-19207010? 32.905 33.0154
CSP4J - MAC 2006-12-19207011? 35.8875 36.2432
CSP4J - MAC 2007-01-16270641? 40.3219 40.3887
galacJ beta 1207007? (problem) 98.1661 98.3373
SAT4JCSP-CACHED 1.7 RC BF3207013? (MO) 193.381 190.929
sat4jCSP 1.7 RC BF3207014? (MO) 290.695 289.974
CSPtoSAT+minisat 0.3207018? (MO) 685.298 689.353
galac 1207012? (TO) 1800.01 1814.52
BPrologCSPSolver70a 2006-12-13207006? (TO) 1800.03 1814.4