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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.