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

Result page for benchmark
pseudoSeries/garden/
g-100x100.xml

Jump to solvers results

General information on the benchmark

NamepseudoSeries/garden/
g-100x100.xml
MD5SUM5e7897ee9ea0277d42d3a7da7d315d2b
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 benchmark1.06984
SatisfiableYES
(Un)Satisfiability was provedYES
Number of variables10000
Number of constraints10000
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension10000
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
BPrologCSPSolver70a 2006-12-13210031SAT 1.06984 1.07674
CSPtoSAT+minisat 0.3210043SAT 1.12583 1.13389
sugar 0.40210042SAT 7.94579 8.09679
sat4jCSP 1.7 RC BF3210039SAT 10.1365 10.286
SAT4JCSP-CACHED 1.7 RC BF3210038SAT 11.7212 11.872
Abscon 109 ESAC210033SAT 12.7741 12.8663
Tramontane 2006-12-04210041SAT 14.3078 14.3412
Mistral 2006-12-04210040SAT 14.3588 14.4235
CSP4J - Combo 2006-12-19210035SAT 57.2123 57.3824
Abscon 109 AC210034SAT 78.5371 78.6436
CSP4J - MAC 2006-12-19210036SAT 209.076 210.183
galac 1210037SAT 212.983 213.256
CSP4J - MAC 2007-01-16270831SAT 227.741 229.889
galacJ beta 1210032SAT 551.406 553.871