/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)
(RULES
f(a,x) -> f(g(x),x)
g(h(x)) -> g(x)
h(g(x)) -> h(a)
h(h(x)) -> x
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(a,x) -> F(g(x),x)
 F(a,x) -> G(x)
 G(h(x)) -> G(x)
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 F(a,x) -> F(g(x),x)
 F(a,x) -> G(x)
 G(h(x)) -> G(x)
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(h(x)) -> G(x)
->->-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
->->Cycle:
->->-> Pairs:
 F(a,x) -> F(g(x),x)
->->-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Subterm Processor:
-> Pairs:
 G(h(x)) -> G(x)
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
->Projection:
 pi(G) = 1

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Reduction Pair Processor:
-> Pairs:
 F(a,x) -> F(g(x),x)
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
-> Usable rules:
 g(h(x)) -> g(x)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[g](X) = 1
[h](X) = 0
[a] = 2
[F](X1,X2) = 2.X1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(a,x) -> f(g(x),x)
 g(h(x)) -> g(x)
 h(g(x)) -> h(a)
 h(h(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.