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

Problem 1: 

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

Problem 1: 

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

The problem is finite.