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


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


NO

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
f(i(x:S)) -> a
f(h(x:S)) -> f(i(x:S))
i(x:S) -> h(x:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(h(x:S)) -> F(i(x:S))
 F(h(x:S)) -> I(x:S)
-> Rules:
 f(i(x:S)) -> a
 f(h(x:S)) -> f(i(x:S))
 i(x:S) -> h(x:S)

Problem 1: 

SCC Processor:
-> Pairs:
 F(h(x:S)) -> F(i(x:S))
 F(h(x:S)) -> I(x:S)
-> Rules:
 f(i(x:S)) -> a
 f(h(x:S)) -> f(i(x:S))
 i(x:S) -> h(x:S)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(h(x:S)) -> F(i(x:S))
->->-> Rules:
 f(i(x:S)) -> a
 f(h(x:S)) -> f(i(x:S))
 i(x:S) -> h(x:S)

Problem 1: 

Narrowing Processor:
-> Pairs:
 F(h(x:S)) -> F(i(x:S))
-> Rules:
 f(i(x:S)) -> a
 f(h(x:S)) -> f(i(x:S))
 i(x:S) -> h(x:S)
->Narrowed Pairs:
->->Original Pair:
 F(h(x:S)) -> F(i(x:S))
->-> Narrowed pairs:
 F(h(x:S)) -> F(h(x:S))

Problem 1: 

Infinite Processor:
-> Pairs:
 F(h(x:S)) -> F(h(x:S))
-> Rules:
 f(i(x:S)) -> a
 f(h(x:S)) -> f(i(x:S))
 i(x:S) -> h(x:S)
-> Pairs in cycle:
 F(h(x:S)) -> F(h(x:S))

The problem is infinite.