/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
*(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 *#(x,*(minus(y),y)) -> *#(minus(*(y,y)),x)
 *#(x,*(minus(y),y)) -> *#(y,y)
-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)

Problem 1: 

SCC Processor:
-> Pairs:
 *#(x,*(minus(y),y)) -> *#(minus(*(y,y)),x)
 *#(x,*(minus(y),y)) -> *#(y,y)
-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 *#(x,*(minus(y),y)) -> *#(minus(*(y,y)),x)
 *#(x,*(minus(y),y)) -> *#(y,y)
->->-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 *#(x,*(minus(y),y)) -> *#(minus(*(y,y)),x)
 *#(x,*(minus(y),y)) -> *#(y,y)
-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
-> Usable rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[*](X1,X2) = 2.X1 + 2.X2 + 2
[minus](X) = 0
[*#](X1,X2) = 2.X1 + 2.X2

Problem 1: 

SCC Processor:
-> Pairs:
 *#(x,*(minus(y),y)) -> *#(y,y)
-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 *#(x,*(minus(y),y)) -> *#(y,y)
->->-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)

Problem 1: 

Subterm Processor:
-> Pairs:
 *#(x,*(minus(y),y)) -> *#(y,y)
-> Rules:
 *(x,*(minus(y),y)) -> *(minus(*(y,y)),x)
->Projection:
 pi(*#) = 2

Problem 1: 

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

The problem is finite.