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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.