/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)
(RULES
f(i(x)) -> a
f(h(x)) -> f(i(x))
i(x) -> h(x)
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is infinite.