MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: active(adx(X)) -> adx(active(X)) active(adx(cons(X,L))) -> mark(incr(cons(X,adx(L)))) active(adx(nil())) -> mark(nil()) active(cons(X1,X2)) -> cons(active(X1),X2) active(head(X)) -> head(active(X)) active(head(cons(X,L))) -> mark(X) active(incr(X)) -> incr(active(X)) active(incr(cons(X,L))) -> mark(cons(s(X),incr(L))) active(incr(nil())) -> mark(nil()) active(nats()) -> mark(adx(zeros())) active(s(X)) -> s(active(X)) active(tail(X)) -> tail(active(X)) active(tail(cons(X,L))) -> mark(L) active(zeros()) -> mark(cons(0(),zeros())) adx(mark(X)) -> mark(adx(X)) adx(ok(X)) -> ok(adx(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) head(mark(X)) -> mark(head(X)) head(ok(X)) -> ok(head(X)) incr(mark(X)) -> mark(incr(X)) incr(ok(X)) -> ok(incr(X)) proper(0()) -> ok(0()) proper(adx(X)) -> adx(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(head(X)) -> head(proper(X)) proper(incr(X)) -> incr(proper(X)) proper(nats()) -> ok(nats()) proper(nil()) -> ok(nil()) proper(s(X)) -> s(proper(X)) proper(tail(X)) -> tail(proper(X)) proper(zeros()) -> ok(zeros()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) tail(mark(X)) -> mark(tail(X)) tail(ok(X)) -> ok(tail(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,adx/1,cons/2,head/1,incr/1,proper/1,s/1,tail/1,top/1} / {0/0,mark/1,nats/0,nil/0,ok/1,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {active,adx,cons,head,incr,proper,s,tail ,top} and constructors {0,mark,nats,nil,ok,zeros} + Applied Processor: MI {miKind = Automaton Nothing, miDimension = 2, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing} + Details: Incompatible MAYBE