(0) Obligation:

Clauses:

insert(X, void, tree(X, void, void)).
insert(X, tree(X, Left, Right), tree(X, Left, Right)).
insert(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), insert(X, Left, Left1)).
insert(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), insert(X, Right, Right1)).
less(0, s(X1)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

insert(g,a,g).

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph.

(2) Obligation:

Triples:

less17(s(T30)) :- less17(T30).
p15(T25, T20) :- less17(T25).
p15(T25, T20) :- ','(lessc17(T25), insert1(s(T25), T20, void)).
p28(s(T90), T87) :- p15(T90, T87).
less146(s(T332), s(T333)) :- less146(T332, T333).
insert1(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) :- p15(T25, T20).
insert1(T56, tree(T56, void, T60), tree(T56, void, void)) :- less17(T56).
insert1(T56, tree(T56, void, T60), tree(T56, void, void)) :- ','(lessc17(T56), insert1(T56, T60, void)).
insert1(T83, tree(T83, void, T87), tree(T83, void, void)) :- p28(T83, T87).
insert1(s(T105), tree(s(T105), T100, void), tree(s(T105), void, void)) :- p15(T105, T100).
insert1(T115, tree(T115, void, T119), tree(T115, void, void)) :- p28(T115, T119).
insert1(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) :- p15(T132, T129).
insert1(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) :- less17(T155).
insert1(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) :- ','(lessc17(T155), insert1(s(T155), T150, T149)).
insert1(T170, tree(T170, T172, T175), tree(T170, T172, T174)) :- less17(T170).
insert1(T170, tree(T170, T172, T175), tree(T170, T172, T174)) :- ','(lessc17(T170), insert1(T170, T175, T174)).
insert1(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) :- less17(T193).
insert1(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) :- ','(lessc17(T193), insert1(s(T193), T190, T189)).
insert1(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) :- insert1(0, T208, T207).
insert1(s(s(s(s(s(s(s(s(T315)))))))), tree(s(s(s(s(s(s(s(s(T316)))))))), T208, T206), tree(s(s(s(s(s(s(s(s(T316)))))))), T207, T206)) :- less146(T315, T316).
insert1(s(T222), tree(s(T223), T208, T206), tree(s(T223), T207, T206)) :- ','(lessc88(T222, T223), insert1(s(T222), T208, T207)).
insert1(T348, tree(T349, T350, T353), tree(T349, T350, T352)) :- less146(T349, T348).
insert1(T348, tree(T349, T350, T353), tree(T349, T350, T352)) :- ','(lessc146(T349, T348), insert1(T348, T353, T352)).
insert1(s(T375), tree(0, T367, T370), tree(0, T367, T369)) :- insert1(s(T375), T370, T369).
insert1(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) :- less146(T382, T383).
insert1(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) :- ','(lessc146(T382, T383), insert1(s(T383), T370, T369)).

Clauses:

insertc1(T5, void, tree(T5, void, void)).
insertc1(T9, tree(T9, void, void), tree(T9, void, void)).
insertc1(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) :- qc15(T25, T20).
insertc1(T56, tree(T56, void, T60), tree(T56, void, void)) :- ','(lessc17(T56), insertc1(T56, T60, void)).
insertc1(T83, tree(T83, void, T87), tree(T83, void, void)) :- qc28(T83, T87).
insertc1(s(T105), tree(s(T105), T100, void), tree(s(T105), void, void)) :- qc15(T105, T100).
insertc1(T115, tree(T115, void, T119), tree(T115, void, void)) :- qc28(T115, T119).
insertc1(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) :- qc15(T132, T129).
insertc1(T137, tree(T137, T138, T139), tree(T137, T138, T139)).
insertc1(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) :- ','(lessc17(T155), insertc1(s(T155), T150, T149)).
insertc1(T170, tree(T170, T172, T175), tree(T170, T172, T174)) :- ','(lessc17(T170), insertc1(T170, T175, T174)).
insertc1(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) :- ','(lessc17(T193), insertc1(s(T193), T190, T189)).
insertc1(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) :- insertc1(0, T208, T207).
insertc1(s(T222), tree(s(T223), T208, T206), tree(s(T223), T207, T206)) :- ','(lessc88(T222, T223), insertc1(s(T222), T208, T207)).
insertc1(T348, tree(T349, T350, T353), tree(T349, T350, T352)) :- ','(lessc146(T349, T348), insertc1(T348, T353, T352)).
insertc1(s(T375), tree(0, T367, T370), tree(0, T367, T369)) :- insertc1(s(T375), T370, T369).
insertc1(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) :- ','(lessc146(T382, T383), insertc1(s(T383), T370, T369)).
lessc17(s(T30)) :- lessc17(T30).
qc15(T25, T20) :- ','(lessc17(T25), insertc1(s(T25), T20, void)).
qc28(s(T90), T87) :- qc15(T90, T87).
lessc146(0, s(T327)).
lessc146(s(T332), s(T333)) :- lessc146(T332, T333).
lessc88(0, s(T232)).
lessc88(s(0), s(s(T245))).
lessc88(s(s(0)), s(s(s(T258)))).
lessc88(s(s(s(0))), s(s(s(s(T271))))).
lessc88(s(s(s(s(0)))), s(s(s(s(s(T284)))))).
lessc88(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))).
lessc88(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))).
lessc88(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) :- lessc146(T315, T316).

