MAYBE

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

Strict Trs:
  { app(l, nil()) -> l
  , app(nil(), k) -> k
  , app(cons(x, l), k) -> cons(x, app(l, k))
  , sum(cons(x, nil())) -> cons(x, nil())
  , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l))
  , a(x, s(y), h()) -> a(x, y, s(h()))
  , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z))
  , a(h(), h(), x) -> s(x)
  , a(s(x), h(), z) -> a(x, z, z) }
Obligation:
  runtime complexity
Answer:
  MAYBE

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) '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 perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { app^#(l, nil()) -> c_1(l)
     , app^#(nil(), k) -> c_2(k)
     , app^#(cons(x, l), k) -> c_3(x, app^#(l, k))
     , sum^#(cons(x, nil())) -> c_4(x)
     , sum^#(cons(x, cons(y, l))) -> c_5(sum^#(cons(a(x, y, h()), l)))
     , a^#(x, s(y), h()) -> c_6(a^#(x, y, s(h())))
     , a^#(x, s(y), s(z)) -> c_7(a^#(x, y, a(x, s(y), z)))
     , a^#(h(), h(), x) -> c_8(x)
     , a^#(s(x), h(), z) -> c_9(a^#(x, z, z)) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { app^#(l, nil()) -> c_1(l)
     , app^#(nil(), k) -> c_2(k)
     , app^#(cons(x, l), k) -> c_3(x, app^#(l, k))
     , sum^#(cons(x, nil())) -> c_4(x)
     , sum^#(cons(x, cons(y, l))) -> c_5(sum^#(cons(a(x, y, h()), l)))
     , a^#(x, s(y), h()) -> c_6(a^#(x, y, s(h())))
     , a^#(x, s(y), s(z)) -> c_7(a^#(x, y, a(x, s(y), z)))
     , a^#(h(), h(), x) -> c_8(x)
     , a^#(s(x), h(), z) -> c_9(a^#(x, z, z)) }
   Strict Trs:
     { app(l, nil()) -> l
     , app(nil(), k) -> k
     , app(cons(x, l), k) -> cons(x, app(l, k))
     , sum(cons(x, nil())) -> cons(x, nil())
     , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l))
     , a(x, s(y), h()) -> a(x, y, s(h()))
     , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z))
     , a(h(), h(), x) -> s(x)
     , a(s(x), h(), z) -> a(x, z, z) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..