/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)
(RULES
a(y,0) -> b(y,0)
b(b(0,y),x) -> y
c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A(y,0) -> B(y,0)
 C(c(c(y))) -> A(a(c(b(0,y)),0),0)
 C(c(c(y))) -> A(c(b(0,y)),0)
 C(c(c(y))) -> C(a(a(c(b(0,y)),0),0))
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))

Problem 1: 

SCC Processor:
-> Pairs:
 A(y,0) -> B(y,0)
 C(c(c(y))) -> A(a(c(b(0,y)),0),0)
 C(c(c(y))) -> A(c(b(0,y)),0)
 C(c(c(y))) -> C(a(a(c(b(0,y)),0),0))
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 C(c(c(y))) -> C(a(a(c(b(0,y)),0),0))
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
->->-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
->->-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 C(c(c(y))) -> C(c(a(a(c(b(0,y)),0),0)))
-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
-> Usable rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a](X1,X2) = 1/2.X1 + X2
[b](X1,X2) = 1/2.X1 + 2.X2
[c](X) = 2.X + 1/2
[0] = 0
[C](X) = X

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a(y,0) -> b(y,0)
 b(b(0,y),x) -> y
 c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.