Afs:

insert1(x1, x2, x3)  =  insert1(x1, x3)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
insert1_in: (b,f,b)
p15_in: (b,f)
less17_in: (b)
lessc17_in: (b)
p28_in: (b,f)
less146_in: (b,b)
lessc88_in: (b,b)
lessc146_in: (b,b)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

INSERT1_IN_GAG(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) → U7_GAG(T25, T20, p15_in_ga(T25, T20))
INSERT1_IN_GAG(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) → P15_IN_GA(T25, T20)
P15_IN_GA(T25, T20) → U2_GA(T25, T20, less17_in_g(T25))
P15_IN_GA(T25, T20) → LESS17_IN_G(T25)
LESS17_IN_G(s(T30)) → U1_G(T30, less17_in_g(T30))
LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)
P15_IN_GA(T25, T20) → U3_GA(T25, T20, lessc17_in_g(T25))
U3_GA(T25, T20, lessc17_out_g(T25)) → U4_GA(T25, T20, insert1_in_gag(s(T25), T20, void))
U3_GA(T25, T20, lessc17_out_g(T25)) → INSERT1_IN_GAG(s(T25), T20, void)
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → U8_GAG(T56, T60, less17_in_g(T56))
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → LESS17_IN_G(T56)
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → U9_GAG(T56, T60, lessc17_in_g(T56))
U9_GAG(T56, T60, lessc17_out_g(T56)) → U10_GAG(T56, T60, insert1_in_gag(T56, T60, void))
U9_GAG(T56, T60, lessc17_out_g(T56)) → INSERT1_IN_GAG(T56, T60, void)
INSERT1_IN_GAG(T83, tree(T83, void, T87), tree(T83, void, void)) → U11_GAG(T83, T87, p28_in_ga(T83, T87))
INSERT1_IN_GAG(T83, tree(T83, void, T87), tree(T83, void, void)) → P28_IN_GA(T83, T87)
P28_IN_GA(s(T90), T87) → U5_GA(T90, T87, p15_in_ga(T90, T87))
P28_IN_GA(s(T90), T87) → P15_IN_GA(T90, T87)
INSERT1_IN_GAG(s(T105), tree(s(T105), T100, void), tree(s(T105), void, void)) → U12_GAG(T105, T100, p15_in_ga(T105, T100))
INSERT1_IN_GAG(T115, tree(T115, void, T119), tree(T115, void, void)) → U13_GAG(T115, T119, p28_in_ga(T115, T119))
INSERT1_IN_GAG(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) → U14_GAG(T132, T129, p15_in_ga(T132, T129))
INSERT1_IN_GAG(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) → P15_IN_GA(T132, T129)
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → U15_GAG(T155, T150, T148, T149, less17_in_g(T155))
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → LESS17_IN_G(T155)
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → U16_GAG(T155, T150, T148, T149, lessc17_in_g(T155))
U16_GAG(T155, T150, T148, T149, lessc17_out_g(T155)) → U17_GAG(T155, T150, T148, T149, insert1_in_gag(s(T155), T150, T149))
U16_GAG(T155, T150, T148, T149, lessc17_out_g(T155)) → INSERT1_IN_GAG(s(T155), T150, T149)
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → U18_GAG(T170, T172, T175, T174, less17_in_g(T170))
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → LESS17_IN_G(T170)
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → U19_GAG(T170, T172, T175, T174, lessc17_in_g(T170))
U19_GAG(T170, T172, T175, T174, lessc17_out_g(T170)) → U20_GAG(T170, T172, T175, T174, insert1_in_gag(T170, T175, T174))
U19_GAG(T170, T172, T175, T174, lessc17_out_g(T170)) → INSERT1_IN_GAG(T170, T175, T174)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → U21_GAG(T193, T187, T190, T189, less17_in_g(T193))
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → LESS17_IN_G(T193)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → U22_GAG(T193, T187, T190, T189, lessc17_in_g(T193))
U22_GAG(T193, T187, T190, T189, lessc17_out_g(T193)) → U23_GAG(T193, T187, T190, T189, insert1_in_gag(s(T193), T190, T189))
U22_GAG(T193, T187, T190, T189, lessc17_out_g(T193)) → INSERT1_IN_GAG(s(T193), T190, T189)
INSERT1_IN_GAG(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) → U24_GAG(T213, T208, T206, T207, insert1_in_gag(0, T208, T207))
INSERT1_IN_GAG(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) → INSERT1_IN_GAG(0, T208, T207)
INSERT1_IN_GAG(s(s(s(s(s(s(s(s(T315)))))))), tree(s(s(s(s(s(s(s(s(T316)))))))), T208, T206), tree(s(s(s(s(s(s(s(s(T316)))))))), T207, T206)) → U25_GAG(T315, T316, T208, T206, T207, less146_in_gg(T315, T316))
INSERT1_IN_GAG(s(s(s(s(s(s(s(s(T315)))))))), tree(s(s(s(s(s(s(s(s(T316)))))))), T208, T206), tree(s(s(s(s(s(s(s(s(T316)))))))), T207, T206)) → LESS146_IN_GG(T315, T316)
LESS146_IN_GG(s(T332), s(T333)) → U6_GG(T332, T333, less146_in_gg(T332, T333))
LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)
INSERT1_IN_GAG(s(T222), tree(s(T223), T208, T206), tree(s(T223), T207, T206)) → U26_GAG(T222, T223, T208, T206, T207, lessc88_in_gg(T222, T223))
U26_GAG(T222, T223, T208, T206, T207, lessc88_out_gg(T222, T223)) → U27_GAG(T222, T223, T208, T206, T207, insert1_in_gag(s(T222), T208, T207))
U26_GAG(T222, T223, T208, T206, T207, lessc88_out_gg(T222, T223)) → INSERT1_IN_GAG(s(T222), T208, T207)
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → U28_GAG(T348, T349, T350, T353, T352, less146_in_gg(T349, T348))
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → LESS146_IN_GG(T349, T348)
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → U29_GAG(T348, T349, T350, T353, T352, lessc146_in_gg(T349, T348))
U29_GAG(T348, T349, T350, T353, T352, lessc146_out_gg(T349, T348)) → U30_GAG(T348, T349, T350, T353, T352, insert1_in_gag(T348, T353, T352))
U29_GAG(T348, T349, T350, T353, T352, lessc146_out_gg(T349, T348)) → INSERT1_IN_GAG(T348, T353, T352)
INSERT1_IN_GAG(s(T375), tree(0, T367, T370), tree(0, T367, T369)) → U31_GAG(T375, T367, T370, T369, insert1_in_gag(s(T375), T370, T369))
INSERT1_IN_GAG(s(T375), tree(0, T367, T370), tree(0, T367, T369)) → INSERT1_IN_GAG(s(T375), T370, T369)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → U32_GAG(T383, T382, T367, T370, T369, less146_in_gg(T382, T383))
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → LESS146_IN_GG(T382, T383)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → U33_GAG(T383, T382, T367, T370, T369, lessc146_in_gg(T382, T383))
U33_GAG(T383, T382, T367, T370, T369, lessc146_out_gg(T382, T383)) → U34_GAG(T383, T382, T367, T370, T369, insert1_in_gag(s(T383), T370, T369))
U33_GAG(T383, T382, T367, T370, T369, lessc146_out_gg(T382, T383)) → INSERT1_IN_GAG(s(T383), T370, T369)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

