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


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


NO

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is infinite.