/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(f(X))) -> mark(c(f(g(f(X)))))
 active(c(X)) -> mark(d(X))
 active(h(X)) -> mark(c(d(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(c(X)) -> c(proper(X))
 proper(g(X)) -> g(proper(X))
 proper(d(X)) -> d(proper(X))
 proper(h(X)) -> h(proper(X))
 f(ok(X)) -> ok(f(X))
 c(ok(X)) -> ok(c(X))
 g(ok(X)) -> ok(g(X))
 d(ok(X)) -> ok(d(X))
 h(ok(X)) -> ok(h(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [top](x0) = 4x0 + 7,
   
   [ok](x0) = 4x0 + 2,
   
   [proper](x0) = x0,
   
   [h](x0) = 5x0,
   
   [d](x0) = 5x0,
   
   [mark](x0) = x0,
   
   [c](x0) = 4x0,
   
   [g](x0) = x0,
   
   [active](x0) = 4x0,
   
   [f](x0) = 2x0
  orientation:
   active(f(f(X))) = 16X >= 16X = mark(c(f(g(f(X)))))
   
   active(c(X)) = 16X >= 5X = mark(d(X))
   
   active(h(X)) = 20X >= 20X = mark(c(d(X)))
   
   active(f(X)) = 8X >= 8X = f(active(X))
   
   active(h(X)) = 20X >= 20X = h(active(X))
   
   f(mark(X)) = 2X >= 2X = mark(f(X))
   
   h(mark(X)) = 5X >= 5X = mark(h(X))
   
   proper(f(X)) = 2X >= 2X = f(proper(X))
   
   proper(c(X)) = 4X >= 4X = c(proper(X))
   
   proper(g(X)) = X >= X = g(proper(X))
   
   proper(d(X)) = 5X >= 5X = d(proper(X))
   
   proper(h(X)) = 5X >= 5X = h(proper(X))
   
   f(ok(X)) = 8X + 4 >= 8X + 2 = ok(f(X))
   
   c(ok(X)) = 16X + 8 >= 16X + 2 = ok(c(X))
   
   g(ok(X)) = 4X + 2 >= 4X + 2 = ok(g(X))
   
   d(ok(X)) = 20X + 10 >= 20X + 2 = ok(d(X))
   
   h(ok(X)) = 20X + 10 >= 20X + 2 = ok(h(X))
   
   top(mark(X)) = 4X + 7 >= 4X + 7 = top(proper(X))
   
   top(ok(X)) = 16X + 15 >= 16X + 7 = top(active(X))
  problem:
   active(f(f(X))) -> mark(c(f(g(f(X)))))
   active(c(X)) -> mark(d(X))
   active(h(X)) -> mark(c(d(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(c(X)) -> c(proper(X))
   proper(g(X)) -> g(proper(X))
   proper(d(X)) -> d(proper(X))
   proper(h(X)) -> h(proper(X))
   g(ok(X)) -> ok(g(X))
   top(mark(X)) -> top(proper(X))
  String Reversal Processor:
   f(f(active(X))) -> f(g(f(c(mark(X)))))
   c(active(X)) -> d(mark(X))
   h(active(X)) -> d(c(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))
   c(proper(X)) -> proper(c(X))
   g(proper(X)) -> proper(g(X))
   d(proper(X)) -> proper(d(X))
   h(proper(X)) -> proper(h(X))
   ok(g(X)) -> g(ok(X))
   mark(top(X)) -> proper(top(X))
   Bounds Processor:
    bound: 1
    enrichment: match
    automaton:
     final states: {25,23,22,20,18,16,15,14,13,11,9,8,7,1}
     transitions:
      f100() -> 2*
      f0(2) -> 10*
      f0(4) -> 5*
      f0(6) -> 1*
      f0(3) -> 13*
      g0(5) -> 6*
      g0(2) -> 19*
      g0(24) -> 23*
      c0(2) -> 17*
      c0(3) -> 4*
      mark0(2) -> 3*
      d0(2) -> 21*
      d0(4) -> 8*
      d0(3) -> 7*
      active0(10) -> 9*
      active0(12) -> 11*
      h0(2) -> 12*
      h0(3) -> 14*
      proper0(10) -> 15*
      proper0(17) -> 16*
      proper0(12) -> 22*
      proper0(19) -> 18*
      proper0(26) -> 25*
      proper0(21) -> 20*
      ok0(2) -> 24*
      top0(2) -> 26*
      proper1(40) -> 41*
      proper1(67) -> 68*
      proper1(57) -> 58*
      proper1(37) -> 38*
      proper1(84) -> 85*
      proper1(81) -> 82*
      proper1(31) -> 32*
      h1(45) -> 46*
      h1(73) -> 74*
      d1(69) -> 70*
      d1(39) -> 40*
      d1(66) -> 67*
      c1(59) -> 60*
      c1(36) -> 37*
      f1(30) -> 31*
      f1(49) -> 50*
      f1(56) -> 57*
      f1(83) -> 84*
      g1(80) -> 81*
      1 -> 10*
      7 -> 17*
      8 -> 12*
      9 -> 10*
      11 -> 12*
      13 -> 3*
      14 -> 3*
      15 -> 10*
      16 -> 17*
      18 -> 19*
      20 -> 21*
      22 -> 12*
      23 -> 24*
      25 -> 3*
      26 -> 45,39,36,30
      31 -> 73,69,59,49
      32 -> 14,13,3
      37 -> 66,56
      38 -> 4*
      41 -> 7,17
      46 -> 31*
      50 -> 31*
      57 -> 80*
      58 -> 5*
      60 -> 37*
      68 -> 8,12
      70 -> 40*
      74 -> 31*
      81 -> 83*
      82 -> 6*
      85 -> 1*
    problem:
     
    Qed