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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 B(x,b(z,y)) -> B(f(f(z)),c(x,z,y))
 B(x,b(z,y)) -> F(b(f(f(z)),c(x,z,y)))
 B(x,b(z,y)) -> F(f(z))
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)

Problem 1: 

SCC Processor:
-> Pairs:
 B(x,b(z,y)) -> B(f(f(z)),c(x,z,y))
 B(x,b(z,y)) -> F(b(f(f(z)),c(x,z,y)))
 B(x,b(z,y)) -> F(f(z))
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(x,b(z,y)) -> F(b(f(f(z)),c(x,z,y)))
 B(x,b(z,y)) -> F(f(z))
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
->->-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 B(x,b(z,y)) -> F(f(z))
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(x,b(z,y)) -> F(f(z))
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
->->-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
->->-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)

Problem 1: 

Subterm Processor:
-> Pairs:
 B(x,b(z,y)) -> F(z)
 F(c(a,z,x)) -> B(a,z)
-> Rules:
 b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
 b(y,z) -> z
 f(c(a,z,x)) -> b(a,z)
->Projection:
 pi(B) = 2
 pi(F) = 1

Problem 1: 

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

The problem is finite.