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:

double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(s(x), y) → s(+(x, y))
double(x) → +(x, x)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Precedence:

double₁ > 0 > s₁
double₁ > +₂ > s₁

Status:

double₁: [1]
0: []
s₁: [1]
+₂: [1,2]

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(s(x), y) → s(+(x, y))
double(x) → +(x, x)

(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) TRUE