CSP 2008 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
casper zito1048981SAT 0.004998 0.014038
MDG-probe 2008-06-271048968SAT 0.004999 0.013586
MDG-noprobe 2008-06-271048969SAT 0.005998 0.0120191
Mistral-prime 1.3131048979SAT 0.006998 0.0122691
Mistral-option 1.3141048978SAT 0.006998 0.0130229
casper zao1048980SAT 0.007998 0.019696
cpHydra k_401048985SAT 0.018996 0.0437351
cpHydra k_101048984SAT 0.018996 0.183107
bpsolver 2008-06-271048973SAT 0.023996 0.0291809
Minion/Tailor 2008-07-041104752SAT 0.263959 0.333352
Concrete + CPS4J 2008-05-301048967SAT 0.420935 0.477894
Concrete + CSP4J - Tabu Engine 2008-05-301048965SAT 0.421935 0.439675
Sugar v1.13+picosat1048971SAT 0.441932 0.49985
Concrete + CSP4J - WMC Engine 2008-05-301048966SAT 0.443931 0.488306
choco2_dwdeg 2008-06-261048975SAT 0.45493 0.47573
Sugar v1.13+minisat1048972SAT 0.480926 0.513321
choco2_impwdeg 2008-06-261048974SAT 0.508922 0.530522
Abscon 112v4 ESAC1048983SAT 0.647901 0.676674
Abscon 112v4 AC1048982SAT 0.6509 0.676793
galac M1048976SAT 0.765883 0.820945
galac E1048977SAT 0.784879 0.850565
SAT4J CSP 2008-06-131048970SAT 0.891864 0.907687

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