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


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


YES

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

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