/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(s(x),y,y) -> f(y,x,s(x))
g(x,y) -> x
g(x,y) -> y
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(s(x),y,y) -> F(y,x,s(x))
-> Rules:
 f(s(x),y,y) -> f(y,x,s(x))
 g(x,y) -> x
 g(x,y) -> y

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(x),y,y) -> F(y,x,s(x))
-> Rules:
 f(s(x),y,y) -> f(y,x,s(x))
 g(x,y) -> x
 g(x,y) -> y
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(x),y,y) -> F(y,x,s(x))
->->-> Rules:
 f(s(x),y,y) -> f(y,x,s(x))
 g(x,y) -> x
 g(x,y) -> y

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 F(s(x),y,y) -> F(y,x,s(x))
-> Rules:
 f(s(x),y,y) -> f(y,x,s(x))
 g(x,y) -> x
 g(x,y) -> y
-> Usable rules:
 Empty
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[s](X) = 2.X + 2
[F](X1,X2,X3) = 2.X1 + 2.X2 + X3

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(s(x),y,y) -> f(y,x,s(x))
 g(x,y) -> x
 g(x,y) -> y
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.