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


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


YES

Problem:
 active(f(X)) -> mark(g(h(f(X))))
 active(f(X)) -> f(active(X))
 active(h(X)) -> h(active(X))
 f(mark(X)) -> mark(f(X))
 h(mark(X)) -> mark(h(X))
 proper(f(X)) -> f(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(h(X)) -> h(proper(X))
 f(ok(X)) -> ok(f(X))
 g(ok(X)) -> ok(g(X))
 h(ok(X)) -> ok(h(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 String Reversal Processor:
  f(active(X)) -> f(h(g(mark(X))))
  f(active(X)) -> active(f(X))
  h(active(X)) -> active(h(X))
  mark(f(X)) -> f(mark(X))
  mark(h(X)) -> h(mark(X))
  f(proper(X)) -> proper(f(X))
  g(proper(X)) -> proper(g(X))
  h(proper(X)) -> proper(h(X))
  ok(f(X)) -> f(ok(X))
  ok(g(X)) -> g(ok(X))
  ok(h(X)) -> h(ok(X))
  mark(top(X)) -> proper(top(X))
  ok(top(X)) -> active(top(X))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [top](x0) = x0 + 1,
    
    [ok](x0) = 8x0 + 14,
    
    [proper](x0) = 2x0 + 8,
    
    [mark](x0) = 4x0 + 6,
    
    [g](x0) = x0,
    
    [h](x0) = x0,
    
    [active](x0) = 8x0 + 14,
    
    [f](x0) = 2x0 + 2
   orientation:
    f(active(X)) = 16X + 30 >= 8X + 14 = f(h(g(mark(X))))
    
    f(active(X)) = 16X + 30 >= 16X + 30 = active(f(X))
    
    h(active(X)) = 8X + 14 >= 8X + 14 = active(h(X))
    
    mark(f(X)) = 8X + 14 >= 8X + 14 = f(mark(X))
    
    mark(h(X)) = 4X + 6 >= 4X + 6 = h(mark(X))
    
    f(proper(X)) = 4X + 18 >= 4X + 12 = proper(f(X))
    
    g(proper(X)) = 2X + 8 >= 2X + 8 = proper(g(X))
    
    h(proper(X)) = 2X + 8 >= 2X + 8 = proper(h(X))
    
    ok(f(X)) = 16X + 30 >= 16X + 30 = f(ok(X))
    
    ok(g(X)) = 8X + 14 >= 8X + 14 = g(ok(X))
    
    ok(h(X)) = 8X + 14 >= 8X + 14 = h(ok(X))
    
    mark(top(X)) = 4X + 10 >= 2X + 10 = proper(top(X))
    
    ok(top(X)) = 8X + 22 >= 8X + 22 = active(top(X))
   problem:
    f(active(X)) -> active(f(X))
    h(active(X)) -> active(h(X))
    mark(f(X)) -> f(mark(X))
    mark(h(X)) -> h(mark(X))
    g(proper(X)) -> proper(g(X))
    h(proper(X)) -> proper(h(X))
    ok(f(X)) -> f(ok(X))
    ok(g(X)) -> g(ok(X))
    ok(h(X)) -> h(ok(X))
    mark(top(X)) -> proper(top(X))
    ok(top(X)) -> active(top(X))
   KBO Processor:
    weight function:
     w0 = 1
     w(top) = w(ok) = w(proper) = w(mark) = w(g) = w(h) = w(active) = w(f) = 1
    precedence:
     mark > ok > g ~ h ~ f > top ~ proper ~ active
    problem:
     
    Qed