proof tree latex using bussproofs

Question

\documentclass{article}
\usepackage{bussproofs}
\begin{document}
\begin{prooftree}
\AxiomC{P}
\AxiomC{$\neg P,Q$}
\BinaryInfC{Q}
\AxiomC{E}
\AxiomC{F}
\BinaryInfC{G}
\UnaryInfC{H}
\BinaryInfC{R}
\end{prooftree}
\end{document}

I used bussproof for producing proof trees above, but I got quite different result (tree below). can someone edit the latex above??

Answer 1

\documentclass{article}
\usepackage{bussproofs}
\begin{document}
\begin{prooftree}
\AxiomC{$P$}
\AxiomC{$\neg P,Q$}
\RightLabel{\scriptsize Res}
\BinaryInfC{$Q$}
\AxiomC{$\neg Q,R$}
\RightLabel{\scriptsize Res}
\BinaryInfC{$R$}
\end{prooftree}
\end{document}