/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR x y)
(RULES
f_0(x) -> a
f_1(x) -> g_1(x,x)
f_2(x) -> g_2(x,x)
f_3(x) -> g_3(x,x)
f_4(x) -> g_4(x,x)
f_5(x) -> g_5(x,x)
g_1(s(x),y) -> b(f_0(y),g_1(x,y))
g_2(s(x),y) -> b(f_1(y),g_2(x,y))
g_3(s(x),y) -> b(f_2(y),g_3(x,y))
g_4(s(x),y) -> b(f_3(y),g_4(x,y))
g_5(s(x),y) -> b(f_4(y),g_5(x,y))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F_1(x) -> G_1(x,x)
 F_2(x) -> G_2(x,x)
 F_3(x) -> G_3(x,x)
 F_4(x) -> G_4(x,x)
 F_5(x) -> G_5(x,x)
 G_1(s(x),y) -> F_0(y)
 G_1(s(x),y) -> G_1(x,y)
 G_2(s(x),y) -> F_1(y)
 G_2(s(x),y) -> G_2(x,y)
 G_3(s(x),y) -> F_2(y)
 G_3(s(x),y) -> G_3(x,y)
 G_4(s(x),y) -> F_3(y)
 G_4(s(x),y) -> G_4(x,y)
 G_5(s(x),y) -> F_4(y)
 G_5(s(x),y) -> G_5(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))

Problem 1: 

SCC Processor:
-> Pairs:
 F_1(x) -> G_1(x,x)
 F_2(x) -> G_2(x,x)
 F_3(x) -> G_3(x,x)
 F_4(x) -> G_4(x,x)
 F_5(x) -> G_5(x,x)
 G_1(s(x),y) -> F_0(y)
 G_1(s(x),y) -> G_1(x,y)
 G_2(s(x),y) -> F_1(y)
 G_2(s(x),y) -> G_2(x,y)
 G_3(s(x),y) -> F_2(y)
 G_3(s(x),y) -> G_3(x,y)
 G_4(s(x),y) -> F_3(y)
 G_4(s(x),y) -> G_4(x,y)
 G_5(s(x),y) -> F_4(y)
 G_5(s(x),y) -> G_5(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G_1(s(x),y) -> G_1(x,y)
->->-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->->Cycle:
->->-> Pairs:
 G_2(s(x),y) -> G_2(x,y)
->->-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->->Cycle:
->->-> Pairs:
 G_3(s(x),y) -> G_3(x,y)
->->-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->->Cycle:
->->-> Pairs:
 G_4(s(x),y) -> G_4(x,y)
->->-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->->Cycle:
->->-> Pairs:
 G_5(s(x),y) -> G_5(x,y)
->->-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))


The problem is decomposed in 5 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 G_1(s(x),y) -> G_1(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Projection:
 pi(G_1) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 G_2(s(x),y) -> G_2(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Projection:
 pi(G_2) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.3: 

Subterm Processor:
-> Pairs:
 G_3(s(x),y) -> G_3(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Projection:
 pi(G_3) = 1

Problem 1.3: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.4: 

Subterm Processor:
-> Pairs:
 G_4(s(x),y) -> G_4(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Projection:
 pi(G_4) = 1

Problem 1.4: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.5: 

Subterm Processor:
-> Pairs:
 G_5(s(x),y) -> G_5(x,y)
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Projection:
 pi(G_5) = 1

Problem 1.5: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f_0(x) -> a
 f_1(x) -> g_1(x,x)
 f_2(x) -> g_2(x,x)
 f_3(x) -> g_3(x,x)
 f_4(x) -> g_4(x,x)
 f_5(x) -> g_5(x,x)
 g_1(s(x),y) -> b(f_0(y),g_1(x,y))
 g_2(s(x),y) -> b(f_1(y),g_2(x,y))
 g_3(s(x),y) -> b(f_2(y),g_3(x,y))
 g_4(s(x),y) -> b(f_3(y),g_4(x,y))
 g_5(s(x),y) -> b(f_4(y),g_5(x,y))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.