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

Result page for benchmark
pseudoSeries/
garden/g-15x15.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/
garden/g-15x15.xml
MD5SUMcb3e02e64c95cdd09578fe7e991e0f2f
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.033994
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables225
Number of constraints225
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension225
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CSPtoSAT+minisat 0.3210030SAT 0.033994 0.040795
BPrologCSPSolver70a 2006-12-13210018SAT 0.038993 0.0446549
Mistral 2006-12-04210027SAT 0.040993 0.048928
Tramontane 2006-12-04210028SAT 0.040993 0.0482761
Abscon 109 AC210021SAT 0.85087 0.871234
Abscon 109 ESAC210020SAT 0.882865 0.92636
CSP4J - Combo 2006-12-19210022SAT 1.00585 1.1377
CSP4J - MAC 2006-12-19210023SAT 1.03284 1.06576
sugar 0.40210029SAT 1.09 1.18895
CSP4J - MAC 2007-01-16270830SAT 1.13083 1.18906
galac 1210024SAT 1.80272 1.91293
galacJ beta 1210019SAT 1.9367 2.06113
sat4jCSP 1.7 RC BF3210026SAT 2.07268 2.26243
SAT4JCSP-CACHED 1.7 RC BF3210025SAT 2.10568 2.15303