MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: active(and(X1,X2)) -> and(active(X1),X2) active(and(tt(),X)) -> mark(X) active(cons(X1,X2)) -> cons(active(X1),X2) active(length(X)) -> length(active(X)) active(length(cons(N,L))) -> mark(s(length(L))) active(length(nil())) -> mark(0()) active(s(X)) -> s(active(X)) active(take(X1,X2)) -> take(X1,active(X2)) active(take(X1,X2)) -> take(active(X1),X2) active(take(0(),IL)) -> mark(nil()) active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) active(zeros()) -> mark(cons(0(),zeros())) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) length(mark(X)) -> mark(length(X)) length(ok(X)) -> ok(length(X)) proper(0()) -> ok(0()) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(length(X)) -> length(proper(X)) proper(nil()) -> ok(nil()) proper(s(X)) -> s(proper(X)) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) proper(tt()) -> ok(tt()) proper(zeros()) -> ok(zeros()) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) take(X1,mark(X2)) -> mark(take(X1,X2)) take(mark(X1),X2) -> mark(take(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,and/2,cons/2,length/1,proper/1,s/1,take/2,top/1} / {0/0,mark/1,nil/0,ok/1,tt/0,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {active,and,cons,length,proper,s,take ,top} and constructors {0,mark,nil,ok,tt,zeros} + Applied Processor: Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT} + Details: The input can not be schown compatible. MAYBE