MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: 0'() -> c11() ACTIVATE(z0) -> c18() ACTIVATE(n__0()) -> c13(0'()) ACTIVATE(n__adx(z0)) -> c17(ADX(z0)) ACTIVATE(n__incr(z0)) -> c16(INCR(z0)) ACTIVATE(n__s(z0)) -> c15(S(z0)) ACTIVATE(n__zeros()) -> c14(ZEROS()) ADX(z0) -> c8() ADX(cons(z0,z1)) -> c6(INCR(cons(activate(z0),n__adx(activate(z1)))),ACTIVATE(z0)) ADX(cons(z0,z1)) -> c7(INCR(cons(activate(z0),n__adx(activate(z1)))),ACTIVATE(z1)) HD(cons(z0,z1)) -> c9(ACTIVATE(z0)) INCR(z0) -> c5() INCR(cons(z0,z1)) -> c3(ACTIVATE(z0)) INCR(cons(z0,z1)) -> c4(ACTIVATE(z1)) NATS() -> c(ADX(zeros()),ZEROS()) S(z0) -> c12() TL(cons(z0,z1)) -> c10(ACTIVATE(z1)) ZEROS() -> c1() ZEROS() -> c2() - Weak TRS: 0() -> n__0() activate(z0) -> z0 activate(n__0()) -> 0() activate(n__adx(z0)) -> adx(z0) activate(n__incr(z0)) -> incr(z0) activate(n__s(z0)) -> s(z0) activate(n__zeros()) -> zeros() adx(z0) -> n__adx(z0) adx(cons(z0,z1)) -> incr(cons(activate(z0),n__adx(activate(z1)))) hd(cons(z0,z1)) -> activate(z0) incr(z0) -> n__incr(z0) incr(cons(z0,z1)) -> cons(n__s(activate(z0)),n__incr(activate(z1))) nats() -> adx(zeros()) s(z0) -> n__s(z0) tl(cons(z0,z1)) -> activate(z1) zeros() -> cons(n__0(),n__zeros()) zeros() -> n__zeros() - Signature: {0/0,0'/0,ACTIVATE/1,ADX/1,HD/1,INCR/1,NATS/0,S/1,TL/1,ZEROS/0,activate/1,adx/1,hd/1,incr/1,nats/0,s/1,tl/1 ,zeros/0} / {c/2,c1/0,c10/1,c11/0,c12/0,c13/1,c14/1,c15/1,c16/1,c17/1,c18/0,c2/0,c3/1,c4/1,c5/0,c6/2,c7/2 ,c8/0,c9/1,cons/2,n__0/0,n__adx/1,n__incr/1,n__s/1,n__zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {0,0',ACTIVATE,ADX,HD,INCR,NATS,S,TL,ZEROS,activate,adx,hd ,incr,nats,s,tl,zeros} and constructors {c,c1,c10,c11,c12,c13,c14,c15,c16,c17,c18,c2,c3,c4,c5,c6,c7,c8,c9 ,cons,n__0,n__adx,n__incr,n__s,n__zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: None MAYBE