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


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


YES

Problem 1: 

(VAR x y z)
(RULES
+(+(x,y),z) -> +(x,+(y,z))
+(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
+(f(x),f(y)) -> f(+(x,y))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(+(x,y),z) -> +#(y,z)
 +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z)
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))

Problem 1: 

SCC Processor:
-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(+(x,y),z) -> +#(y,z)
 +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z)
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(+(x,y),z) -> +#(y,z)
 +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z)
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
->->-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z)
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z)
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
->->-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
->->-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))

Problem 1: 

Subterm Processor:
-> Pairs:
 +#(+(x,y),z) -> +#(x,+(y,z))
 +#(f(x),+(f(y),z)) -> +#(x,y)
 +#(f(x),f(y)) -> +#(x,y)
-> Rules:
 +(+(x,y),z) -> +(x,+(y,z))
 +(f(x),+(f(y),z)) -> +(f(+(x,y)),z)
 +(f(x),f(y)) -> f(+(x,y))
->Projection:
 pi(+#) = 1

Problem 1: 

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

The problem is finite.