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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/
travellingSalesman-20/tsp-20-8_ext.xml
MD5SUM7e1aa148d0e867f996fc4c0adf0ff767
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.00585
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 AC207048SAT 1.00585 1.03492
Abscon 109 ESAC207047SAT 1.21281 1.35332
Mistral 2006-12-04207054SAT 13.284 13.4036
Tramontane 2006-12-04207055SAT 13.6749 13.6824
CSP4J - MAC 2007-01-16270644SAT 76.8313 77.1282
CSP4J - Combo 2006-12-19207049SAT 77.0643 77.2115
CSP4J - MAC 2006-12-19207050SAT 81.9715 82.3915
galac 1207051SAT 324.125 326.085
BPrologCSPSolver70a 2006-12-13207045SAT 1643.8 1646.58
sugar 0.40207056? 8.81 9.0833
galacJ beta 1207046? (problem) 105.345 105.908
SAT4JCSP-CACHED 1.7 RC BF3207052? (MO) 193.122 191.172
sat4jCSP 1.7 RC BF3207053? (MO) 205.706 204.145
CSPtoSAT+minisat 0.3207057? (TO) 1800.1 1807.56