The argument filtering Pi contains the following mapping:
insert1_in_gag(x1, x2, x3)  =  insert1_in_gag(x1, x3)
s(x1)  =  s(x1)
tree(x1, x2, x3)  =  tree(x1, x2, x3)
void  =  void
p15_in_ga(x1, x2)  =  p15_in_ga(x1)
less17_in_g(x1)  =  less17_in_g(x1)
lessc17_in_g(x1)  =  lessc17_in_g(x1)
U57_g(x1, x2)  =  U57_g(x1, x2)
lessc17_out_g(x1)  =  lessc17_out_g(x1)
p28_in_ga(x1, x2)  =  p28_in_ga(x1)
0  =  0
less146_in_gg(x1, x2)  =  less146_in_gg(x1, x2)
lessc88_in_gg(x1, x2)  =  lessc88_in_gg(x1, x2)
lessc88_out_gg(x1, x2)  =  lessc88_out_gg(x1, x2)
U62_gg(x1, x2, x3)  =  U62_gg(x1, x2, x3)
lessc146_in_gg(x1, x2)  =  lessc146_in_gg(x1, x2)
lessc146_out_gg(x1, x2)  =  lessc146_out_gg(x1, x2)
U61_gg(x1, x2, x3)  =  U61_gg(x1, x2, x3)
INSERT1_IN_GAG(x1, x2, x3)  =  INSERT1_IN_GAG(x1, x3)
U7_GAG(x1, x2, x3)  =  U7_GAG(x1, x3)
P15_IN_GA(x1, x2)  =  P15_IN_GA(x1)
U2_GA(x1, x2, x3)  =  U2_GA(x1, x3)
LESS17_IN_G(x1)  =  LESS17_IN_G(x1)
U1_G(x1, x2)  =  U1_G(x1, x2)
U3_GA(x1, x2, x3)  =  U3_GA(x1, x3)
U4_GA(x1, x2, x3)  =  U4_GA(x1, x3)
U8_GAG(x1, x2, x3)  =  U8_GAG(x1, x3)
U9_GAG(x1, x2, x3)  =  U9_GAG(x1, x3)
U10_GAG(x1, x2, x3)  =  U10_GAG(x1, x3)
U11_GAG(x1, x2, x3)  =  U11_GAG(x1, x3)
P28_IN_GA(x1, x2)  =  P28_IN_GA(x1)
U5_GA(x1, x2, x3)  =  U5_GA(x1, x3)
U12_GAG(x1, x2, x3)  =  U12_GAG(x1, x3)
U13_GAG(x1, x2, x3)  =  U13_GAG(x1, x3)
U14_GAG(x1, x2, x3)  =  U14_GAG(x1, x3)
U15_GAG(x1, x2, x3, x4, x5)  =  U15_GAG(x1, x3, x4, x5)
U16_GAG(x1, x2, x3, x4, x5)  =  U16_GAG(x1, x3, x4, x5)
U17_GAG(x1, x2, x3, x4, x5)  =  U17_GAG(x1, x3, x4, x5)
U18_GAG(x1, x2, x3, x4, x5)  =  U18_GAG(x1, x2, x4, x5)
U19_GAG(x1, x2, x3, x4, x5)  =  U19_GAG(x1, x2, x4, x5)
U20_GAG(x1, x2, x3, x4, x5)  =  U20_GAG(x1, x2, x4, x5)
U21_GAG(x1, x2, x3, x4, x5)  =  U21_GAG(x1, x2, x4, x5)
U22_GAG(x1, x2, x3, x4, x5)  =  U22_GAG(x1, x2, x4, x5)
U23_GAG(x1, x2, x3, x4, x5)  =  U23_GAG(x1, x2, x4, x5)
U24_GAG(x1, x2, x3, x4, x5)  =  U24_GAG(x1, x3, x4, x5)
U25_GAG(x1, x2, x3, x4, x5, x6)  =  U25_GAG(x1, x2, x4, x5, x6)
LESS146_IN_GG(x1, x2)  =  LESS146_IN_GG(x1, x2)
U6_GG(x1, x2, x3)  =  U6_GG(x1, x2, x3)
U26_GAG(x1, x2, x3, x4, x5, x6)  =  U26_GAG(x1, x2, x4, x5, x6)
U27_GAG(x1, x2, x3, x4, x5, x6)  =  U27_GAG(x1, x2, x4, x5, x6)
U28_GAG(x1, x2, x3, x4, x5, x6)  =  U28_GAG(x1, x2, x3, x5, x6)
U29_GAG(x1, x2, x3, x4, x5, x6)  =  U29_GAG(x1, x2, x3, x5, x6)
U30_GAG(x1, x2, x3, x4, x5, x6)  =  U30_GAG(x1, x2, x3, x5, x6)
U31_GAG(x1, x2, x3, x4, x5)  =  U31_GAG(x1, x2, x4, x5)
U32_GAG(x1, x2, x3, x4, x5, x6)  =  U32_GAG(x1, x2, x3, x5, x6)
U33_GAG(x1, x2, x3, x4, x5, x6)  =  U33_GAG(x1, x2, x3, x5, x6)
U34_GAG(x1, x2, x3, x4, x5, x6)  =  U34_GAG(x1, x2, x3, x5, x6)

