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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 H(g(x)) -> H(f(x))
-> Rules:
 f(a) -> g(h(a))
 h(g(x)) -> g(h(f(x)))
 k(f(x),y,x) -> f(x)
 k(x,h(x),a) -> h(x)
-> Usable rules:
 f(a) -> g(h(a))
 h(g(x)) -> g(h(f(x)))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X) = 1/2.X
[h](X) = 1
[a] = 2
[g](X) = 1/2.X + 1/2
[H](X) = X

Problem 1: 

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

The problem is finite.