NO

Problem 1:

(VAR vu95NonEmpty x y)
(RULES
b -> b
f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
g(s(x)) -> x
h(s(x)) -> x
)

Problem 1:
Valid CTRS Processor:
-> Rules:
 b -> b
 f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
 f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
 g(s(x)) -> x
 h(s(x)) -> x
-> The system is a 2-CTRS.

Problem 1:
-> Pairs:
 B -> B
 F(x,y) -> G(s(x)) | c(g(x)) ->* c(a)
 F(x,y) -> H(s(x)) | c(h(x)) ->* c(a)
-> QPairs:
 Empty
-> Rules:
 b -> b
 f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
 f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
 g(s(x)) -> x
 h(s(x)) -> x

Problem 1:

SCC Processor:
-> Pairs:
 B -> B
 F(x,y) -> G(s(x)) | c(g(x)) ->* c(a)
 F(x,y) -> H(s(x)) | c(h(x)) ->* c(a)
-> QPairs:
 Empty
-> Rules:
 b -> b
 f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
 f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
 g(s(x)) -> x
 h(s(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B -> B
-> QPairs:
 Empty
->->-> Rules:
 b -> b
 f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
 f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
 g(s(x)) -> x
 h(s(x)) -> x

Problem 1:

Infiniteness Processor:
-> Pairs:
 B -> B
-> QPairs:
 Empty
-> Rules:
 b -> b
 f(x,y) -> g(s(x)) | c(g(x)) ->* c(a)
 f(x,y) -> h(s(x)) | c(h(x)) ->* c(a)
 g(s(x)) -> x
 h(s(x)) -> x
-> Pairs in cycle:
 B -> B

The problem is infinite.
29.89user 0.25system 0:30.43elapsed 99%CPU (0avgtext+0avgdata 86636maxresident)k
26320inputs+120outputs (117major+23017minor)pagefaults 0swaps