We have to consider all (P,R,Pi)-chains

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

INSERT1_IN_GAG(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) → U7_GAG(T25, T20, p15_in_ga(T25, T20))
INSERT1_IN_GAG(s(T25), tree(s(T25), T20, void), tree(s(T25), void, void)) → P15_IN_GA(T25, T20)
P15_IN_GA(T25, T20) → U2_GA(T25, T20, less17_in_g(T25))
P15_IN_GA(T25, T20) → LESS17_IN_G(T25)
LESS17_IN_G(s(T30)) → U1_G(T30, less17_in_g(T30))
LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)
P15_IN_GA(T25, T20) → U3_GA(T25, T20, lessc17_in_g(T25))
U3_GA(T25, T20, lessc17_out_g(T25)) → U4_GA(T25, T20, insert1_in_gag(s(T25), T20, void))
U3_GA(T25, T20, lessc17_out_g(T25)) → INSERT1_IN_GAG(s(T25), T20, void)
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → U8_GAG(T56, T60, less17_in_g(T56))
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → LESS17_IN_G(T56)
INSERT1_IN_GAG(T56, tree(T56, void, T60), tree(T56, void, void)) → U9_GAG(T56, T60, lessc17_in_g(T56))
U9_GAG(T56, T60, lessc17_out_g(T56)) → U10_GAG(T56, T60, insert1_in_gag(T56, T60, void))
U9_GAG(T56, T60, lessc17_out_g(T56)) → INSERT1_IN_GAG(T56, T60, void)
INSERT1_IN_GAG(T83, tree(T83, void, T87), tree(T83, void, void)) → U11_GAG(T83, T87, p28_in_ga(T83, T87))
INSERT1_IN_GAG(T83, tree(T83, void, T87), tree(T83, void, void)) → P28_IN_GA(T83, T87)
P28_IN_GA(s(T90), T87) → U5_GA(T90, T87, p15_in_ga(T90, T87))
P28_IN_GA(s(T90), T87) → P15_IN_GA(T90, T87)
INSERT1_IN_GAG(s(T105), tree(s(T105), T100, void), tree(s(T105), void, void)) → U12_GAG(T105, T100, p15_in_ga(T105, T100))
INSERT1_IN_GAG(T115, tree(T115, void, T119), tree(T115, void, void)) → U13_GAG(T115, T119, p28_in_ga(T115, T119))
INSERT1_IN_GAG(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) → U14_GAG(T132, T129, p15_in_ga(T132, T129))
INSERT1_IN_GAG(s(T132), tree(s(T132), void, T129), tree(s(T132), void, void)) → P15_IN_GA(T132, T129)
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → U15_GAG(T155, T150, T148, T149, less17_in_g(T155))
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → LESS17_IN_G(T155)
INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → U16_GAG(T155, T150, T148, T149, lessc17_in_g(T155))
U16_GAG(T155, T150, T148, T149, lessc17_out_g(T155)) → U17_GAG(T155, T150, T148, T149, insert1_in_gag(s(T155), T150, T149))
U16_GAG(T155, T150, T148, T149, lessc17_out_g(T155)) → INSERT1_IN_GAG(s(T155), T150, T149)
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → U18_GAG(T170, T172, T175, T174, less17_in_g(T170))
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → LESS17_IN_G(T170)
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → U19_GAG(T170, T172, T175, T174, lessc17_in_g(T170))
U19_GAG(T170, T172, T175, T174, lessc17_out_g(T170)) → U20_GAG(T170, T172, T175, T174, insert1_in_gag(T170, T175, T174))
U19_GAG(T170, T172, T175, T174, lessc17_out_g(T170)) → INSERT1_IN_GAG(T170, T175, T174)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → U21_GAG(T193, T187, T190, T189, less17_in_g(T193))
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → LESS17_IN_G(T193)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → U22_GAG(T193, T187, T190, T189, lessc17_in_g(T193))
U22_GAG(T193, T187, T190, T189, lessc17_out_g(T193)) → U23_GAG(T193, T187, T190, T189, insert1_in_gag(s(T193), T190, T189))
U22_GAG(T193, T187, T190, T189, lessc17_out_g(T193)) → INSERT1_IN_GAG(s(T193), T190, T189)
INSERT1_IN_GAG(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) → U24_GAG(T213, T208, T206, T207, insert1_in_gag(0, T208, T207))
INSERT1_IN_GAG(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) → INSERT1_IN_GAG(0, T208, T207)
INSERT1_IN_GAG(s(s(s(s(s(s(s(s(T315)))))))), tree(s(s(s(s(s(s(s(s(T316)))))))), T208, T206), tree(s(s(s(s(s(s(s(s(T316)))))))), T207, T206)) → U25_GAG(T315, T316, T208, T206, T207, less146_in_gg(T315, T316))
INSERT1_IN_GAG(s(s(s(s(s(s(s(s(T315)))))))), tree(s(s(s(s(s(s(s(s(T316)))))))), T208, T206), tree(s(s(s(s(s(s(s(s(T316)))))))), T207, T206)) → LESS146_IN_GG(T315, T316)
LESS146_IN_GG(s(T332), s(T333)) → U6_GG(T332, T333, less146_in_gg(T332, T333))
LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)
INSERT1_IN_GAG(s(T222), tree(s(T223), T208, T206), tree(s(T223), T207, T206)) → U26_GAG(T222, T223, T208, T206, T207, lessc88_in_gg(T222, T223))
U26_GAG(T222, T223, T208, T206, T207, lessc88_out_gg(T222, T223)) → U27_GAG(T222, T223, T208, T206, T207, insert1_in_gag(s(T222), T208, T207))
U26_GAG(T222, T223, T208, T206, T207, lessc88_out_gg(T222, T223)) → INSERT1_IN_GAG(s(T222), T208, T207)
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → U28_GAG(T348, T349, T350, T353, T352, less146_in_gg(T349, T348))
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → LESS146_IN_GG(T349, T348)
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → U29_GAG(T348, T349, T350, T353, T352, lessc146_in_gg(T349, T348))
U29_GAG(T348, T349, T350, T353, T352, lessc146_out_gg(T349, T348)) → U30_GAG(T348, T349, T350, T353, T352, insert1_in_gag(T348, T353, T352))
U29_GAG(T348, T349, T350, T353, T352, lessc146_out_gg(T349, T348)) → INSERT1_IN_GAG(T348, T353, T352)
INSERT1_IN_GAG(s(T375), tree(0, T367, T370), tree(0, T367, T369)) → U31_GAG(T375, T367, T370, T369, insert1_in_gag(s(T375), T370, T369))
INSERT1_IN_GAG(s(T375), tree(0, T367, T370), tree(0, T367, T369)) → INSERT1_IN_GAG(s(T375), T370, T369)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → U32_GAG(T383, T382, T367, T370, T369, less146_in_gg(T382, T383))
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → LESS146_IN_GG(T382, T383)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → U33_GAG(T383, T382, T367, T370, T369, lessc146_in_gg(T382, T383))
U33_GAG(T383, T382, T367, T370, T369, lessc146_out_gg(T382, T383)) → U34_GAG(T383, T382, T367, T370, T369, insert1_in_gag(s(T383), T370, T369))
U33_GAG(T383, T382, T367, T370, T369, lessc146_out_gg(T382, T383)) → INSERT1_IN_GAG(s(T383), T370, T369)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

The argument filtering Pi contains the following mapping:
insert1_in_gag(x1, x2, x3)  =  insert1_in_gag(x1, x3)
s(x1)  =  s(x1)
tree(x1, x2, x3)  =  tree(x1, x2, x3)
void  =  void
p15_in_ga(x1, x2)  =  p15_in_ga(x1)
less17_in_g(x1)  =  less17_in_g(x1)
lessc17_in_g(x1)  =  lessc17_in_g(x1)
U57_g(x1, x2)  =  U57_g(x1, x2)
lessc17_out_g(x1)  =  lessc17_out_g(x1)
p28_in_ga(x1, x2)  =  p28_in_ga(x1)
0  =  0
less146_in_gg(x1, x2)  =  less146_in_gg(x1, x2)
lessc88_in_gg(x1, x2)  =  lessc88_in_gg(x1, x2)
lessc88_out_gg(x1, x2)  =  lessc88_out_gg(x1, x2)
U62_gg(x1, x2, x3)  =  U62_gg(x1, x2, x3)
lessc146_in_gg(x1, x2)  =  lessc146_in_gg(x1, x2)
lessc146_out_gg(x1, x2)  =  lessc146_out_gg(x1, x2)
U61_gg(x1, x2, x3)  =  U61_gg(x1, x2, x3)
INSERT1_IN_GAG(x1, x2, x3)  =  INSERT1_IN_GAG(x1, x3)
U7_GAG(x1, x2, x3)  =  U7_GAG(x1, x3)
P15_IN_GA(x1, x2)  =  P15_IN_GA(x1)
U2_GA(x1, x2, x3)  =  U2_GA(x1, x3)
LESS17_IN_G(x1)  =  LESS17_IN_G(x1)
U1_G(x1, x2)  =  U1_G(x1, x2)
U3_GA(x1, x2, x3)  =  U3_GA(x1, x3)
U4_GA(x1, x2, x3)  =  U4_GA(x1, x3)
U8_GAG(x1, x2, x3)  =  U8_GAG(x1, x3)
U9_GAG(x1, x2, x3)  =  U9_GAG(x1, x3)
U10_GAG(x1, x2, x3)  =  U10_GAG(x1, x3)
U11_GAG(x1, x2, x3)  =  U11_GAG(x1, x3)
P28_IN_GA(x1, x2)  =  P28_IN_GA(x1)
U5_GA(x1, x2, x3)  =  U5_GA(x1, x3)
U12_GAG(x1, x2, x3)  =  U12_GAG(x1, x3)
U13_GAG(x1, x2, x3)  =  U13_GAG(x1, x3)
U14_GAG(x1, x2, x3)  =  U14_GAG(x1, x3)
U15_GAG(x1, x2, x3, x4, x5)  =  U15_GAG(x1, x3, x4, x5)
U16_GAG(x1, x2, x3, x4, x5)  =  U16_GAG(x1, x3, x4, x5)
U17_GAG(x1, x2, x3, x4, x5)  =  U17_GAG(x1, x3, x4, x5)
U18_GAG(x1, x2, x3, x4, x5)  =  U18_GAG(x1, x2, x4, x5)
U19_GAG(x1, x2, x3, x4, x5)  =  U19_GAG(x1, x2, x4, x5)
U20_GAG(x1, x2, x3, x4, x5)  =  U20_GAG(x1, x2, x4, x5)
U21_GAG(x1, x2, x3, x4, x5)  =  U21_GAG(x1, x2, x4, x5)
U22_GAG(x1, x2, x3, x4, x5)  =  U22_GAG(x1, x2, x4, x5)
U23_GAG(x1, x2, x3, x4, x5)  =  U23_GAG(x1, x2, x4, x5)
U24_GAG(x1, x2, x3, x4, x5)  =  U24_GAG(x1, x3, x4, x5)
U25_GAG(x1, x2, x3, x4, x5, x6)  =  U25_GAG(x1, x2, x4, x5, x6)
LESS146_IN_GG(x1, x2)  =  LESS146_IN_GG(x1, x2)
U6_GG(x1, x2, x3)  =  U6_GG(x1, x2, x3)
U26_GAG(x1, x2, x3, x4, x5, x6)  =  U26_GAG(x1, x2, x4, x5, x6)
U27_GAG(x1, x2, x3, x4, x5, x6)  =  U27_GAG(x1, x2, x4, x5, x6)
U28_GAG(x1, x2, x3, x4, x5, x6)  =  U28_GAG(x1, x2, x3, x5, x6)
U29_GAG(x1, x2, x3, x4, x5, x6)  =  U29_GAG(x1, x2, x3, x5, x6)
U30_GAG(x1, x2, x3, x4, x5, x6)  =  U30_GAG(x1, x2, x3, x5, x6)
U31_GAG(x1, x2, x3, x4, x5)  =  U31_GAG(x1, x2, x4, x5)
U32_GAG(x1, x2, x3, x4, x5, x6)  =  U32_GAG(x1, x2, x3, x5, x6)
U33_GAG(x1, x2, x3, x4, x5, x6)  =  U33_GAG(x1, x2, x3, x5, x6)
U34_GAG(x1, x2, x3, x4, x5, x6)  =  U34_GAG(x1, x2, x3, x5, x6)

