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


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


YES

Problem 1: 

(STRATEGY CONTEXTSENSITIVE
(f 1)
(a)
(g)
)
(RULES
f(f(a)) -> f(g(f(a)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(f(a)) -> f(g(f(a)))
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 f(f(a)) -> f(g(f(a)))
-> Unhiding Rules:
 Empty

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 f(f(a)) -> f(g(f(a)))
-> Unhiding rules:
 Empty
-> Result:
 Set P is empty

The problem is finite.