MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          add(0(),X) -> X
          add(s(X),Y) -> s(add(X,Y))
          fact(X) -> if(zero(X),s(0()),prod(X,fact(p(X))))
          if(false(),X,Y) -> Y
          if(true(),X,Y) -> X
          p(s(X)) -> X
          prod(0(),X) -> 0()
          prod(s(X),Y) -> add(Y,prod(X,Y))
          zero(0()) -> true()
          zero(s(X)) -> false()
      - Signature:
          {add/2,fact/1,if/3,p/1,prod/2,zero/1} / {0/0,false/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {add,fact,if,p,prod,zero} and constructors {0,false,s
          ,true}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE