Can a two-stack PDA accept language $a^nb^mc^nd^m$ which is not context-free?
A two-stack PDA is equivalent in computing power to a Turing machine. Since a Turing machine can accept that language (stated without proof), a two-stack PDA can as well. The actual definition of such a machine is left as an exercise :)