Termination w.r.t. Q of the given QTRS could be proven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PLUS(s(X), plus(Y, Z)) → PLUS(X, plus(s(s(Y)), Z))
PLUS(s(X), plus(Y, Z)) → PLUS(s(s(Y)), Z)
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X1, plus(X3, plus(X2, X4)))
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X3, plus(X2, X4))
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X2, X4)

The TRS R consists of the following rules:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(s(X), plus(Y, Z)) → PLUS(s(s(Y)), Z)
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X3, plus(X2, X4))
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X2, X4)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2)  =  x2
s(x1)  =  s
plus(x1, x2)  =  plus(x2)

Recursive Path Order [RPO].
Precedence:

s > plus₁

The following usable rules [FROCOS05] were oriented:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PLUS(s(X), plus(Y, Z)) → PLUS(X, plus(s(s(Y)), Z))
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X1, plus(X3, plus(X2, X4)))

The TRS R consists of the following rules:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(s(X), plus(Y, Z)) → PLUS(X, plus(s(s(Y)), Z))
PLUS(s(X1), plus(X2, plus(X3, X4))) → PLUS(X1, plus(X3, plus(X2, X4)))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2)  =  x1
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x2)

Recursive Path Order [RPO].
Precedence:

plus₁ > s₁

The following usable rules [FROCOS05] were oriented:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

(6) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

plus(s(X), plus(Y, Z)) → plus(X, plus(s(s(Y)), Z))
plus(s(X1), plus(X2, plus(X3, X4))) → plus(X1, plus(X3, plus(X2, X4)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(7) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(8) TRUE