CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/garden/
normalized-g-9x3.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/garden/
normalized-g-9x3.xml
MD5SUM4ca8aae4b8d7bfaa3d821d8d6ba5a3fb
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.007998
Satisfiable
(Un)Satisfiability was proved
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 1.545 (complete)2066541SAT 0.007998 0.01691
pcs-restart 0.3.2 (complete)2066534SAT 0.017996 0.0325401
pcs 0.3.2 (complete)2066533SAT 0.020996 0.0288741
bpsolver 09 (complete)2066542SAT 0.032994 0.041379
Choco2.1.1 2009-06-10 (complete)2066537SAT 0.549916 0.574339
Choco2.1.1b 2009-07-16 (complete)2115285SAT 0.569913 0.604408
Sugar v1.14.6+picosat (complete)2066538SAT 0.573911 0.735624
Sugar v1.14.6+minisat (complete)2066539SAT 0.617905 0.758725
Abscon 112v4 ESAC (complete)2094748SAT 0.713891 0.729899
SAT4J CSP 2.1.1 (complete)2066532SAT 0.812876 0.828906
Abscon 112v4 AC (complete)2094747SAT 0.820874 0.846067
Concrete 2009-07-14 (complete)2066535SAT 1.19382 1.23079
Concrete DC 2009-07-14 (complete)2066536SAT 1.22081 1.25857

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
1 1 1 1 1 1 0 1 0 0 0 1 1 0 0 0 1 1 1 0 1 0 0 1 1 0 1