/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
a__c -> a__f(g(c))
a__c -> c
a__f(g(X)) -> g(X)
a__f(X) -> f(X)
mark(c) -> a__c
mark(f(X)) -> a__f(X)
mark(g(X)) -> g(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A__C -> A__F(g(c))
 MARK(c) -> A__C
 MARK(f(X)) -> A__F(X)
-> Rules:
 a__c -> a__f(g(c))
 a__c -> c
 a__f(g(X)) -> g(X)
 a__f(X) -> f(X)
 mark(c) -> a__c
 mark(f(X)) -> a__f(X)
 mark(g(X)) -> g(X)

Problem 1: 

SCC Processor:
-> Pairs:
 A__C -> A__F(g(c))
 MARK(c) -> A__C
 MARK(f(X)) -> A__F(X)
-> Rules:
 a__c -> a__f(g(c))
 a__c -> c
 a__f(g(X)) -> g(X)
 a__f(X) -> f(X)
 mark(c) -> a__c
 mark(f(X)) -> a__f(X)
 mark(g(X)) -> g(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.