We have to consider all (P,R,Pi)-chains

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 42 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(8) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(10) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • LESS146_IN_GG(s(T332), s(T333)) → LESS146_IN_GG(T332, T333)
    The graph contains the following edges 1 > 1, 2 > 2

(13) YES

(14) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(15) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(17) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(18) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(19) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • LESS17_IN_G(s(T30)) → LESS17_IN_G(T30)
    The graph contains the following edges 1 > 1

(20) YES

(21) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

INSERT1_IN_GAG(s(T155), tree(s(T155), T150, T148), tree(s(T155), T149, T148)) → U16_GAG(T155, T150, T148, T149, lessc17_in_g(T155))
U16_GAG(T155, T150, T148, T149, lessc17_out_g(T155)) → INSERT1_IN_GAG(s(T155), T150, T149)
INSERT1_IN_GAG(T170, tree(T170, T172, T175), tree(T170, T172, T174)) → U19_GAG(T170, T172, T175, T174, lessc17_in_g(T170))
U19_GAG(T170, T172, T175, T174, lessc17_out_g(T170)) → INSERT1_IN_GAG(T170, T175, T174)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T190), tree(s(T193), T187, T189)) → U22_GAG(T193, T187, T190, T189, lessc17_in_g(T193))
U22_GAG(T193, T187, T190, T189, lessc17_out_g(T193)) → INSERT1_IN_GAG(s(T193), T190, T189)
INSERT1_IN_GAG(s(T222), tree(s(T223), T208, T206), tree(s(T223), T207, T206)) → U26_GAG(T222, T223, T208, T206, T207, lessc88_in_gg(T222, T223))
U26_GAG(T222, T223, T208, T206, T207, lessc88_out_gg(T222, T223)) → INSERT1_IN_GAG(s(T222), T208, T207)
INSERT1_IN_GAG(T348, tree(T349, T350, T353), tree(T349, T350, T352)) → U29_GAG(T348, T349, T350, T353, T352, lessc146_in_gg(T349, T348))
U29_GAG(T348, T349, T350, T353, T352, lessc146_out_gg(T349, T348)) → INSERT1_IN_GAG(T348, T353, T352)
INSERT1_IN_GAG(0, tree(s(T213), T208, T206), tree(s(T213), T207, T206)) → INSERT1_IN_GAG(0, T208, T207)
INSERT1_IN_GAG(s(T375), tree(0, T367, T370), tree(0, T367, T369)) → INSERT1_IN_GAG(s(T375), T370, T369)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T370), tree(s(T382), T367, T369)) → U33_GAG(T383, T382, T367, T370, T369, lessc146_in_gg(T382, T383))
U33_GAG(T383, T382, T367, T370, T369, lessc146_out_gg(T382, T383)) → INSERT1_IN_GAG(s(T383), T370, T369)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
tree(x1, x2, x3)  =  tree(x1, x2, x3)
lessc17_in_g(x1)  =  lessc17_in_g(x1)
U57_g(x1, x2)  =  U57_g(x1, x2)
lessc17_out_g(x1)  =  lessc17_out_g(x1)
0  =  0
lessc88_in_gg(x1, x2)  =  lessc88_in_gg(x1, x2)
lessc88_out_gg(x1, x2)  =  lessc88_out_gg(x1, x2)
U62_gg(x1, x2, x3)  =  U62_gg(x1, x2, x3)
lessc146_in_gg(x1, x2)  =  lessc146_in_gg(x1, x2)
lessc146_out_gg(x1, x2)  =  lessc146_out_gg(x1, x2)
U61_gg(x1, x2, x3)  =  U61_gg(x1, x2, x3)
INSERT1_IN_GAG(x1, x2, x3)  =  INSERT1_IN_GAG(x1, x3)
U16_GAG(x1, x2, x3, x4, x5)  =  U16_GAG(x1, x3, x4, x5)
U19_GAG(x1, x2, x3, x4, x5)  =  U19_GAG(x1, x2, x4, x5)
U22_GAG(x1, x2, x3, x4, x5)  =  U22_GAG(x1, x2, x4, x5)
U26_GAG(x1, x2, x3, x4, x5, x6)  =  U26_GAG(x1, x2, x4, x5, x6)
U29_GAG(x1, x2, x3, x4, x5, x6)  =  U29_GAG(x1, x2, x3, x5, x6)
U33_GAG(x1, x2, x3, x4, x5, x6)  =  U33_GAG(x1, x2, x3, x5, x6)

