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


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


YES

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.