/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(x1) -> c(b(x1))
b(b(x1)) -> a(c(x1))
b(c(x1)) -> a(x1)
c(c(c(x1))) -> b(x1)
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Subterm Processor:
-> Pairs:
 B(b(x1)) -> C(x1)
 C(c(c(x1))) -> B(x1)
-> Rules:
 a(x1) -> c(b(x1))
 b(b(x1)) -> a(c(x1))
 b(c(x1)) -> a(x1)
 c(c(c(x1))) -> b(x1)
->Projection:
 pi(B) = 1
 pi(C) = 1

Problem 1: 

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

The problem is finite.