MAYBE

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

Strict Trs:
  { fact(X) -> if(zero(X), n__s(0()), n__prod(X, fact(p(X))))
  , if(true(), X, Y) -> activate(X)
  , if(false(), X, Y) -> activate(Y)
  , zero(0()) -> true()
  , zero(s(X)) -> false()
  , p(s(X)) -> X
  , add(0(), X) -> X
  , add(s(X), Y) -> s(add(X, Y))
  , s(X) -> n__s(X)
  , prod(X1, X2) -> n__prod(X1, X2)
  , prod(0(), X) -> 0()
  , prod(s(X), Y) -> add(Y, prod(X, Y))
  , activate(X) -> X
  , activate(n__s(X)) -> s(X)
  , activate(n__prod(X1, X2)) -> prod(X1, X2) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

Arguments of following rules are not normal-forms:

{ zero(s(X)) -> false()
, p(s(X)) -> X
, add(s(X), Y) -> s(add(X, Y))
, prod(s(X), Y) -> add(Y, prod(X, Y)) }

All above mentioned rules can be savely removed.

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

Strict Trs:
  { fact(X) -> if(zero(X), n__s(0()), n__prod(X, fact(p(X))))
  , if(true(), X, Y) -> activate(X)
  , if(false(), X, Y) -> activate(Y)
  , zero(0()) -> true()
  , add(0(), X) -> X
  , s(X) -> n__s(X)
  , prod(X1, X2) -> n__prod(X1, X2)
  , prod(0(), X) -> 0()
  , activate(X) -> X
  , activate(n__s(X)) -> s(X)
  , activate(n__prod(X1, X2)) -> prod(X1, X2) }
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..