We have to consider all (P,R,Pi)-chains

(22) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(23) Obligation:

Q DP problem:
The TRS P consists of the following rules:

INSERT1_IN_GAG(s(T155), tree(s(T155), T149, T148)) → U16_GAG(T155, T148, T149, lessc17_in_g(T155))
U16_GAG(T155, T148, T149, lessc17_out_g(T155)) → INSERT1_IN_GAG(s(T155), T149)
INSERT1_IN_GAG(T170, tree(T170, T172, T174)) → U19_GAG(T170, T172, T174, lessc17_in_g(T170))
U19_GAG(T170, T172, T174, lessc17_out_g(T170)) → INSERT1_IN_GAG(T170, T174)
INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T189)) → U22_GAG(T193, T187, T189, lessc17_in_g(T193))
U22_GAG(T193, T187, T189, lessc17_out_g(T193)) → INSERT1_IN_GAG(s(T193), T189)
INSERT1_IN_GAG(s(T222), tree(s(T223), T207, T206)) → U26_GAG(T222, T223, T206, T207, lessc88_in_gg(T222, T223))
U26_GAG(T222, T223, T206, T207, lessc88_out_gg(T222, T223)) → INSERT1_IN_GAG(s(T222), T207)
INSERT1_IN_GAG(T348, tree(T349, T350, T352)) → U29_GAG(T348, T349, T350, T352, lessc146_in_gg(T349, T348))
U29_GAG(T348, T349, T350, T352, lessc146_out_gg(T349, T348)) → INSERT1_IN_GAG(T348, T352)
INSERT1_IN_GAG(0, tree(s(T213), T207, T206)) → INSERT1_IN_GAG(0, T207)
INSERT1_IN_GAG(s(T375), tree(0, T367, T369)) → INSERT1_IN_GAG(s(T375), T369)
INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T369)) → U33_GAG(T383, T382, T367, T369, lessc146_in_gg(T382, T383))
U33_GAG(T383, T382, T367, T369, lessc146_out_gg(T382, T383)) → INSERT1_IN_GAG(s(T383), T369)

