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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(X,X) -> A
 F(X,X) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding Rules:
 Empty

Problem 1: 

SCC Processor:
-> Pairs:
 F(X,X) -> A
 F(X,X) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding rules:
 Empty
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(X,X) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
->->-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
->->-> Unhiding rules:
 Empty

Problem 1: 

Instantiation Processor:
-> Pairs:
 F(X,X) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding rules:
 Empty
->Instantiated Pairs:
->->Original Pair:
 F(X,X) -> H(a)
->-> Instantiated pairs:
 F(b,b) -> H(a)

Problem 1: 

SCC Processor:
-> Pairs:
 F(b,b) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding rules:
 Empty
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(b,b) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
->->-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
->->-> Unhiding rules:
 Empty

Problem 1: 

Forward Instantiation Processor:
-> Pairs:
 F(b,b) -> H(a)
 G(a,X) -> F(b,X)
 H(X) -> G(X,X)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding rules:
 Empty
->Instantiated Pairs:
->->Original Pair:
 G(a,X) -> F(b,X)
->-> Instantiated pairs:
 G(a,b) -> F(b,b)
->->Original Pair:
 H(X) -> G(X,X)
->-> Instantiated pairs:
 H(a) -> G(a,a)

Problem 1: 

SCC Processor:
-> Pairs:
 F(b,b) -> H(a)
 G(a,b) -> F(b,b)
 H(a) -> G(a,a)
-> Rules:
 a -> b
 f(X,X) -> h(a)
 g(a,X) -> f(b,X)
 h(X) -> g(X,X)
-> Unhiding rules:
 Empty
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.