/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 a__f(X) -> g(h(f(X)))
 mark(f(X)) -> a__f(mark(X))
 mark(g(X)) -> g(X)
 mark(h(X)) -> h(mark(X))
 a__f(X) -> f(X)

Proof:
 String Reversal Processor:
  a__f(X) -> f(h(g(X)))
  f(mark(X)) -> mark(a__f(X))
  g(mark(X)) -> g(X)
  h(mark(X)) -> mark(h(X))
  a__f(X) -> f(X)
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {9,7,3,5,1}
    transitions:
     f50() -> 2*
     f0(2) -> 9*
     f0(4) -> 1*
     h0(2) -> 8*
     h0(3) -> 4*
     g0(2) -> 3*
     mark0(6) -> 5*
     mark0(8) -> 7*
     a__f0(2) -> 6*
     f1(16) -> 17*
     f1(18) -> 19*
     h1(15) -> 16*
     g1(14) -> 15*
     2 -> 18,14
     5 -> 19,9,6
     7 -> 8*
     17 -> 6*
     19 -> 6*
   problem:
    
   Qed