MAYBE

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

Strict Trs:
  { circ(s, id()) -> s
  , circ(circ(s, t), u) -> circ(s, circ(t, u))
  , circ(cons(a, s), t) -> cons(msubst(a, t), circ(s, t))
  , circ(cons(lift(), s), circ(cons(lift(), t), u)) ->
    circ(cons(lift(), circ(s, t)), u)
  , circ(cons(lift(), s), cons(a, t)) -> cons(a, circ(s, t))
  , circ(cons(lift(), s), cons(lift(), t)) ->
    cons(lift(), circ(s, t))
  , circ(id(), s) -> s
  , msubst(a, id()) -> a
  , msubst(msubst(a, s), t) -> msubst(a, circ(s, t))
  , subst(a, id()) -> a }
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) '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.
      
   
   3) '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) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { circ^#(s, id()) -> c_1(s)
     , circ^#(circ(s, t), u) -> c_2(circ^#(s, circ(t, u)))
     , circ^#(cons(a, s), t) -> c_3(msubst^#(a, t), circ^#(s, t))
     , circ^#(cons(lift(), s), circ(cons(lift(), t), u)) ->
       c_4(circ^#(cons(lift(), circ(s, t)), u))
     , circ^#(cons(lift(), s), cons(a, t)) -> c_5(a, circ^#(s, t))
     , circ^#(cons(lift(), s), cons(lift(), t)) -> c_6(circ^#(s, t))
     , circ^#(id(), s) -> c_7(s)
     , msubst^#(a, id()) -> c_8(a)
     , msubst^#(msubst(a, s), t) -> c_9(msubst^#(a, circ(s, t)))
     , subst^#(a, id()) -> c_10(a) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { circ^#(s, id()) -> c_1(s)
     , circ^#(circ(s, t), u) -> c_2(circ^#(s, circ(t, u)))
     , circ^#(cons(a, s), t) -> c_3(msubst^#(a, t), circ^#(s, t))
     , circ^#(cons(lift(), s), circ(cons(lift(), t), u)) ->
       c_4(circ^#(cons(lift(), circ(s, t)), u))
     , circ^#(cons(lift(), s), cons(a, t)) -> c_5(a, circ^#(s, t))
     , circ^#(cons(lift(), s), cons(lift(), t)) -> c_6(circ^#(s, t))
     , circ^#(id(), s) -> c_7(s)
     , msubst^#(a, id()) -> c_8(a)
     , msubst^#(msubst(a, s), t) -> c_9(msubst^#(a, circ(s, t)))
     , subst^#(a, id()) -> c_10(a) }
   Strict Trs:
     { circ(s, id()) -> s
     , circ(circ(s, t), u) -> circ(s, circ(t, u))
     , circ(cons(a, s), t) -> cons(msubst(a, t), circ(s, t))
     , circ(cons(lift(), s), circ(cons(lift(), t), u)) ->
       circ(cons(lift(), circ(s, t)), u)
     , circ(cons(lift(), s), cons(a, t)) -> cons(a, circ(s, t))
     , circ(cons(lift(), s), cons(lift(), t)) ->
       cons(lift(), circ(s, t))
     , circ(id(), s) -> s
     , msubst(a, id()) -> a
     , msubst(msubst(a, s), t) -> msubst(a, circ(s, t))
     , subst(a, id()) -> a }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..