MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { active(U11(X1, X2)) -> U11(active(X1), X2)
  , active(U11(tt(), N)) -> mark(N)
  , active(U21(X1, X2, X3)) -> U21(active(X1), X2, X3)
  , active(U21(tt(), M, N)) -> mark(s(plus(N, M)))
  , active(s(X)) -> s(active(X))
  , active(plus(X1, X2)) -> plus(X1, active(X2))
  , active(plus(X1, X2)) -> plus(active(X1), X2)
  , active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N))
  , active(plus(N, 0())) -> mark(U11(isNat(N), N))
  , active(and(X1, X2)) -> and(active(X1), X2)
  , active(and(tt(), X)) -> mark(X)
  , active(isNat(s(V1))) -> mark(isNat(V1))
  , active(isNat(plus(V1, V2))) -> mark(and(isNat(V1), isNat(V2)))
  , active(isNat(0())) -> mark(tt())
  , U11(mark(X1), X2) -> mark(U11(X1, X2))
  , U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
  , U21(mark(X1), X2, X3) -> mark(U21(X1, X2, X3))
  , U21(ok(X1), ok(X2), ok(X3)) -> ok(U21(X1, X2, X3))
  , s(mark(X)) -> mark(s(X))
  , s(ok(X)) -> ok(s(X))
  , plus(X1, mark(X2)) -> mark(plus(X1, X2))
  , plus(mark(X1), X2) -> mark(plus(X1, X2))
  , plus(ok(X1), ok(X2)) -> ok(plus(X1, X2))
  , and(mark(X1), X2) -> mark(and(X1, X2))
  , and(ok(X1), ok(X2)) -> ok(and(X1, X2))
  , isNat(ok(X)) -> ok(isNat(X))
  , proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
  , proper(tt()) -> ok(tt())
  , proper(U21(X1, X2, X3)) ->
    U21(proper(X1), proper(X2), proper(X3))
  , proper(s(X)) -> s(proper(X))
  , proper(plus(X1, X2)) -> plus(proper(X1), proper(X2))
  , proper(and(X1, X2)) -> and(proper(X1), proper(X2))
  , proper(isNat(X)) -> isNat(proper(X))
  , proper(0()) -> ok(0())
  , top(mark(X)) -> top(proper(X))
  , top(ok(X)) -> top(active(X)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.

2) 'Best' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'WithProblem (timeout of 60 seconds)' failed due to the
      following reason:
      
      Computation stopped due to timeout after 60.0 seconds.
   
   2) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
         failed due to the following reason:
         
         Computation stopped due to timeout after 30.0 seconds.
      
      2) 'Best' failed due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
            following reason:
            
            The input cannot be shown compatible
         
         2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
      
      3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
         due to the following reason:
         
         None of the processors succeeded.
         
         Details of failed attempt(s):
         -----------------------------
         1) 'Bounds with minimal-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
      
   


Arrrr..