The TRS R consists of the following rules:

lessc17_in_g(s(T30)) → U57_g(T30, lessc17_in_g(T30))
U57_g(T30, lessc17_out_g(T30)) → lessc17_out_g(s(T30))
lessc88_in_gg(0, s(T232)) → lessc88_out_gg(0, s(T232))
lessc88_in_gg(s(0), s(s(T245))) → lessc88_out_gg(s(0), s(s(T245)))
lessc88_in_gg(s(s(0)), s(s(s(T258)))) → lessc88_out_gg(s(s(0)), s(s(s(T258))))
lessc88_in_gg(s(s(s(0))), s(s(s(s(T271))))) → lessc88_out_gg(s(s(s(0))), s(s(s(s(T271)))))
lessc88_in_gg(s(s(s(s(0)))), s(s(s(s(s(T284)))))) → lessc88_out_gg(s(s(s(s(0)))), s(s(s(s(s(T284))))))
lessc88_in_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297))))))) → lessc88_out_gg(s(s(s(s(s(0))))), s(s(s(s(s(s(T297)))))))
lessc88_in_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310)))))))) → lessc88_out_gg(s(s(s(s(s(s(0)))))), s(s(s(s(s(s(s(T310))))))))
lessc88_in_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316)))))))) → U62_gg(T315, T316, lessc146_in_gg(T315, T316))
lessc146_in_gg(0, s(T327)) → lessc146_out_gg(0, s(T327))
lessc146_in_gg(s(T332), s(T333)) → U61_gg(T332, T333, lessc146_in_gg(T332, T333))
U61_gg(T332, T333, lessc146_out_gg(T332, T333)) → lessc146_out_gg(s(T332), s(T333))
U62_gg(T315, T316, lessc146_out_gg(T315, T316)) → lessc88_out_gg(s(s(s(s(s(s(s(T315))))))), s(s(s(s(s(s(s(T316))))))))

The set Q consists of the following terms:

lessc17_in_g(x0)
U57_g(x0, x1)
lessc88_in_gg(x0, x1)
lessc146_in_gg(x0, x1)
U61_gg(x0, x1, x2)
U62_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(24) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • U16_GAG(T155, T148, T149, lessc17_out_g(T155)) → INSERT1_IN_GAG(s(T155), T149)
    The graph contains the following edges 3 >= 2

  • INSERT1_IN_GAG(s(T375), tree(0, T367, T369)) → INSERT1_IN_GAG(s(T375), T369)
    The graph contains the following edges 1 >= 1, 2 > 2

  • INSERT1_IN_GAG(s(T155), tree(s(T155), T149, T148)) → U16_GAG(T155, T148, T149, lessc17_in_g(T155))
    The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 2 > 3

  • INSERT1_IN_GAG(0, tree(s(T213), T207, T206)) → INSERT1_IN_GAG(0, T207)
    The graph contains the following edges 1 >= 1, 2 > 2

  • U19_GAG(T170, T172, T174, lessc17_out_g(T170)) → INSERT1_IN_GAG(T170, T174)
    The graph contains the following edges 1 >= 1, 4 > 1, 3 >= 2

  • INSERT1_IN_GAG(T170, tree(T170, T172, T174)) → U19_GAG(T170, T172, T174, lessc17_in_g(T170))
    The graph contains the following edges 1 >= 1, 2 > 1, 2 > 2, 2 > 3

  • U22_GAG(T193, T187, T189, lessc17_out_g(T193)) → INSERT1_IN_GAG(s(T193), T189)
    The graph contains the following edges 3 >= 2

  • INSERT1_IN_GAG(s(T193), tree(s(T193), T187, T189)) → U22_GAG(T193, T187, T189, lessc17_in_g(T193))
    The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 2 > 3

  • U26_GAG(T222, T223, T206, T207, lessc88_out_gg(T222, T223)) → INSERT1_IN_GAG(s(T222), T207)
    The graph contains the following edges 4 >= 2

  • INSERT1_IN_GAG(s(T222), tree(s(T223), T207, T206)) → U26_GAG(T222, T223, T206, T207, lessc88_in_gg(T222, T223))
    The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 2 > 4

  • U29_GAG(T348, T349, T350, T352, lessc146_out_gg(T349, T348)) → INSERT1_IN_GAG(T348, T352)
    The graph contains the following edges 1 >= 1, 5 > 1, 4 >= 2

  • U33_GAG(T383, T382, T367, T369, lessc146_out_gg(T382, T383)) → INSERT1_IN_GAG(s(T383), T369)
    The graph contains the following edges 4 >= 2

  • INSERT1_IN_GAG(T348, tree(T349, T350, T352)) → U29_GAG(T348, T349, T350, T352, lessc146_in_gg(T349, T348))
    The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 2 > 4

  • INSERT1_IN_GAG(s(T383), tree(s(T382), T367, T369)) → U33_GAG(T383, T382, T367, T369, lessc146_in_gg(T382, T383))
    The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 2 > 4

(25) YES