CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/garden/
normalized-g-4x4.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/garden/
normalized-g-4x4.xml
MD5SUMa049eec66e3491b32d9e80b20f559e89
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 variables16
Number of constraints16
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension16
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131048937SAT 0.005998 0.014115
MDG-noprobe 2008-06-271048927SAT 0.006998 0.0132781
casper zito1048939SAT 0.006998 0.0161399
Mistral-option 1.3141048936SAT 0.007997 0.0137579
casper zao1048938SAT 0.007998 0.0168661
MDG-probe 2008-06-271048926SAT 0.007998 0.013755
cpHydra k_101048942SAT 0.017997 0.035522
cpHydra k_401048943SAT 0.019996 0.0245209
bpsolver 2008-06-271048931SAT 0.028995 0.0375361
Minion/Tailor 2008-07-041104750SAT 0.292955 0.335278
Sugar v1.13+minisat1048930SAT 0.483925 0.529735
choco2_impwdeg 2008-06-261048932SAT 0.485925 0.521964
Concrete + CPS4J 2008-05-301048925SAT 0.505922 0.533224
Concrete + CSP4J - Tabu Engine 2008-05-301048923SAT 0.509922 0.554054
Sugar v1.13+picosat1048929SAT 0.513921 0.766163
Concrete + CSP4J - WMC Engine 2008-05-301048924SAT 0.513921 0.539372
choco2_dwdeg 2008-06-261048933SAT 0.591909 0.672183
Abscon 112v4 ESAC1048941SAT 0.682895 0.733449
Abscon 112v4 AC1048940SAT 0.701893 0.733683
SAT4J CSP 2008-06-131048928SAT 0.895863 0.919017
galac M1048934SAT 0.963852 1.05614
galac E1048935SAT 1.00785 1.10555

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