/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 Y)
(STRATEGY CONTEXTSENSITIVE
(f 1)
(g 1)
)
(RULES
f(g(X),Y) -> f(X,f(g(X),Y))
)

Problem 1: 

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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(g(X),Y) -> F(X,f(g(X),Y))
-> Rules:
 f(g(X),Y) -> f(X,f(g(X),Y))
-> Unhiding Rules:
 Empty

Problem 1: 

SCC Processor:
-> Pairs:
 F(g(X),Y) -> F(X,f(g(X),Y))
-> Rules:
 f(g(X),Y) -> f(X,f(g(X),Y))
-> Unhiding rules:
 Empty
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(g(X),Y) -> F(X,f(g(X),Y))
->->-> Rules:
 f(g(X),Y) -> f(X,f(g(X),Y))
->->-> Unhiding rules:
 Empty

Problem 1: 

SubNColl Processor:
-> Pairs:
 F(g(X),Y) -> F(X,f(g(X),Y))
-> Rules:
 f(g(X),Y) -> f(X,f(g(X),Y))
-> Unhiding rules:
 Empty
->Projection:
 pi(F) = 1

Problem 1: 

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

The problem is finite.