/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 strict:
  a(c(b(x1))) -> c(c(c(x1)))
  b(c(c(x1))) -> a(a(b(x1)))
 weak:
  c(a(c(x1))) -> b(a(b(x1)))
  b(c(a(x1))) -> a(b(c(x1)))
  c(c(c(x1))) -> c(c(b(x1)))

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match-rt
  automaton:
   final states: {4}
   transitions:
    c1(35) -> 36*
    c1(56) -> 57*
    c1(54) -> 55*
    c1(38) -> 39*
    b1(17) -> 18*
    b1(36) -> 37*
    b1(48) -> 49*
    a1(18) -> 19*
    a1(19) -> 20*
    a0(4) -> 4*
    b0(4) -> 4*
    c0(4) -> 4*
    a2(66) -> 67*
    a2(84) -> 85*
    a2(65) -> 66*
    c2(86) -> 87*
    c2(68) -> 69*
    c2(82) -> 83*
    b2(69) -> 70*
    b2(83) -> 84*
    b2(64) -> 65*
    70 -> 66*
    19 -> 48,35
    85 -> 70*
    66 -> 68*
    4 -> 38,17
    67 -> 37*
    54 -> 64*
    49 -> 39*
    20 -> 37,18,4
    55 -> 56,36
    65 -> 82*
    37 -> 19*
    57 -> 39*
    39 -> 36*
    18 -> 54*
    84 -> 86*
    87 -> 83*
  problem:
   strict:
    a(c(b(x1))) -> c(c(c(x1)))
   weak:
    c(a(c(x1))) -> b(a(b(x1)))
    b(c(a(x1))) -> a(b(c(x1)))
    c(c(c(x1))) -> c(c(b(x1)))
  String Reversal Processor:
   strict:
    b(c(a(x1))) -> c(c(c(x1)))
   weak:
    c(a(c(x1))) -> b(a(b(x1)))
    a(c(b(x1))) -> c(b(a(x1)))
    c(c(c(x1))) -> b(c(c(x1)))
   Arctic Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [b](x0) = x0,
     
     [a](x0) = 5x0
    orientation:
     b(c(a(x1))) = 5x1 >= x1 = c(c(c(x1)))
     
     c(a(c(x1))) = 5x1 >= 5x1 = b(a(b(x1)))
     
     a(c(b(x1))) = 5x1 >= 5x1 = c(b(a(x1)))
     
     c(c(c(x1))) = x1 >= x1 = b(c(c(x1)))
    problem:
     strict:
      
     weak:
      c(a(c(x1))) -> b(a(b(x1)))
      a(c(b(x1))) -> c(b(a(x1)))
      c(c(c(x1))) -> b(c(c(x1)))
    Qed