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


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


YES

Problem 1: 

(VAR X Y)
(RULES
f(0,1,X) -> h(X,X)
g(X,Y) -> X
g(X,Y) -> Y
h(0,X) -> f(0,X,X)
) 
(STRATEGY INNERMOST)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 F(0,1,1) -> H(1,1)
 H(0,0) -> F(0,0,0)
-> Rules:
 f(0,1,X) -> h(X,X)
 g(X,Y) -> X
 g(X,Y) -> Y
 h(0,X) -> f(0,X,X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.