YES

Problem 1: 

(VAR x y)
(THEORY 
(AC plus))
(RULES
double(x) -> plus(x,x)
plus(x,0) -> x
plus(x,s(y)) -> s(plus(x,y))
)

Problem 1: 

Reduction Order Processor:
-> Rules:
 double(x) -> plus(x,x)
 plus(x,0) -> x
 plus(x,s(y)) -> s(plus(x,y))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 2.X + 2
[plus](X1,X2) = X1 + X2
[0] = 0
[s](X) = X + 2

Problem 1: 

Reduction Order Processor:
-> Rules:
 plus(x,0) -> x
 plus(x,s(y)) -> s(plus(x,y))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 2.X
[plus](X1,X2) = X1 + X2 + 2
[0] = 2
[s](X) = X + 1

Problem 1: 

Dependency Pairs Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(plus(x,s(y)),x2) -> PLUS(x,y)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)

Problem 1: 

SCC Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(plus(x,s(y)),x2) -> PLUS(x,y)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(plus(x,s(y)),x2) -> PLUS(x,y)
 PLUS(x,s(y)) -> PLUS(x,y)
-> FAxioms:
 plus(plus(x2,x3),x4) -> plus(x2,plus(x3,x4))
 plus(x2,x3) -> plus(x3,x2)
 PLUS(plus(x2,x3),x4) -> PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) -> PLUS(x3,x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
->->-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)

Problem 1: 

Reduction Pairs Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(plus(x,s(y)),x2) -> PLUS(x,y)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Usable Equations:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> Usable Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 0
[plus](X1,X2) = X1 + X2 + 2
[0] = 0
[s](X) = X
[PLUS](X1,X2) = 2.X1 + 2.X2

Problem 1: 

SCC Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> FAxioms:
 plus(plus(x2,x3),x4) -> plus(x2,plus(x3,x4))
 plus(x2,x3) -> plus(x3,x2)
 PLUS(plus(x2,x3),x4) -> PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) -> PLUS(x3,x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
->->-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)

Problem 1: 

Reduction Pairs Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Usable Equations:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> Usable Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(plus(x2,x3),x4) -> PLUS(x2,x3)
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 0
[plus](X1,X2) = X1 + X2 + 2
[0] = 0
[s](X) = X + 1
[PLUS](X1,X2) = 2.X1 + 2.X2

Problem 1: 

SCC Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> FAxioms:
 plus(plus(x2,x3),x4) -> plus(x2,plus(x3,x4))
 plus(x2,x3) -> plus(x3,x2)
 PLUS(plus(x2,x3),x4) -> PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) -> PLUS(x3,x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
->->-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)

Problem 1: 

Reduction Pairs Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
 PLUS(x,s(y)) -> PLUS(x,y)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Usable Equations:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> Usable Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 0
[plus](X1,X2) = X1 + X2 + 1
[0] = 0
[s](X) = X + 2
[PLUS](X1,X2) = 2.X1 + 2.X2

Problem 1: 

SCC Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
-> FAxioms:
 plus(plus(x2,x3),x4) -> plus(x2,plus(x3,x4))
 plus(x2,x3) -> plus(x3,x2)
 PLUS(plus(x2,x3),x4) -> PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) -> PLUS(x3,x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
->->-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)

Problem 1: 

Reduction Pairs Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2)
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Usable Equations:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> Usable Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[double](X) = 0
[plus](X1,X2) = X1 + X2 + 1
[0] = 0
[s](X) = 0
[PLUS](X1,X2) = 2.X1 + 2.X2

Problem 1: 

SCC Processor:
-> FAxioms:
 PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4))
 PLUS(x2,x3) = PLUS(x3,x2)
-> Pairs:
 Empty
-> EAxioms:
 plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4))
 plus(x2,x3) = plus(x3,x2)
-> Rules:
 plus(x,s(y)) -> s(plus(x,y))
-> SRules:
 PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.