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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Subterm Processor:
-> Pairs:
 F(g(x),y) -> F(x,y)
-> Rules:
 f(g(x),y) -> f(x,y)
 f(x,x) -> a
->Projection:
 pi(F) = 1

Problem 1: 

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

The problem is finite.