/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:
 f(f(X)) -> f(g(f(g(f(X)))))
 f(g(f(X))) -> f(g(X))

Proof:
 String Reversal Processor:
  f(f(X)) -> f(g(f(g(f(X)))))
  f(g(f(X))) -> g(f(X))
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {4,1}
    transitions:
     f20() -> 2*
     f0(2) -> 3*
     f0(4) -> 5*
     f0(6) -> 1*
     g0(5) -> 6*
     g0(3) -> 4*
     g1(14) -> 15*
     g1(11) -> 12*
     f1(10) -> 11*
     f1(21) -> 22*
     f1(13) -> 14*
     1 -> 3*
     2 -> 13*
     4 -> 14,3,10
     6 -> 21*
     12 -> 22,1
     15 -> 11,5
     22 -> 14*
   problem:
    
   Qed