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


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


NO

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Infinite Processor:
-> Pairs:
 F(x,y,f(z,u,v)) -> F(f(x,y,z),u,f(x,y,v))
 F(x,y,f(z,u,v)) -> F(x,y,v)
 F(x,y,f(z,u,v)) -> F(x,y,z)
-> Rules:
 f(x,y,f(z,u,v)) -> f(f(x,y,z),u,f(x,y,v))
-> Pairs in cycle:
 F(x,y,f(z,u,v)) -> F(f(x,y,z),u,f(x,y,v))

The problem is infinite.