/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 X:S Y:S)
(RULES
f(X:S) -> if(X:S,c,f(ttrue))
if(ffalse,X:S,Y:S) -> Y:S
if(ttrue,X:S,Y:S) -> X:S
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X:S) -> F(ttrue)
 F(X:S) -> IF(X:S,c,f(ttrue))
-> Rules:
 f(X:S) -> if(X:S,c,f(ttrue))
 if(ffalse,X:S,Y:S) -> Y:S
 if(ttrue,X:S,Y:S) -> X:S

Problem 1: 

Infinite Processor:
-> Pairs:
 F(X:S) -> F(ttrue)
 F(X:S) -> IF(X:S,c,f(ttrue))
-> Rules:
 f(X:S) -> if(X:S,c,f(ttrue))
 if(ffalse,X:S,Y:S) -> Y:S
 if(ttrue,X:S,Y:S) -> X:S
-> Pairs in cycle:
 F(X:S) -> F(ttrue)

The problem is infinite.