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

Result page for benchmark
pseudoSeries/
garden/g-9x3.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/
garden/g-9x3.xml
MD5SUM9f28417c55285d128dc58165376652e7
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.014997
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables27
Number of constraints27
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension27
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 2006-12-04210066SAT 0.014997 0.025525
BPrologCSPSolver70a 2006-12-13210057SAT 0.018996 0.0199219
CSPtoSAT+minisat 0.3210069SAT 0.022996 0.0760831
Tramontane 2006-12-04210067SAT 0.023995 0.0937841
CSP4J - MAC 2007-01-16270833SAT 0.457929 0.507649
sugar 0.40210068SAT 0.45893 0.879988
CSP4J - Combo 2006-12-19210061SAT 0.501923 0.562441
CSP4J - MAC 2006-12-19210062SAT 0.502923 0.559312
Abscon 109 AC210060SAT 0.660898 0.71196
Abscon 109 ESAC210059SAT 0.703892 0.729603
sat4jCSP 1.7 RC BF3210065SAT 0.901862 0.731616
SAT4JCSP-CACHED 1.7 RC BF3210064SAT 0.905861 0.733727
galac 1210063SAT 1.18782 1.26053
galacJ beta 1210058SAT 1.18882 1.26025