CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/lexPuzzle/
normalized-crossword-m1-lex-puzzle02.xml

Jump to solvers results

General information on the benchmark

Namecsp/lexPuzzle/
normalized-crossword-m1-lex-puzzle02.xml
MD5SUMbd9d0c178ccf255c45ef9b214661e110
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 variables8
Number of constraints13
Maximum constraint arity6
Maximum domain size26
Number of constraints which are defined in extension6
Number of constraints which are defined in intension7
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141074498SAT 0.009998 0.0153291
Mistral-prime 1.3131074499SAT 0.013997 0.0222139
MDG-probe 2008-06-271074488SAT 0.016997 0.0230529
MDG-noprobe 2008-06-271074489SAT 0.018996 0.0256929
cpHydra k_401074505SAT 0.032994 0.033775
cpHydra k_101074504SAT 0.038993 0.156773
casper zito1074501SAT 0.039993 0.045857
casper zao1074500SAT 0.042993 0.051347
bpsolver 2008-06-271074493SAT 0.059989 0.0668529
Minion/Tailor 2008-07-041105953SAT 0.357945 0.398123
choco2_impwdeg 2008-06-261074494SAT 0.649901 0.683015
choco2_dwdeg 2008-06-261074495SAT 0.671897 0.674991
Sugar v1.13+minisat1074492SAT 0.707892 0.75137
Abscon 112v4 ESAC1074503SAT 0.737887 0.784878
Sugar v1.13+picosat1074491SAT 0.765883 0.865554
Abscon 112v4 AC1074502SAT 0.819875 0.851223
Concrete + CSP4J - Tabu Engine 2008-05-301074485SAT 36.5904 36.5845
Concrete + CSP4J - WMC Engine 2008-05-301074486SAT 37.8812 38.2902
galac M1074496SAT 74.4447 75.0893
galac E1074497SAT 75.1736 75.6192
Concrete + CPS4J 2008-05-301074487SAT 88.4556 88.9567
SAT4J CSP 2008-06-131074490SAT 1372.9 1385.89

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 3 0 0 0 2 20 1