CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/garden/
normalized-g-9x9.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/garden/
normalized-g-9x9.xml
MD5SUM0c2b22813c1888cc45767f04ce43a66b
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.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables81
Number of constraints81
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension81
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271049011SAT 0.010997 0.0197661
Mistral-option 1.3141049020SAT 0.011997 0.0179701
casper zito1049023SAT 0.013997 0.021471
Mistral-prime 1.3131049021SAT 0.013997 0.020211
MDG-probe 2008-06-271049010SAT 0.013997 0.0141581
casper zao1049022SAT 0.019996 0.025871
cpHydra k_101049026SAT 0.024995 0.030975
cpHydra k_401049027SAT 0.024995 0.028565
bpsolver 2008-06-271049015SAT 0.051991 0.0612741
Minion/Tailor 2008-07-041104754SAT 0.468928 0.524817
Sugar v1.13+minisat1049014SAT 0.662898 0.746842
Sugar v1.13+picosat1049013SAT 0.683895 0.752755
choco2_impwdeg 2008-06-261049016SAT 0.71289 0.741031
choco2_dwdeg 2008-06-261049017SAT 0.712891 0.743284
Concrete + CSP4J - Tabu Engine 2008-05-301049007SAT 0.743886 0.790737
Concrete + CPS4J 2008-05-301049009SAT 0.751885 0.793797
Concrete + CSP4J - WMC Engine 2008-05-301049008SAT 0.819875 0.851956
Abscon 112v4 ESAC1049025SAT 0.827873 0.833544
Abscon 112v4 AC1049024SAT 0.866868 0.900179
galac E1049019SAT 1.3158 1.37496
galac M1049018SAT 1.36479 1.40932
SAT4J CSP 2008-06-131049012SAT 1.56676 1.60309

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 1 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0
0 1 1 1 1 0 0 0 1 0 0