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


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


YES

Problem 1: 

(VAR v_NonEmpty:S X:S)
(RULES
a -> n__a
activate(n__a) -> a
activate(n__f(X:S)) -> f(activate(X:S))
activate(n__g(X:S)) -> g(activate(X:S))
activate(X:S) -> X:S
f(f(a)) -> c(n__f(n__g(n__f(n__a))))
f(X:S) -> n__f(X:S)
g(X:S) -> n__g(X:S)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__a) -> A
 ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__f(X:S)) -> F(activate(X:S))
 ACTIVATE(n__g(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__g(X:S)) -> G(activate(X:S))
-> Rules:
 a -> n__a
 activate(n__a) -> a
 activate(n__f(X:S)) -> f(activate(X:S))
 activate(n__g(X:S)) -> g(activate(X:S))
 activate(X:S) -> X:S
 f(f(a)) -> c(n__f(n__g(n__f(n__a))))
 f(X:S) -> n__f(X:S)
 g(X:S) -> n__g(X:S)

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__a) -> A
 ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__f(X:S)) -> F(activate(X:S))
 ACTIVATE(n__g(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__g(X:S)) -> G(activate(X:S))
-> Rules:
 a -> n__a
 activate(n__a) -> a
 activate(n__f(X:S)) -> f(activate(X:S))
 activate(n__g(X:S)) -> g(activate(X:S))
 activate(X:S) -> X:S
 f(f(a)) -> c(n__f(n__g(n__f(n__a))))
 f(X:S) -> n__f(X:S)
 g(X:S) -> n__g(X:S)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__g(X:S)) -> ACTIVATE(X:S)
->->-> Rules:
 a -> n__a
 activate(n__a) -> a
 activate(n__f(X:S)) -> f(activate(X:S))
 activate(n__g(X:S)) -> g(activate(X:S))
 activate(X:S) -> X:S
 f(f(a)) -> c(n__f(n__g(n__f(n__a))))
 f(X:S) -> n__f(X:S)
 g(X:S) -> n__g(X:S)

Problem 1: 

Subterm Processor:
-> Pairs:
 ACTIVATE(n__f(X:S)) -> ACTIVATE(X:S)
 ACTIVATE(n__g(X:S)) -> ACTIVATE(X:S)
-> Rules:
 a -> n__a
 activate(n__a) -> a
 activate(n__f(X:S)) -> f(activate(X:S))
 activate(n__g(X:S)) -> g(activate(X:S))
 activate(X:S) -> X:S
 f(f(a)) -> c(n__f(n__g(n__f(n__a))))
 f(X:S) -> n__f(X:S)
 g(X:S) -> n__g(X:S)
->Projection:
 pi(ACTIVATE) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a -> n__a
 activate(n__a) -> a
 activate(n__f(X:S)) -> f(activate(X:S))
 activate(n__g(X:S)) -> g(activate(X:S))
 activate(X:S) -> X:S
 f(f(a)) -> c(n__f(n__g(n__f(n__a))))
 f(X:S) -> n__f(X:S)
 g(X:S) -> n__g(X:S)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.