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


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


NO

Problem 1: 

(VAR X Y)
(RULES
f(X) -> if(X,c,f(true))
if(false,X,Y) -> Y
if(true,X,Y) -> X
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X) -> F(true)
 F(X) -> IF(X,c,f(true))
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X

Problem 1: 

Infinite Processor:
-> Pairs:
 F(X) -> F(true)
 F(X) -> IF(X,c,f(true))
-> Rules:
 f(X) -> if(X,c,f(true))
 if(false,X,Y) -> Y
 if(true,X,Y) -> X
-> Pairs in cycle:
 F(X) -> F(true)

The problem is infinite.