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

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

Jump to solvers results

General information on the benchmark

NamepseudoSeries/
garden/g-9x9.xml
MD5SUM434de8db086a27a2796339a502f853db
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.017996
SatisfiableYES
(Un)Satisfiability was provedYES
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
CSPtoSAT+minisat 0.3210056SAT 0.017996 0.0266149
Mistral 2006-12-04210053SAT 0.020996 0.0235079
Tramontane 2006-12-04210054SAT 0.020996 0.0231581
BPrologCSPSolver70a 2006-12-13210044SAT 0.025995 0.0315281
sugar 0.40210055SAT 0.203968 1.01416
CSP4J - MAC 2006-12-19210049SAT 0.661899 0.706337
CSP4J - Combo 2006-12-19210048SAT 0.705892 0.773301
CSP4J - MAC 2007-01-16270832SAT 0.707891 0.773321
Abscon 109 AC210047SAT 0.768882 0.833938
Abscon 109 ESAC210046SAT 0.789879 0.872166
galacJ beta 1210045SAT 1.3038 1.39495
galac 1210050SAT 1.3268 1.40784
sat4jCSP 1.7 RC BF3210052SAT 1.44578 1.03118
SAT4JCSP-CACHED 1.7 RC BF3210051SAT 1.47078 1.04029