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

Result page for benchmark
pseudoSeries/
garden/g-7x7.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/
garden/g-7x7.xml
MD5SUM8338434ce05d06fed9adcc64b7450d1e
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.016997
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables49
Number of constraints49
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension49
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
CSPtoSAT+minisat 0.3210108SAT 0.016997 0.0202251
Tramontane 2006-12-04210106SAT 0.017997 0.019371
Mistral 2006-12-04210105SAT 0.019996 0.0292999
BPrologCSPSolver70a 2006-12-13210096SAT 0.022996 0.024009
CSP4J - MAC 2006-12-19210101SAT 0.546916 0.597337
CSP4J - MAC 2007-01-16270836SAT 0.548916 0.599536
CSP4J - Combo 2006-12-19210100SAT 0.58791 0.619353
Abscon 109 ESAC210098SAT 0.677896 0.728129
Abscon 109 AC210099SAT 0.700893 0.764043
sugar 0.40210107SAT 0.795878 0.946965
galacJ beta 1210097SAT 1.21981 1.3037
sat4jCSP 1.7 RC BF3210104SAT 1.22581 1.24182
SAT4JCSP-CACHED 1.7 RC BF3210103SAT 1.24881 1.31393
galac 1210102SAT 1.25781 1.37479