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


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


YES

Problem 1: 

(VAR x)
(RULES
b(u(x)) -> a(e(x))
c(u(x)) -> b(x)
d(u(x)) -> c(x)
d(x) -> e(u(x))
v(e(x)) -> x
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 C(u(x)) -> B(x)
 D(u(x)) -> C(x)
-> Rules:
 b(u(x)) -> a(e(x))
 c(u(x)) -> b(x)
 d(u(x)) -> c(x)
 d(x) -> e(u(x))
 v(e(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 C(u(x)) -> B(x)
 D(u(x)) -> C(x)
-> Rules:
 b(u(x)) -> a(e(x))
 c(u(x)) -> b(x)
 d(u(x)) -> c(x)
 d(x) -> e(u(x))
 v(e(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.