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


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


YES

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

Proof:
 String Reversal Processor:
  a(c(b(x1))) -> b(a(b(a(x1))))
  b(x1) -> c(c(x1))
  a(a(x1)) -> a(b(c(a(x1))))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {8,6,1}
    transitions:
     a0(4) -> 5*
     a0(2) -> 3*
     a0(10) -> 8*
     c1(12) -> 13*
     c1(20) -> 21*
     c1(23) -> 24*
     c1(11) -> 12*
     c1(21) -> 22*
     c1(24) -> 25*
     c0(2) -> 7*
     c0(7) -> 6*
     c0(3) -> 9*
     b0(3) -> 4*
     b0(9) -> 10*
     b0(5) -> 1*
     f30() -> 2*
     22 -> 1*
     13 -> 10*
     8 -> 3,23
     1 -> 3,23
     5 -> 20*
     9 -> 11*
     3 -> 23*
     25 -> 4*
   problem:
    
   Qed