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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-25/
tsp-25-190_ext.xml
MD5SUMbd61458ec10415399e486da667df4e26
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 benchmark65.1211
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 ESAC207907SAT 65.1211 65.4371
Abscon 109 AC207908SAT 147.691 149.063
Mistral 2006-12-04207914SAT 204.239 204.314
Tramontane 2006-12-04207915SAT 329.341 329.431
sugar 0.40207916? 23.06 23.273
CSP4J - Combo 2006-12-19207909? 36.7934 37.0996
CSP4J - MAC 2007-01-16270700? 38.3022 38.736
CSP4J - MAC 2006-12-19207910? 38.5981 39.1768
galacJ beta 1207906? (problem) 108.56 109.258
CSPtoSAT+minisat 0.3207917? (MO) 14.2518 14.2975
sat4jCSP 1.7 RC BF3207913? (MO) 140.446 132.096
SAT4JCSP-CACHED 1.7 RC BF3207912? (MO) 140.535 138.933
galac 1207911? (TO) 1800.05 1813.68
BPrologCSPSolver70a 2006-12-13207905? (TO) 1800.1 1814.43