/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Proof: DP Processor: DPs: terms#(N) -> sqr#(N) sqr#(s(X)) -> dbl#(X) sqr#(s(X)) -> sqr#(X) sqr#(s(X)) -> add#(sqr(X),dbl(X)) sqr#(s(X)) -> s#(add(sqr(X),dbl(X))) dbl#(s(X)) -> dbl#(X) dbl#(s(X)) -> s#(dbl(X)) dbl#(s(X)) -> s#(s(dbl(X))) add#(s(X),Y) -> add#(X,Y) add#(s(X),Y) -> s#(add(X,Y)) first#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__terms(X)) -> activate#(X) activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X TDG Processor: DPs: terms#(N) -> sqr#(N) sqr#(s(X)) -> dbl#(X) sqr#(s(X)) -> sqr#(X) sqr#(s(X)) -> add#(sqr(X),dbl(X)) sqr#(s(X)) -> s#(add(sqr(X),dbl(X))) dbl#(s(X)) -> dbl#(X) dbl#(s(X)) -> s#(dbl(X)) dbl#(s(X)) -> s#(s(dbl(X))) add#(s(X),Y) -> add#(X,Y) add#(s(X),Y) -> s#(add(X,Y)) first#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__terms(X)) -> activate#(X) activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> s#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X graph: activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X2) -> activate#(n__terms(X)) -> activate#(X) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__first(X1,X2)) -> activate#(X1) -> activate#(n__terms(X)) -> activate#(X) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) -> first#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__terms(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) activate#(n__terms(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__terms(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__terms(X)) -> activate#(X) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__terms(X)) -> activate#(X) -> activate#(n__s(X)) -> activate#(X) activate#(n__terms(X)) -> activate#(X) -> activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__terms(X)) -> activate#(X) -> activate#(n__terms(X)) -> activate#(X) activate#(n__terms(X)) -> terms#(activate(X)) -> terms#(N) -> sqr#(N) activate#(n__s(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) activate#(n__s(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__s(X)) -> activate#(X) -> activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__s(X)) -> activate#(X) -> activate#(n__s(X)) -> s#(activate(X)) activate#(n__s(X)) -> activate#(X) -> activate#(n__s(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) -> activate#(n__terms(X)) -> terms#(activate(X)) activate#(n__s(X)) -> activate#(X) -> activate#(n__terms(X)) -> activate#(X) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__first(X1,X2)) -> activate#(X1) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__first(X1,X2)) -> activate#(X2) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__s(X)) -> s#(activate(X)) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__s(X)) -> activate#(X) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__terms(X)) -> terms#(activate(X)) first#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__terms(X)) -> activate#(X) add#(s(X),Y) -> add#(X,Y) -> add#(s(X),Y) -> s#(add(X,Y)) add#(s(X),Y) -> add#(X,Y) -> add#(s(X),Y) -> add#(X,Y) dbl#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> s#(s(dbl(X))) dbl#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> s#(dbl(X)) dbl#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> dbl#(X) sqr#(s(X)) -> add#(sqr(X),dbl(X)) -> add#(s(X),Y) -> s#(add(X,Y)) sqr#(s(X)) -> add#(sqr(X),dbl(X)) -> add#(s(X),Y) -> add#(X,Y) sqr#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> s#(s(dbl(X))) sqr#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> s#(dbl(X)) sqr#(s(X)) -> dbl#(X) -> dbl#(s(X)) -> dbl#(X) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> s#(add(sqr(X),dbl(X))) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> add#(sqr(X),dbl(X)) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> sqr#(X) sqr#(s(X)) -> sqr#(X) -> sqr#(s(X)) -> dbl#(X) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> s#(add(sqr(X),dbl(X))) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> add#(sqr(X),dbl(X)) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> sqr#(X) terms#(N) -> sqr#(N) -> sqr#(s(X)) -> dbl#(X) SCC Processor: #sccs: 4 #rules: 9 #arcs: 55/324 DPs: activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> activate#(X1) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) -> activate#(Z) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X interpretation: [activate#](x0) = x0, [first#](x0, x1) = 7x0 + x1 + 0, [n__first](x0, x1) = 7x0 + x1 + 7, [activate](x0) = x0 + 0, [nil] = 0, [first](x0, x1) = 7x0 + x1 + 7, [add](x0, x1) = x0 + x1, [dbl](x0) = x0 + 0, [s](x0) = x0 + 0, [0] = 0, [cons](x0, x1) = x1 + 0, [n__terms](x0) = x0 + 0, [n__s](x0) = x0 + 0, [recip](x0) = x0 + 0, [sqr](x0) = x0 + 0, [terms](x0) = x0 + 0 orientation: activate#(n__first(X1,X2)) = 7X1 + X2 + 7 >= X2 = activate#(X2) activate#(n__terms(X)) = X + 0 >= X = activate#(X) activate#(n__s(X)) = X + 0 >= X = activate#(X) activate#(n__first(X1,X2)) = 7X1 + X2 + 7 >= X1 = activate#(X1) activate#(n__first(X1,X2)) = 7X1 + X2 + 7 >= 7X1 + X2 + 7 = first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) = 7X + Z + 7 >= Z = activate#(Z) terms(N) = N + 0 >= N + 0 = cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) = 0 >= 0 = 0() sqr(s(X)) = X + 0 >= X + 0 = s(add(sqr(X),dbl(X))) dbl(0()) = 0 >= 0 = 0() dbl(s(X)) = X + 0 >= X + 0 = s(s(dbl(X))) add(0(),X) = X + 0 >= X = X add(s(X),Y) = X + Y + 0 >= X + Y + 0 = s(add(X,Y)) first(0(),X) = X + 7 >= 0 = nil() first(s(X),cons(Y,Z)) = 7X + Z + 7 >= 7X + Z + 7 = cons(Y,n__first(X,activate(Z))) terms(X) = X + 0 >= X + 0 = n__terms(X) s(X) = X + 0 >= X + 0 = n__s(X) first(X1,X2) = 7X1 + X2 + 7 >= 7X1 + X2 + 7 = n__first(X1,X2) activate(n__terms(X)) = X + 0 >= X + 0 = terms(activate(X)) activate(n__s(X)) = X + 0 >= X + 0 = s(activate(X)) activate(n__first(X1,X2)) = 7X1 + X2 + 7 >= 7X1 + X2 + 7 = first(activate(X1),activate(X2)) activate(X) = X + 0 >= X = X problem: DPs: activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) -> activate#(Z) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Restore Modifier: DPs: activate#(n__first(X1,X2)) -> activate#(X2) activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) -> activate#(Z) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X interpretation: [activate#](x0) = x0, [first#](x0, x1) = 1x1 + 0, [n__first](x0, x1) = 1x1 + 3, [activate](x0) = x0 + 2, [nil] = 2, [first](x0, x1) = 1x1 + 3, [add](x0, x1) = x0 + x1, [dbl](x0) = 1x0 + 1, [s](x0) = x0 + 0, [0] = 6, [cons](x0, x1) = x1, [n__terms](x0) = x0, [n__s](x0) = x0, [recip](x0) = 3x0 + 4, [sqr](x0) = x0 + 0, [terms](x0) = x0 + 0 orientation: activate#(n__first(X1,X2)) = 1X2 + 3 >= X2 = activate#(X2) activate#(n__terms(X)) = X >= X = activate#(X) activate#(n__s(X)) = X >= X = activate#(X) activate#(n__first(X1,X2)) = 1X2 + 3 >= 1X2 + 3 = first#(activate(X1),activate(X2)) first#(s(X),cons(Y,Z)) = 1Z + 0 >= Z = activate#(Z) terms(N) = N + 0 >= N = cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) = 6 >= 6 = 0() sqr(s(X)) = X + 0 >= 1X + 1 = s(add(sqr(X),dbl(X))) dbl(0()) = 7 >= 6 = 0() dbl(s(X)) = 1X + 1 >= 1X + 1 = s(s(dbl(X))) add(0(),X) = X + 6 >= X = X add(s(X),Y) = X + Y + 0 >= X + Y + 0 = s(add(X,Y)) first(0(),X) = 1X + 3 >= 2 = nil() first(s(X),cons(Y,Z)) = 1Z + 3 >= 1Z + 3 = cons(Y,n__first(X,activate(Z))) terms(X) = X + 0 >= X = n__terms(X) s(X) = X + 0 >= X = n__s(X) first(X1,X2) = 1X2 + 3 >= 1X2 + 3 = n__first(X1,X2) activate(n__terms(X)) = X + 2 >= X + 2 = terms(activate(X)) activate(n__s(X)) = X + 2 >= X + 2 = s(activate(X)) activate(n__first(X1,X2)) = 1X2 + 3 >= 1X2 + 3 = first(activate(X1),activate(X2)) activate(X) = X + 2 >= X = X problem: DPs: activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Restore Modifier: DPs: activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) activate#(n__first(X1,X2)) -> first#(activate(X1),activate(X2)) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X SCC Processor: #sccs: 1 #rules: 2 #arcs: 26/9 DPs: activate#(n__terms(X)) -> activate#(X) activate#(n__s(X)) -> activate#(X) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Size-Change Termination Processor: DPs: TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X The DP: activate#(n__terms(X)) -> activate#(X) has the edges: 0 > 0 The DP: activate#(n__s(X)) -> activate#(X) has the edges: 0 > 0 Qed DPs: sqr#(s(X)) -> sqr#(X) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Subterm Criterion Processor: simple projection: pi(sqr#) = 0 problem: DPs: TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Qed DPs: add#(s(X),Y) -> add#(X,Y) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Subterm Criterion Processor: simple projection: pi(add#) = 0 problem: DPs: TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Qed DPs: dbl#(s(X)) -> dbl#(X) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Subterm Criterion Processor: simple projection: pi(dbl#) = 0 problem: DPs: TRS: terms(N) -> cons(recip(sqr(N)),n__terms(n__s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(add(sqr(X),dbl(X))) dbl(0()) -> 0() dbl(s(X)) -> s(s(dbl(X))) add(0(),X) -> X add(s(X),Y) -> s(add(X,Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) terms(X) -> n__terms(X) s(X) -> n__s(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) activate(X) -> X Qed