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


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


YES

Problem 1: 

(VAR x y z)
(RULES
f(0,1,g(x,y),z) -> f(g(x,y),g(x,y),g(x,y),h(x))
g(0,1) -> 0
g(0,1) -> 1
h(g(x,y)) -> h(x)
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(0,1,g(x,y),z) -> F(g(x,y),g(x,y),g(x,y),h(x))
 F(0,1,g(x,y),z) -> H(x)
 H(g(x,y)) -> H(x)
-> Rules:
 f(0,1,g(x,y),z) -> f(g(x,y),g(x,y),g(x,y),h(x))
 g(0,1) -> 0
 g(0,1) -> 1
 h(g(x,y)) -> h(x)

Problem 1: 

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

Problem 1: 

Subterm Processor:
-> Pairs:
 H(g(x,y)) -> H(x)
-> Rules:
 f(0,1,g(x,y),z) -> f(g(x,y),g(x,y),g(x,y),h(x))
 g(0,1) -> 0
 g(0,1) -> 1
 h(g(x,y)) -> h(x)
->Projection:
 pi(H) = 1

Problem 1: 

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

The problem is finite.