/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: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Proof: DP Processor: DPs: t#(N) -> q#(N) q#(s(X)) -> d#(X) q#(s(X)) -> q#(X) q#(s(X)) -> p#(q(X),d(X)) q#(s(X)) -> s#(p(q(X),d(X))) d#(s(X)) -> d#(X) d#(s(X)) -> s#(d(X)) d#(s(X)) -> s#(s(d(X))) p#(s(X),s(Y)) -> p#(X,Y) p#(s(X),s(Y)) -> s#(p(X,Y)) p#(s(X),s(Y)) -> s#(s(p(X,Y))) f#(s(X),cs(Y,Z)) -> a#(Z) a#(nt(X)) -> a#(X) a#(nt(X)) -> t#(a(X)) a#(ns(X)) -> a#(X) a#(ns(X)) -> s#(a(X)) a#(nf(X1,X2)) -> a#(X2) a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X TDG Processor: DPs: t#(N) -> q#(N) q#(s(X)) -> d#(X) q#(s(X)) -> q#(X) q#(s(X)) -> p#(q(X),d(X)) q#(s(X)) -> s#(p(q(X),d(X))) d#(s(X)) -> d#(X) d#(s(X)) -> s#(d(X)) d#(s(X)) -> s#(s(d(X))) p#(s(X),s(Y)) -> p#(X,Y) p#(s(X),s(Y)) -> s#(p(X,Y)) p#(s(X),s(Y)) -> s#(s(p(X,Y))) f#(s(X),cs(Y,Z)) -> a#(Z) a#(nt(X)) -> a#(X) a#(nt(X)) -> t#(a(X)) a#(ns(X)) -> a#(X) a#(ns(X)) -> s#(a(X)) a#(nf(X1,X2)) -> a#(X2) a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X graph: a#(nf(X1,X2)) -> a#(X2) -> a#(nf(X1,X2)) -> f#(a(X1),a(X2)) a#(nf(X1,X2)) -> a#(X2) -> a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> a#(X2) -> a#(nf(X1,X2)) -> a#(X2) a#(nf(X1,X2)) -> a#(X2) -> a#(ns(X)) -> s#(a(X)) a#(nf(X1,X2)) -> a#(X2) -> a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X2) -> a#(nt(X)) -> t#(a(X)) a#(nf(X1,X2)) -> a#(X2) -> a#(nt(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) -> a#(nf(X1,X2)) -> f#(a(X1),a(X2)) a#(nf(X1,X2)) -> a#(X1) -> a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> a#(X1) -> a#(nf(X1,X2)) -> a#(X2) a#(nf(X1,X2)) -> a#(X1) -> a#(ns(X)) -> s#(a(X)) a#(nf(X1,X2)) -> a#(X1) -> a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) -> a#(nt(X)) -> t#(a(X)) a#(nf(X1,X2)) -> a#(X1) -> a#(nt(X)) -> a#(X) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) -> f#(s(X),cs(Y,Z)) -> a#(Z) a#(nt(X)) -> a#(X) -> a#(nf(X1,X2)) -> f#(a(X1),a(X2)) a#(nt(X)) -> a#(X) -> a#(nf(X1,X2)) -> a#(X1) a#(nt(X)) -> a#(X) -> a#(nf(X1,X2)) -> a#(X2) a#(nt(X)) -> a#(X) -> a#(ns(X)) -> s#(a(X)) a#(nt(X)) -> a#(X) -> a#(ns(X)) -> a#(X) a#(nt(X)) -> a#(X) -> a#(nt(X)) -> t#(a(X)) a#(nt(X)) -> a#(X) -> a#(nt(X)) -> a#(X) a#(nt(X)) -> t#(a(X)) -> t#(N) -> q#(N) a#(ns(X)) -> a#(X) -> a#(nf(X1,X2)) -> f#(a(X1),a(X2)) a#(ns(X)) -> a#(X) -> a#(nf(X1,X2)) -> a#(X1) a#(ns(X)) -> a#(X) -> a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) -> a#(ns(X)) -> s#(a(X)) a#(ns(X)) -> a#(X) -> a#(ns(X)) -> a#(X) a#(ns(X)) -> a#(X) -> a#(nt(X)) -> t#(a(X)) a#(ns(X)) -> a#(X) -> a#(nt(X)) -> a#(X) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(nf(X1,X2)) -> f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(nf(X1,X2)) -> a#(X1) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(nf(X1,X2)) -> a#(X2) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(ns(X)) -> s#(a(X)) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(ns(X)) -> a#(X) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(nt(X)) -> t#(a(X)) f#(s(X),cs(Y,Z)) -> a#(Z) -> a#(nt(X)) -> a#(X) p#(s(X),s(Y)) -> p#(X,Y) -> p#(s(X),s(Y)) -> s#(s(p(X,Y))) p#(s(X),s(Y)) -> p#(X,Y) -> p#(s(X),s(Y)) -> s#(p(X,Y)) p#(s(X),s(Y)) -> p#(X,Y) -> p#(s(X),s(Y)) -> p#(X,Y) d#(s(X)) -> d#(X) -> d#(s(X)) -> s#(s(d(X))) d#(s(X)) -> d#(X) -> d#(s(X)) -> s#(d(X)) d#(s(X)) -> d#(X) -> d#(s(X)) -> d#(X) q#(s(X)) -> p#(q(X),d(X)) -> p#(s(X),s(Y)) -> s#(s(p(X,Y))) q#(s(X)) -> p#(q(X),d(X)) -> p#(s(X),s(Y)) -> s#(p(X,Y)) q#(s(X)) -> p#(q(X),d(X)) -> p#(s(X),s(Y)) -> p#(X,Y) q#(s(X)) -> d#(X) -> d#(s(X)) -> s#(s(d(X))) q#(s(X)) -> d#(X) -> d#(s(X)) -> s#(d(X)) q#(s(X)) -> d#(X) -> d#(s(X)) -> d#(X) q#(s(X)) -> q#(X) -> q#(s(X)) -> s#(p(q(X),d(X))) q#(s(X)) -> q#(X) -> q#(s(X)) -> p#(q(X),d(X)) q#(s(X)) -> q#(X) -> q#(s(X)) -> q#(X) q#(s(X)) -> q#(X) -> q#(s(X)) -> d#(X) t#(N) -> q#(N) -> q#(s(X)) -> s#(p(q(X),d(X))) t#(N) -> q#(N) -> q#(s(X)) -> p#(q(X),d(X)) t#(N) -> q#(N) -> q#(s(X)) -> q#(X) t#(N) -> q#(N) -> q#(s(X)) -> d#(X) SCC Processor: #sccs: 4 #rules: 9 #arcs: 57/361 DPs: a#(nf(X1,X2)) -> a#(X2) a#(nt(X)) -> a#(X) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) -> a#(Z) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: t(N) -> cs(r(q(N)),nt(ns(N))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X interpretation: [a#](x0) = x0, [f#](x0, x1) = x0 + x1, [nf](x0, x1) = x0 + x1 + 0, [a](x0) = x0, [nil] = 0, [f](x0, x1) = x0 + x1 + 0, [p](x0, x1) = x0 + 0, [d](x0) = 2x0 + 0, [s](x0) = x0, [0] = 5, [cs](x0, x1) = x1, [nt](x0) = 1x0, [ns](x0) = x0, [r](x0) = 2x0 + 0, [q](x0) = x0 + 0, [t](x0) = 1x0 orientation: a#(nf(X1,X2)) = X1 + X2 + 0 >= X2 = a#(X2) a#(nt(X)) = 1X >= X = a#(X) a#(ns(X)) = X >= X = a#(X) a#(nf(X1,X2)) = X1 + X2 + 0 >= X1 = a#(X1) a#(nf(X1,X2)) = X1 + X2 + 0 >= X1 + X2 = f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) = X + Z >= Z = a#(Z) t(N) = 1N >= 1N = cs(r(q(N)),nt(ns(N))) q(0()) = 5 >= 5 = 0() q(s(X)) = X + 0 >= X + 0 = s(p(q(X),d(X))) d(0()) = 7 >= 5 = 0() d(s(X)) = 2X + 0 >= 2X + 0 = s(s(d(X))) p(0(),X) = 5 >= X = X p(X,0()) = X + 0 >= X = X p(s(X),s(Y)) = X + 0 >= X + 0 = s(s(p(X,Y))) f(0(),X) = X + 5 >= 0 = nil() f(s(X),cs(Y,Z)) = X + Z + 0 >= X + Z + 0 = cs(Y,nf(X,a(Z))) t(X) = 1X >= 1X = nt(X) s(X) = X >= X = ns(X) f(X1,X2) = X1 + X2 + 0 >= X1 + X2 + 0 = nf(X1,X2) a(nt(X)) = 1X >= 1X = t(a(X)) a(ns(X)) = X >= X = s(a(X)) a(nf(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = f(a(X1),a(X2)) a(X) = X >= X = X problem: DPs: a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) -> a#(Z) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Restore Modifier: DPs: a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) a#(nf(X1,X2)) -> f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) -> a#(Z) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: t(N) -> cs(r(q(N)),nt(ns(N))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X interpretation: [a#](x0) = x0 + 0, [f#](x0, x1) = x1, [nf](x0, x1) = x0 + 2x1 + 0, [a](x0) = x0, [nil] = 2, [f](x0, x1) = x0 + 2x1 + 0, [p](x0, x1) = x0 + 2x1 + 4, [d](x0) = 1x0 + 0, [s](x0) = x0, [0] = 2, [cs](x0, x1) = x1 + 0, [nt](x0) = 1, [ns](x0) = x0, [r](x0) = 4x0 + 0, [q](x0) = x0 + 0, [t](x0) = 1 orientation: a#(nf(X1,X2)) = X1 + 2X2 + 0 >= X2 + 0 = a#(X2) a#(ns(X)) = X + 0 >= X + 0 = a#(X) a#(nf(X1,X2)) = X1 + 2X2 + 0 >= X1 + 0 = a#(X1) a#(nf(X1,X2)) = X1 + 2X2 + 0 >= X2 = f#(a(X1),a(X2)) f#(s(X),cs(Y,Z)) = Z + 0 >= Z + 0 = a#(Z) t(N) = 1 >= 1 = cs(r(q(N)),nt(ns(N))) q(0()) = 2 >= 2 = 0() q(s(X)) = X + 0 >= 3X + 4 = s(p(q(X),d(X))) d(0()) = 3 >= 2 = 0() d(s(X)) = 1X + 0 >= 1X + 0 = s(s(d(X))) p(0(),X) = 2X + 4 >= X = X p(X,0()) = X + 4 >= X = X p(s(X),s(Y)) = X + 2Y + 4 >= X + 2Y + 4 = s(s(p(X,Y))) f(0(),X) = 2X + 2 >= 2 = nil() f(s(X),cs(Y,Z)) = X + 2Z + 2 >= X + 2Z + 0 = cs(Y,nf(X,a(Z))) t(X) = 1 >= 1 = nt(X) s(X) = X >= X = ns(X) f(X1,X2) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = nf(X1,X2) a(nt(X)) = 1 >= 1 = t(a(X)) a(ns(X)) = X >= X = s(a(X)) a(nf(X1,X2)) = X1 + 2X2 + 0 >= X1 + 2X2 + 0 = f(a(X1),a(X2)) a(X) = X >= X = X problem: DPs: a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) f#(s(X),cs(Y,Z)) -> a#(Z) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Restore Modifier: DPs: a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) f#(s(X),cs(Y,Z)) -> a#(Z) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X SCC Processor: #sccs: 1 #rules: 3 #arcs: 26/16 DPs: a#(nf(X1,X2)) -> a#(X2) a#(ns(X)) -> a#(X) a#(nf(X1,X2)) -> a#(X1) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Size-Change Termination Processor: DPs: TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X The DP: a#(nf(X1,X2)) -> a#(X2) has the edges: 0 > 0 The DP: a#(ns(X)) -> a#(X) has the edges: 0 > 0 The DP: a#(nf(X1,X2)) -> a#(X1) has the edges: 0 > 0 Qed DPs: q#(s(X)) -> q#(X) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Subterm Criterion Processor: simple projection: pi(q#) = 0 problem: DPs: TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Qed DPs: p#(s(X),s(Y)) -> p#(X,Y) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Subterm Criterion Processor: simple projection: pi(p#) = 0 problem: DPs: TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Qed DPs: d#(s(X)) -> d#(X) TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Subterm Criterion Processor: simple projection: pi(d#) = 0 problem: DPs: TRS: t(N) -> cs(r(q(N)),nt(ns(N))) q(0()) -> 0() q(s(X)) -> s(p(q(X),d(X))) d(0()) -> 0() d(s(X)) -> s(s(d(X))) p(0(),X) -> X p(X,0()) -> X p(s(X),s(Y)) -> s(s(p(X,Y))) f(0(),X) -> nil() f(s(X),cs(Y,Z)) -> cs(Y,nf(X,a(Z))) t(X) -> nt(X) s(X) -> ns(X) f(X1,X2) -> nf(X1,X2) a(nt(X)) -> t(a(X)) a(ns(X)) -> s(a(X)) a(nf(X1,X2)) -> f(a(X1),a(X2)) a(X) -> X Qed