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

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

Jump to solvers results

General information on the benchmark

NametravellingSalesman/travellingSalesman-20/
tsp-20-193_ext.xml
MD5SUMdda026ca5776543126e6e6233faa1f9c
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 benchmark4.24835
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 AC206983SAT 4.24835 4.40349
Abscon 109 ESAC206982SAT 16.3645 16.5826
Mistral 2006-12-04206989SAT 64.7622 65.7399
Tramontane 2006-12-04206990SAT 90.4523 91.2128
sugar 0.40206991? 27.25 27.4838
CSP4J - Combo 2006-12-19206984? 33.3069 33.6237
CSP4J - MAC 2007-01-16270639? 33.4529 33.6685
CSP4J - MAC 2006-12-19206985? 33.5419 33.726
galacJ beta 1206981? (problem) 100.28 100.49
CSPtoSAT+minisat 0.3206992? (MO) 13.7359 13.8907
sat4jCSP 1.7 RC BF3206988? (MO) 175.238 173.404
SAT4JCSP-CACHED 1.7 RC BF3206987? (MO) 229.292 228.348
BPrologCSPSolver70a 2006-12-13206980? (TO) 1800.03 1815.17
galac 1206986? (TO) 1800.08 1804.92