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


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


YES

Problem:
 A(b(x1)) -> b(a(B(A(x1))))
 B(a(x1)) -> a(b(A(B(x1))))
 A(a(x1)) -> x1
 B(b(x1)) -> x1

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