/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /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)
  WPO Processor:
   algebra: Sum
   weight function:
    w0 = 0
    w(mark) = 4
    w(g) = w(h) = w(f) = w(a__f) = 0
   status function:
    st(mark) = st(g) = st(h) = st(f) = st(a__f) = [0]
   precedence:
    a__f > f > h > mark ~ g
   problem:
    
   Qed