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


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


YES

Problem 1: 

(VAR x1)
(RULES
a(x1) -> g(d(x1))
b(b(b(x1))) -> c(d(c(x1)))
b(b(x1)) -> a(g(g(x1)))
c(d(x1)) -> g(g(x1))
g(g(g(x1))) -> b(b(x1))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 B(b(b(x1))) -> C(d(c(x1)))
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> A(g(g(x1)))
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Problem 1: 

SCC Processor:
-> Pairs:
 B(b(b(x1))) -> C(d(c(x1)))
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> A(g(g(x1)))
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(b(b(x1))) -> C(d(c(x1)))
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
->->-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 B(b(b(x1))) -> C(d(c(x1)))
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
-> Usable rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 4
->Interpretation:
 
[a](X) = X + 2
[b](X) = X + 3
[c](X) = X + 4
[g](X) = X + 2
[d](X) = X
[B](X) = 3/2.X + 3/2
[C](X) = 3/2.X + 3
[G](X) = 3/2.X

Problem 1: 

SCC Processor:
-> Pairs:
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
->->-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 B(b(b(x1))) -> C(x1)
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
-> Usable rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 4
->Interpretation:
 
[a](X) = X + 4/3
[b](X) = X + 2
[c](X) = X + 3
[g](X) = X + 4/3
[d](X) = X
[B](X) = 3.X + 1
[C](X) = 3.X + 4
[G](X) = 3.X

Problem 1: 

SCC Processor:
-> Pairs:
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 C(d(x1)) -> G(g(x1))
 C(d(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
->->-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 B(b(x1)) -> G(g(x1))
 B(b(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
-> Usable rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 4
->Interpretation:
 
[a](X) = X + 2/3
[b](X) = X + 1
[c](X) = X + 3/2
[g](X) = X + 2/3
[d](X) = X
[B](X) = 3/2.X + 3/4
[G](X) = 3/2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 B(b(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 B(b(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
->->-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 B(b(x1)) -> G(x1)
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
-> Usable rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 4
->Interpretation:
 
[a](X) = X + 2
[b](X) = X + 3
[c](X) = X + 4
[g](X) = X + 2
[d](X) = X
[B](X) = 4.X + 3/4
[G](X) = 4.X + 3

Problem 1: 

SCC Processor:
-> Pairs:
 G(g(g(x1))) -> B(b(x1))
 G(g(g(x1))) -> B(x1)
-> Rules:
 a(x1) -> g(d(x1))
 b(b(b(x1))) -> c(d(c(x1)))
 b(b(x1)) -> a(g(g(x1)))
 c(d(x1)) -> g(g(x1))
 g(g(g(x1))) -> b(b(x1))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.