MAYBE

'epo* (timeout of 60.0 seconds)'
--------------------------------
Answer:           MAYBE
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  ite(tt(), u, v) -> u
     , ite(ff(), u, v) -> v
     , find(u, v, nil()) -> ff()
     , find(u, v, cons(cons(u, v), E)) -> tt()
     , find(u, v, cons(cons(u2, v2), E)) -> find(u, v, E)
     , complete(u, nil(), E) -> tt()
     , complete(u, cons(v, S), E) ->
       ite(find(u, v, E), complete(u, S, E), ff())
     , clique(nil(), E) -> tt()
     , clique(cons(u, K), E) ->
       ite(complete(u, K, E), clique(K, E), ff())
     , choice(nil(), K, E) -> ite(clique(K, E), K, nil())
     , choice(cons(u, S), K, E) -> choice(S, cons(u, K), E)
     , choice(cons(u, S), K, E) -> choice(S, K, E)}

Proof Output:    
  The input cannot be shown compatible