CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/routing/
normalized-s3-3-3-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/routing/
normalized-s3-3-3-3.xml
MD5SUM453dfb6e349288d04561e6938325e862
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.176972
Satisfiable
(Un)Satisfiability was proved
Number of variables240
Number of constraints648
Maximum constraint arity20
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension648
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271049725SAT 0.176972 0.180705
cpHydra k_401049741SAT 0.204968 0.213879
cpHydra k_101049740SAT 0.207968 0.214713
Mistral-prime 1.3131049735SAT 0.241963 0.253681
MDG-probe 2008-06-271049724SAT 0.955854 0.965883
Minion/Tailor 2008-07-041104817SAT 0.975851 0.999706
casper zao1049736SAT 0.97985 1.0386
Mistral-option 1.3141049734SAT 1.3028 1.30973
Sugar v1.13+minisat1049728SAT 1.38779 1.42722
Sugar v1.13+picosat1049727SAT 1.41778 1.47814
casper zito1049737SAT 1.65675 1.67401
choco2_dwdeg 2008-06-261049731SAT 1.72774 1.77996
bpsolver 2008-06-271049729SAT 3.41148 3.45218
choco2_impwdeg 2008-06-261049730SAT 12.906 13.0374
Abscon 112v4 AC1049738SAT 22.1096 22.4365
Abscon 112v4 ESAC1049739SAT 25.3881 25.6736
Concrete + CPS4J 2008-05-301049723SAT 83.1824 83.2973
SAT4J CSP 2008-06-131049726? 863.345 866.234
Concrete + CSP4J - Tabu Engine 2008-05-301049721? (TO) 1800.08 1807.42
Concrete + CSP4J - WMC Engine 2008-05-301049722? (TO) 1800.08 1808.62
galac M1049732Wrong Cert. 3.99739 4.0868
galac E1049733Wrong Cert. 4.21736 4.33613

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0