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


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


NO

Problem 1: 

(VAR X)
(RULES
f(X,g(X)) -> f(1,g(X))
g(1) -> g(0)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X,g(X)) -> F(1,g(X))
-> Rules:
 f(X,g(X)) -> f(1,g(X))
 g(1) -> g(0)

Problem 1: 

SCC Processor:
-> Pairs:
 F(X,g(X)) -> F(1,g(X))
-> Rules:
 f(X,g(X)) -> f(1,g(X))
 g(1) -> g(0)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(X,g(X)) -> F(1,g(X))
->->-> Rules:
 f(X,g(X)) -> f(1,g(X))
 g(1) -> g(0)

Problem 1: 

Instantiation Processor:
-> Pairs:
 F(X,g(X)) -> F(1,g(X))
-> Rules:
 f(X,g(X)) -> f(1,g(X))
 g(1) -> g(0)
->Instantiated Pairs:
->->Original Pair:
 F(X,g(X)) -> F(1,g(X))
->-> Instantiated pairs:
 F(1,g(1)) -> F(1,g(1))

Problem 1: 

Infinite Processor:
-> Pairs:
 F(1,g(1)) -> F(1,g(1))
-> Rules:
 f(X,g(X)) -> f(1,g(X))
 g(1) -> g(0)
-> Pairs in cycle:
 F(1,g(1)) -> F(1,g(1))

The problem is infinite.