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


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


YES

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

Proof:
 String Reversal Processor:
  b(a(b(a(a(b(x1)))))) -> a(b(b(a(a(b(a(x1)))))))
  Bounds Processor:
   bound: 2
   enrichment: match
   automaton:
    final states: {3}
    transitions:
     a2(32) -> 33*
     a2(28) -> 29*
     a2(29) -> 30*
     a2(26) -> 27*
     b0(3) -> 3*
     b2(30) -> 31*
     b2(27) -> 28*
     b2(31) -> 32*
     a0(3) -> 3*
     b1(13) -> 14*
     b1(16) -> 17*
     b1(17) -> 18*
     a1(18) -> 19*
     a1(14) -> 15*
     a1(12) -> 13*
     a1(20) -> 21*
     a1(15) -> 16*
     19 -> 14,3
     17 -> 20*
     21 -> 13*
     13 -> 26*
     3 -> 12*
     33 -> 14*
   problem:
    
   Qed