MAYBE

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

Strict Trs:
  { fac(s(x)) -> *(fac(p(s(x))), s(x))
  , p(s(s(x))) -> s(p(s(x)))
  , p(s(0())) -> 0() }
Obligation:
  runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) '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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
         following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   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.
      
   

2) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { fac^#(s(x)) -> c_1(fac^#(p(s(x))), x)
     , p^#(s(s(x))) -> c_2(p^#(s(x)))
     , p^#(s(0())) -> c_3() }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { fac^#(s(x)) -> c_1(fac^#(p(s(x))), x)
     , p^#(s(s(x))) -> c_2(p^#(s(x)))
     , p^#(s(0())) -> c_3() }
   Strict Trs:
     { fac(s(x)) -> *(fac(p(s(x))), s(x))
     , p(s(s(x))) -> s(p(s(x)))
     , p(s(0())) -> 0() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {3} by applications of
   Pre({3}) = {1,2}. Here rules are labeled as follows:
   
     DPs:
       { 1: fac^#(s(x)) -> c_1(fac^#(p(s(x))), x)
       , 2: p^#(s(s(x))) -> c_2(p^#(s(x)))
       , 3: p^#(s(0())) -> c_3() }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { fac^#(s(x)) -> c_1(fac^#(p(s(x))), x)
     , p^#(s(s(x))) -> c_2(p^#(s(x))) }
   Strict Trs:
     { fac(s(x)) -> *(fac(p(s(x))), s(x))
     , p(s(s(x))) -> s(p(s(x)))
     , p(s(0())) -> 0() }
   Weak DPs: { p^#(s(0())) -> c_3() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..