/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 a(a(x1)) -> c(b(x1))
 b(b(x1)) -> a(c(x1))
 c(c(x1)) -> b(a(x1))

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {6,4,1}
   transitions:
    f30() -> 2*
    c0(2) -> 5*
    c0(3) -> 1*
    b0(7) -> 6*
    b0(2) -> 3*
    a0(5) -> 4*
    a0(2) -> 7*
    1 -> 7*
    4 -> 3*
    6 -> 5*
  problem:
   
  Qed