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


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


YES

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

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