/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)
(RULES
f(s(0),g(x)) -> f(x,g(x))
g(s(x)) -> g(x)
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(s(0),g(x)) -> F(x,g(x))
 G(s(x)) -> G(x)
-> Rules:
 f(s(0),g(x)) -> f(x,g(x))
 g(s(x)) -> g(x)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.