/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
a(b) -> c
f(a(x),y) -> g(x,y)
g(b,y) -> f(y,y)
) 
(STRATEGY INNERMOST)

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 F(a(x),y) -> G(x,y)
 G(b,y) -> F(y,y)
-> Rules:
 a(b) -> c
 f(a(x),y) -> g(x,y)
 g(b,y) -> f(y,y)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.