/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

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

Proof:
 String Reversal Processor:
  a(b(a(b(b(a(b(x1))))))) -> a(b(b(a(b(b(a(a(b(a(x1))))))))))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {1}
    transitions:
     a1(21) -> 22*
     a1(12) -> 13*
     a1(18) -> 19*
     a1(14) -> 15*
     a1(15) -> 16*
     b1(17) -> 18*
     b1(13) -> 14*
     b1(20) -> 21*
     b1(16) -> 17*
     b1(19) -> 20*
     f20() -> 2*
     b0(3) -> 4*
     b0(6) -> 7*
     b0(10) -> 11*
     b0(9) -> 10*
     b0(7) -> 8*
     a0(5) -> 6*
     a0(2) -> 3*
     a0(4) -> 5*
     a0(8) -> 9*
     a0(11) -> 1*
     7 -> 12*
     22 -> 5*
     1 -> 3,5
   problem:
    
   Qed