/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
activate(n__c) -> c
activate(n__g(X)) -> g(X)
activate(X) -> X
c -> f(n__g(n__c))
c -> n__c
f(n__g(X)) -> g(activate(X))
g(X) -> n__g(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__c) -> C
 ACTIVATE(n__g(X)) -> G(X)
 C -> F(n__g(n__c))
 F(n__g(X)) -> ACTIVATE(X)
 F(n__g(X)) -> G(activate(X))
-> Rules:
 activate(n__c) -> c
 activate(n__g(X)) -> g(X)
 activate(X) -> X
 c -> f(n__g(n__c))
 c -> n__c
 f(n__g(X)) -> g(activate(X))
 g(X) -> n__g(X)

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__c) -> C
 ACTIVATE(n__g(X)) -> G(X)
 C -> F(n__g(n__c))
 F(n__g(X)) -> ACTIVATE(X)
 F(n__g(X)) -> G(activate(X))
-> Rules:
 activate(n__c) -> c
 activate(n__g(X)) -> g(X)
 activate(X) -> X
 c -> f(n__g(n__c))
 c -> n__c
 f(n__g(X)) -> g(activate(X))
 g(X) -> n__g(X)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__c) -> C
 C -> F(n__g(n__c))
 F(n__g(X)) -> ACTIVATE(X)
->->-> Rules:
 activate(n__c) -> c
 activate(n__g(X)) -> g(X)
 activate(X) -> X
 c -> f(n__g(n__c))
 c -> n__c
 f(n__g(X)) -> g(activate(X))
 g(X) -> n__g(X)

Problem 1: 

Infinite Processor:
-> Pairs:
 ACTIVATE(n__c) -> C
 C -> F(n__g(n__c))
 F(n__g(X)) -> ACTIVATE(X)
-> Rules:
 activate(n__c) -> c
 activate(n__g(X)) -> g(X)
 activate(X) -> X
 c -> f(n__g(n__c))
 c -> n__c
 f(n__g(X)) -> g(activate(X))
 g(X) -> n__g(X)
-> Pairs in cycle:
 ACTIVATE(n__c) -> C
 C -> F(n__g(n__c))
 F(n__g(n__c)) -> ACTIVATE(n__c)

The problem is infinite.