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


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


NO

Problem 1: 

(VAR x)
(RULES
f(g(f(x))) -> f(f(x))
h(f(f(x))) -> h(f(g(f(x))))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(g(f(x))) -> F(f(x))
 H(f(f(x))) -> F(g(f(x)))
 H(f(f(x))) -> H(f(g(f(x))))
-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))

Problem 1: 

SCC Processor:
-> Pairs:
 F(g(f(x))) -> F(f(x))
 H(f(f(x))) -> F(g(f(x)))
 H(f(f(x))) -> H(f(g(f(x))))
-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(g(f(x))) -> F(f(x))
->->-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))
->->Cycle:
->->-> Pairs:
 H(f(f(x))) -> H(f(g(f(x))))
->->-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))

Problem 1: 

Narrowing Processor:
-> Pairs:
 H(f(f(x))) -> H(f(g(f(x))))
-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))
->Narrowed Pairs:
->->Original Pair:
 H(f(f(x))) -> H(f(g(f(x))))
->-> Narrowed pairs:
 H(f(f(g(f(x))))) -> H(f(g(f(f(x)))))
 H(f(f(x))) -> H(f(f(x)))

Problem 1: 

Infinite Processor:
-> Pairs:
 H(f(f(g(f(x))))) -> H(f(g(f(f(x)))))
 H(f(f(x))) -> H(f(f(x)))
-> Rules:
 f(g(f(x))) -> f(f(x))
 h(f(f(x))) -> h(f(g(f(x))))
-> Pairs in cycle:
 H(f(f(x))) -> H(f(f(x)))

The problem is infinite.