CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/garden/
normalized-g-7x7.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/garden/
normalized-g-7x7.xml
MD5SUMe713bdf502b1b9e5affa523f883e26de
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.009998
Satisfiable
(Un)Satisfiability was proved
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
Mistral 1.545 (complete)2066497SAT 0.009998 0.0177749
pcs-restart 0.3.2 (complete)2066490SAT 0.023996 0.0301801
pcs 0.3.2 (complete)2066489SAT 0.023996 0.0312769
bpsolver 09 (complete)2066498SAT 0.040992 0.048758
Choco2.1.1 2009-06-10 (complete)2066493SAT 0.58791 0.626432
Sugar v1.14.6+minisat (complete)2066495SAT 0.596908 0.66018
Sugar v1.14.6+picosat (complete)2066494SAT 0.640902 0.749552
Choco2.1.1b 2009-07-16 (complete)2115281SAT 0.660899 0.682043
Abscon 112v4 AC (complete)2094739SAT 0.797877 0.835891
Abscon 112v4 ESAC (complete)2094740SAT 0.827873 0.845895
SAT4J CSP 2.1.1 (complete)2066488SAT 1.16582 1.20255
Concrete 2009-07-14 (complete)2066491SAT 1.3018 1.34896
Concrete DC 2009-07-14 (complete)2066492SAT 1.3208 1.35065

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:
0 1 1 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 1 1 0 1 1 0 1 1 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 1 1 1 1 1 1 1 0