CSP 2008 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.005998
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
casper zito1049044SAT 0.005998 0.010697
Mistral-option 1.3141049041SAT 0.007997 0.0145769
MDG-probe 2008-06-271049031SAT 0.007998 0.01468
MDG-noprobe 2008-06-271049032SAT 0.008998 0.00917593
Mistral-prime 1.3131049042SAT 0.008998 0.0142771
casper zao1049043SAT 0.010998 0.011859
cpHydra k_401049048SAT 0.017996 0.0264929
cpHydra k_101049047SAT 0.018996 0.026116
bpsolver 2008-06-271049036SAT 0.032994 0.0387461
Minion/Tailor 2008-07-041104755SAT 0.328949 0.382031
choco2_dwdeg 2008-06-261049038SAT 0.511922 0.523256
Sugar v1.13+picosat1049034SAT 0.523919 0.527403
Concrete + CSP4J - WMC Engine 2008-05-301049029SAT 0.534918 0.583537
Sugar v1.13+minisat1049035SAT 0.555914 0.703552
Concrete + CPS4J 2008-05-301049030SAT 0.561914 0.584269
choco2_impwdeg 2008-06-261049037SAT 0.567913 0.578499
Concrete + CSP4J - Tabu Engine 2008-05-301049028SAT 0.623904 0.651091
Abscon 112v4 AC1049045SAT 0.71789 0.730791
Abscon 112v4 ESAC1049046SAT 0.736887 0.802594
SAT4J CSP 2008-06-131049033SAT 1.02384 1.08391
galac M1049039SAT 1.04084 1.15522
galac E1049040SAT 1.16482 1.22162

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