MAYBE

'Pop* (timeout of 60.0 seconds)'
--------------------------------
Answer:           MAYBE
Input Problem:    innermost relative runtime-complexity with respect to
  Strict Rules:
    {  topB(i, N1(), y) -> topA(1(), T1(), y)
     , topA(i, x, N2()) -> topB(0(), x, T2())
     , topB(i, S1(), y) -> topA(i, N1(), y)
     , topA(i, x, S2()) -> topB(i, x, N2())
     , topA(i, N1(), T2()) -> topB(i, N1(), S2())
     , topA(1(), T1(), T2()) -> topB(1(), T1(), S2())}
  Weak Rules:
    {  topA(i, N1(), y) -> topA(1(), T1(), y)
     , topB(i, x, N2()) -> topB(0(), x, T2())
     , topA(i, S1(), y) -> topA(i, N1(), y)
     , topB(i, x, S2()) -> topB(i, x, N2())
     , topB(i, N1(), T2()) -> topB(i, N1(), S2())
     , topB(1(), T1(), T2()) -> topB(1(), T1(), S2())}

Proof Output:    
  The input cannot be shown compatible