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


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


YES

Problem 1: 

(VAR u v x y z)
(RULES
f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
f(g(x),x,y) -> y
f(x,x,y) -> x
f(x,y,g(y)) -> x
f(x,y,y) -> y
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(f(x,y,z),u,f(x,y,v)) -> F(x,y,f(z,u,v))
 F(f(x,y,z),u,f(x,y,v)) -> F(z,u,v)
-> Rules:
 f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
 f(g(x),x,y) -> y
 f(x,x,y) -> x
 f(x,y,g(y)) -> x
 f(x,y,y) -> y

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.