CSP 2009 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/garden/
normalized-g-2x2.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/garden/
normalized-g-2x2.xml
MD5SUM076ad499e79b7ebd84628d511cbfaf9c
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.004998
Satisfiable
(Un)Satisfiability was proved
Number of variables4
Number of constraints4
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension4
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral 1.545 (complete)2066508SAT 0.004998 0.0136611
pcs-restart 0.3.2 (complete)2066501SAT 0.013997 0.02744
pcs 0.3.2 (complete)2066500SAT 0.015997 0.0233301
bpsolver 09 (complete)2066509SAT 0.022996 0.0301249
Sugar v1.14.6+picosat (complete)2066505SAT 0.484925 0.545983
Choco2.1.1b 2009-07-16 (complete)2115282SAT 0.493924 0.527432
Sugar v1.14.6+minisat (complete)2066506SAT 0.51792 0.546334
Choco2.1.1 2009-06-10 (complete)2066504SAT 0.527918 0.54921
Abscon 112v4 AC (complete)2094741SAT 0.655899 0.691668
Abscon 112v4 ESAC (complete)2094742SAT 0.663899 0.679728
SAT4J CSP 2.1.1 (complete)2066499SAT 0.698893 0.720334
Concrete 2009-07-14 (complete)2066502SAT 1.00385 1.03517
Concrete DC 2009-07-14 (complete)2066503SAT 1.05784 1.08807

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