Problem Secret 05 SRS torpa4

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Secret 05 SRS torpa4

stdout:

MAYBE

Problem:
a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
a(d(x1)) -> c(x1)
a(f(f(x1))) -> g(x1)
b(g(x1)) -> g(b(x1))
c(x1) -> f(f(x1))
c(a(c(x1))) -> b(c(a(b(c(x1)))))
c(d(x1)) -> a(a(x1))
g(x1) -> c(a(x1))
g(x1) -> d(d(d(d(x1))))

Proof:
Complexity Transformation Processor:
  strict:
   a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
   a(d(x1)) -> c(x1)
   a(f(f(x1))) -> g(x1)
   b(g(x1)) -> g(b(x1))
   c(x1) -> f(f(x1))
   c(a(c(x1))) -> b(c(a(b(c(x1)))))
   c(d(x1)) -> a(a(x1))
   g(x1) -> c(a(x1))
   g(x1) -> d(d(d(d(x1))))
  weak:

  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [g](x0) = 10x0,

    [f](x0) = 3x0,

    [d](x0) = 2x0,

    [b](x0) = x0,

    [c](x0) = 6x0,

    [a](x0) = 4x0
   orientation:
    a(b(c(a(x1)))) = 14x1 >= 14x1 = b(a(c(b(a(b(x1))))))

    a(d(x1)) = 6x1 >= 6x1 = c(x1)

    a(f(f(x1))) = 10x1 >= 10x1 = g(x1)

    b(g(x1)) = 10x1 >= 10x1 = g(b(x1))

    c(x1) = 6x1 >= 6x1 = f(f(x1))

    c(a(c(x1))) = 16x1 >= 16x1 = b(c(a(b(c(x1)))))

    c(d(x1)) = 8x1 >= 8x1 = a(a(x1))

    g(x1) = 10x1 >= 10x1 = c(a(x1))

    g(x1) = 10x1 >= 8x1 = d(d(d(d(x1))))
   problem:
    strict:
     a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
     a(d(x1)) -> c(x1)
     a(f(f(x1))) -> g(x1)
     b(g(x1)) -> g(b(x1))
     c(x1) -> f(f(x1))
     c(a(c(x1))) -> b(c(a(b(c(x1)))))
     c(d(x1)) -> a(a(x1))
     g(x1) -> c(a(x1))
    weak:
     g(x1) -> d(d(d(d(x1))))
   Arctic Interpretation Processor:
    dimension: 1
    interpretation:
     [g](x0) = 13x0,

     [f](x0) = 4x0,

     [d](x0) = 3x0,

     [b](x0) = x0,

     [c](x0) = 8x0,

     [a](x0) = 5x0
    orientation:
     a(b(c(a(x1)))) = 18x1 >= 18x1 = b(a(c(b(a(b(x1))))))

     a(d(x1)) = 8x1 >= 8x1 = c(x1)

     a(f(f(x1))) = 13x1 >= 13x1 = g(x1)

     b(g(x1)) = 13x1 >= 13x1 = g(b(x1))

     c(x1) = 8x1 >= 8x1 = f(f(x1))

     c(a(c(x1))) = 21x1 >= 21x1 = b(c(a(b(c(x1)))))

     c(d(x1)) = 11x1 >= 10x1 = a(a(x1))

     g(x1) = 13x1 >= 13x1 = c(a(x1))

     g(x1) = 13x1 >= 12x1 = d(d(d(d(x1))))
    problem:
     strict:
      a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
      a(d(x1)) -> c(x1)
      a(f(f(x1))) -> g(x1)
      b(g(x1)) -> g(b(x1))
      c(x1) -> f(f(x1))
      c(a(c(x1))) -> b(c(a(b(c(x1)))))
      g(x1) -> c(a(x1))
     weak:
      c(d(x1)) -> a(a(x1))
      g(x1) -> d(d(d(d(x1))))
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [g](x0) = x0 + 49,

       [f](x0) = x0 + 8,

       [d](x0) = x0,

       [b](x0) = x0 + 3,

       [c](x0) = x0,

       [a](x0) = x0
      orientation:
       a(b(c(a(x1)))) = x1 + 3 >= x1 + 9 = b(a(c(b(a(b(x1))))))

       a(d(x1)) = x1 >= x1 = c(x1)

       a(f(f(x1))) = x1 + 16 >= x1 + 49 = g(x1)

       b(g(x1)) = x1 + 52 >= x1 + 52 = g(b(x1))

       c(x1) = x1 >= x1 + 16 = f(f(x1))

       c(a(c(x1))) = x1 >= x1 + 6 = b(c(a(b(c(x1)))))

       g(x1) = x1 + 49 >= x1 = c(a(x1))

       c(d(x1)) = x1 >= x1 = a(a(x1))

       g(x1) = x1 + 49 >= x1 = d(d(d(d(x1))))
      problem:
       strict:
        a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
        a(d(x1)) -> c(x1)
        a(f(f(x1))) -> g(x1)
        b(g(x1)) -> g(b(x1))
        c(x1) -> f(f(x1))
        c(a(c(x1))) -> b(c(a(b(c(x1)))))
       weak:
        g(x1) -> c(a(x1))
        c(d(x1)) -> a(a(x1))
        g(x1) -> d(d(d(d(x1))))
      Matrix Interpretation Processor:
       dimension: 1
       max_matrix:
        1
        interpretation:
         [g](x0) = x0 + 161,

         [f](x0) = x0 + 2,

         [d](x0) = x0 + 8,

         [b](x0) = x0 + 27,

         [c](x0) = x0 + 16,

         [a](x0) = x0 + 9
        orientation:
         a(b(c(a(x1)))) = x1 + 61 >= x1 + 115 = b(a(c(b(a(b(x1))))))

         a(d(x1)) = x1 + 17 >= x1 + 16 = c(x1)

         a(f(f(x1))) = x1 + 13 >= x1 + 161 = g(x1)

         b(g(x1)) = x1 + 188 >= x1 + 188 = g(b(x1))

         c(x1) = x1 + 16 >= x1 + 4 = f(f(x1))

         c(a(c(x1))) = x1 + 41 >= x1 + 95 = b(c(a(b(c(x1)))))

         g(x1) = x1 + 161 >= x1 + 25 = c(a(x1))

         c(d(x1)) = x1 + 24 >= x1 + 18 = a(a(x1))

         g(x1) = x1 + 161 >= x1 + 32 = d(d(d(d(x1))))
        problem:
         strict:
          a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
          a(f(f(x1))) -> g(x1)
          b(g(x1)) -> g(b(x1))
          c(a(c(x1))) -> b(c(a(b(c(x1)))))
         weak:
          a(d(x1)) -> c(x1)
          c(x1) -> f(f(x1))
          g(x1) -> c(a(x1))
          c(d(x1)) -> a(a(x1))
          g(x1) -> d(d(d(d(x1))))
        Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Secret 05 SRS torpa4

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
     , a(d(x1)) -> c(x1)
     , a(f(f(x1))) -> g(x1)
     , b(g(x1)) -> g(b(x1))
     , c(x1) -> f(f(x1))
     , c(a(c(x1))) -> b(c(a(b(c(x1)))))
     , c(d(x1)) -> a(a(x1))
     , g(x1) -> c(a(x1))
     , g(x1) -> d(d(d(d(x1))))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Secret 05 SRS torpa4

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))
     , a(d(x1)) -> c(x1)
     , a(f(f(x1))) -> g(x1)
     , b(g(x1)) -> g(b(x1))
     , c(x1) -> f(f(x1))
     , c(a(c(x1))) -> b(c(a(b(c(x1)))))
     , c(d(x1)) -> a(a(x1))
     , g(x1) -> c(a(x1))
     , g(x1) -> d(d(d(d(x1))))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds