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


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


YES

Problem 1: 

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

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f_0(x:S) -> a
 f_1(x:S) -> g_1(x:S,x:S)
 f_2(x:S) -> g_2(x:S,x:S)
 f_3(x:S) -> g_3(x:S,x:S)
 f_4(x:S) -> g_4(x:S,x:S)
 f_5(x:S) -> g_5(x:S,x:S)
 g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S))
 g_2(s(x:S),y:S) -> b(f_1(y:S),g_2(x:S,y:S))
 g_3(s(x:S),y:S) -> b(f_2(y:S),g_3(x:S,y:S))
 g_4(s(x:S),y:S) -> b(f_3(y:S),g_4(x:S,y:S))
 g_5(s(x:S),y:S) -> b(f_4(y:S),g_5(x:S,y:S))
-> 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:S) -> G_1(x:S,x:S)
 F_2(x:S) -> G_2(x:S,x:S)
 F_3(x:S) -> G_3(x:S,x:S)
 F_4(x:S) -> G_4(x:S,x:S)
 F_5(x:S) -> G_5(x:S,x:S)
 G_1(s(x:S),y:S) -> F_0(y:S)
 G_1(s(x:S),y:S) -> G_1(x:S,y:S)
 G_2(s(x:S),y:S) -> F_1(y:S)
 G_2(s(x:S),y:S) -> G_2(x:S,y:S)
 G_3(s(x:S),y:S) -> F_2(y:S)
 G_3(s(x:S),y:S) -> G_3(x:S,y:S)
 G_4(s(x:S),y:S) -> F_3(y:S)
 G_4(s(x:S),y:S) -> G_4(x:S,y:S)
 G_5(s(x:S),y:S) -> F_4(y:S)
 G_5(s(x:S),y:S) -> G_5(x:S,y:S)
-> Rules:
 f_0(x:S) -> a
 f_1(x:S) -> g_1(x:S,x:S)
 f_2(x:S) -> g_2(x:S,x:S)
 f_3(x:S) -> g_3(x:S,x:S)
 f_4(x:S) -> g_4(x:S,x:S)
 f_5(x:S) -> g_5(x:S,x:S)
 g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S))
 g_2(s(x:S),y:S) -> b(f_1(y:S),g_2(x:S,y:S))
 g_3(s(x:S),y:S) -> b(f_2(y:S),g_3(x:S,y:S))
 g_4(s(x:S),y:S) -> b(f_3(y:S),g_4(x:S,y:S))
 g_5(s(x:S),y:S) -> b(f_4(y:S),g_5(x:S,y:S))

Problem 1: 

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


The problem is decomposed in 5 subproblems.

Problem 1.1: 

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

Problem 1.1: 

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

The problem is finite.

Problem 1.2: 

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

Problem 1.2: 

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

The problem is finite.

Problem 1.3: 

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

Problem 1.3: 

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

The problem is finite.

Problem 1.4: 

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

Problem 1.4: 

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

The problem is finite.

Problem 1.5: 

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

Problem 1.5: 

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

The problem is finite.