/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern color_map(a,g) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) TransformationProof [SOUND, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) PiDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) PiDP (26) PiDP (27) UsableRulesProof [EQUIVALENT, 0 ms] (28) PiDP (29) PrologToPiTRSProof [SOUND, 0 ms] (30) PiTRS (31) DependencyPairsProof [EQUIVALENT, 0 ms] (32) PiDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) AND (35) PiDP (36) UsableRulesProof [EQUIVALENT, 0 ms] (37) PiDP (38) PiDPToQDPProof [SOUND, 0 ms] (39) QDP (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] (41) YES (42) PiDP (43) UsableRulesProof [EQUIVALENT, 0 ms] (44) PiDP (45) PiDPToQDPProof [SOUND, 0 ms] (46) QDP (47) TransformationProof [SOUND, 0 ms] (48) QDP (49) TransformationProof [EQUIVALENT, 0 ms] (50) QDP (51) NonTerminationLoopProof [COMPLETE, 0 ms] (52) NO (53) PiDP (54) UsableRulesProof [EQUIVALENT, 0 ms] (55) PiDP (56) PiDPToQDPProof [SOUND, 0 ms] (57) QDP (58) QDPSizeChangeProof [EQUIVALENT, 0 ms] (59) YES (60) PiDP (61) UsableRulesProof [EQUIVALENT, 0 ms] (62) PiDP (63) PiDPToQDPProof [SOUND, 1 ms] (64) QDP (65) PrologToTRSTransformerProof [SOUND, 30 ms] (66) QTRS (67) DependencyPairsProof [EQUIVALENT, 0 ms] (68) QDP (69) DependencyGraphProof [EQUIVALENT, 0 ms] (70) AND (71) QDP (72) UsableRulesProof [EQUIVALENT, 0 ms] (73) QDP (74) QDPSizeChangeProof [EQUIVALENT, 0 ms] (75) YES (76) QDP (77) NonTerminationLoopProof [COMPLETE, 12 ms] (78) NO (79) QDP (80) UsableRulesProof [EQUIVALENT, 0 ms] (81) QDP (82) QDPSizeChangeProof [EQUIVALENT, 0 ms] (83) YES (84) QDP (85) NonTerminationLoopProof [COMPLETE, 0 ms] (86) NO (87) PrologToDTProblemTransformerProof [SOUND, 41 ms] (88) TRIPLES (89) TriplesToPiDPProof [SOUND, 13 ms] (90) PiDP (91) DependencyGraphProof [EQUIVALENT, 0 ms] (92) AND (93) PiDP (94) UsableRulesProof [EQUIVALENT, 0 ms] (95) PiDP (96) PiDPToQDPProof [SOUND, 0 ms] (97) QDP (98) QDPSizeChangeProof [EQUIVALENT, 0 ms] (99) YES (100) PiDP (101) UsableRulesProof [EQUIVALENT, 0 ms] (102) PiDP (103) PiDPToQDPProof [SOUND, 0 ms] (104) QDP (105) TransformationProof [SOUND, 0 ms] (106) QDP (107) TransformationProof [EQUIVALENT, 0 ms] (108) QDP (109) PiDP (110) UsableRulesProof [EQUIVALENT, 0 ms] (111) PiDP (112) PiDP (113) PrologToIRSwTTransformerProof [SOUND, 30 ms] (114) AND (115) IRSwT (116) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (117) TRUE (118) IRSwT (119) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (120) TRUE (121) IRSwT (122) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (123) IRSwT (124) IntTRSCompressionProof [EQUIVALENT, 20 ms] (125) IRSwT (126) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (127) IRSwT (128) IRSwTTerminationDigraphProof [EQUIVALENT, 6 ms] (129) IRSwT (130) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 18 ms] (131) IRSwT (132) TempFilterProof [SOUND, 4 ms] (133) IRSwT (134) IRSwTToQDPProof [SOUND, 0 ms] (135) QDP (136) QDPSizeChangeProof [EQUIVALENT, 0 ms] (137) YES (138) IRSwT (139) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (140) IRSwT (141) IntTRSCompressionProof [EQUIVALENT, 26 ms] (142) IRSwT (143) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (144) IRSwT (145) IRSwTTerminationDigraphProof [EQUIVALENT, 65 ms] (146) IRSwT (147) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (148) IRSwT (149) IRSwTToIntTRSProof [SOUND, 24 ms] (150) IRSwT ---------------------------------------- (0) Obligation: Clauses: color_map(.(Region, Regions), Colors) :- ','(color_region(Region, Colors), color_map(Regions, Colors)). color_map([], Colors). color_region(region(Name, Color, Neighbors), Colors) :- ','(select(Color, Colors, Colors1), members(Neighbors, Colors1)). select(X, .(X, Xs), Xs). select(X, .(Y, Ys), .(Y, Zs)) :- select(X, Ys, Zs). members(.(X, Xs), Ys) :- ','(member(X, Ys), members(Xs, Ys)). members([], Ys). member(X, .(X, X1)). member(X, .(X2, Xs)) :- member(X, Xs). Query: color_map(a,g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: color_map_in_2: (f,b) color_region_in_2: (f,b) select_in_3: (f,b,f) members_in_2: (f,b) member_in_2: (f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem: Pi DP problem: The TRS P consists of the following rules: COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> COLOR_REGION_IN_AG(Region, Colors) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> U3_AG(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> SELECT_IN_AGA(Color, Colors, Colors1) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> U5_AGA(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_AG(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> MEMBERS_IN_AG(Neighbors, Colors1) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) MEMBERS_IN_AG(.(X, Xs), Ys) -> MEMBER_IN_AG(X, Ys) MEMBER_IN_AG(X, .(X2, Xs)) -> U8_AG(X, X2, Xs, member_in_ag(X, Xs)) MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_AG(X, Xs, Ys, members_in_ag(Xs, Ys)) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_AG(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) COLOR_REGION_IN_AG(x1, x2) = COLOR_REGION_IN_AG(x2) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x4, x5) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) U5_AGA(x1, x2, x3, x4, x5) = U5_AGA(x2, x3, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x2, x4, x5) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) U8_AG(x1, x2, x3, x4) = U8_AG(x2, x3, x4) U7_AG(x1, x2, x3, x4) = U7_AG(x1, x3, x4) U2_AG(x1, x2, x3, x4) = U2_AG(x1, x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (4) Obligation: Pi DP problem: The TRS P consists of the following rules: COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> COLOR_REGION_IN_AG(Region, Colors) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> U3_AG(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> SELECT_IN_AGA(Color, Colors, Colors1) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> U5_AGA(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_AG(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> MEMBERS_IN_AG(Neighbors, Colors1) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) MEMBERS_IN_AG(.(X, Xs), Ys) -> MEMBER_IN_AG(X, Ys) MEMBER_IN_AG(X, .(X2, Xs)) -> U8_AG(X, X2, Xs, member_in_ag(X, Xs)) MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_AG(X, Xs, Ys, members_in_ag(Xs, Ys)) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_AG(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) COLOR_REGION_IN_AG(x1, x2) = COLOR_REGION_IN_AG(x2) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x4, x5) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) U5_AGA(x1, x2, x3, x4, x5) = U5_AGA(x2, x3, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x2, x4, x5) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) U8_AG(x1, x2, x3, x4) = U8_AG(x2, x3, x4) U7_AG(x1, x2, x3, x4) = U7_AG(x1, x3, x4) U2_AG(x1, x2, x3, x4) = U2_AG(x1, x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 4 SCCs with 10 less nodes. ---------------------------------------- (6) Complex Obligation (AND) ---------------------------------------- (7) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (8) UsableRulesProof (EQUIVALENT) 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: MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (10) PiDPToQDPProof (SOUND) 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: MEMBER_IN_AG(.(X2, Xs)) -> MEMBER_IN_AG(Xs) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (12) QDPSizeChangeProof (EQUIVALENT) 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: *MEMBER_IN_AG(.(X2, Xs)) -> MEMBER_IN_AG(Xs) The graph contains the following edges 1 > 1 ---------------------------------------- (13) YES ---------------------------------------- (14) Obligation: Pi DP problem: The TRS P consists of the following rules: U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (15) UsableRulesProof (EQUIVALENT) 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: U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) The TRS R consists of the following rules: member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (17) PiDPToQDPProof (SOUND) 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: U6_AG(Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Ys) MEMBERS_IN_AG(Ys) -> U6_AG(Ys, member_in_ag(Ys)) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(.(X2, Xs)) -> U8_ag(X2, Xs, member_in_ag(Xs)) U8_ag(X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (19) TransformationProof (SOUND) By narrowing [LPAR04] the rule MEMBERS_IN_AG(Ys) -> U6_AG(Ys, member_in_ag(Ys)) at position [1] we obtained the following new rules [LPAR04]: (MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0, .(x0, x1))),MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0, .(x0, x1)))) (MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(x0, x1, member_in_ag(x1))),MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(x0, x1, member_in_ag(x1)))) ---------------------------------------- (20) Obligation: Q DP problem: The TRS P consists of the following rules: U6_AG(Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Ys) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0, .(x0, x1))) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(x0, x1, member_in_ag(x1))) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(.(X2, Xs)) -> U8_ag(X2, Xs, member_in_ag(Xs)) U8_ag(X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (21) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U6_AG(Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Ys) we obtained the following new rules [LPAR04]: (U6_AG(.(z0, z1), member_out_ag(z0, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1)),U6_AG(.(z0, z1), member_out_ag(z0, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1))) (U6_AG(.(z0, z1), member_out_ag(x1, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1)),U6_AG(.(z0, z1), member_out_ag(x1, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1))) ---------------------------------------- (22) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0, .(x0, x1))) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(x0, x1, member_in_ag(x1))) U6_AG(.(z0, z1), member_out_ag(z0, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1)) U6_AG(.(z0, z1), member_out_ag(x1, .(z0, z1))) -> MEMBERS_IN_AG(.(z0, z1)) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(.(X2, Xs)) -> U8_ag(X2, Xs, member_in_ag(Xs)) U8_ag(X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (23) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (24) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (25) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (26) Obligation: Pi DP problem: The TRS P consists of the following rules: U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x3, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1, x2) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (27) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (28) Obligation: Pi DP problem: The TRS P consists of the following rules: U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) The TRS R consists of the following rules: color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The argument filtering Pi contains the following mapping: color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x4, x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x2, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x3, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x4, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1, x2) U8_ag(x1, x2, x3, x4) = U8_ag(x2, x3, x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x3, x4) members_out_ag(x1, x2) = members_out_ag(x1, x2) color_region_out_ag(x1, x2) = color_region_out_ag(x1, x2) region(x1, x2, x3) = region(x2, x3) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (29) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: color_map_in_2: (f,b) color_region_in_2: (f,b) select_in_3: (f,b,f) members_in_2: (f,b) member_in_2: (f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (30) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) ---------------------------------------- (31) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem: Pi DP problem: The TRS P consists of the following rules: COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> COLOR_REGION_IN_AG(Region, Colors) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> U3_AG(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> SELECT_IN_AGA(Color, Colors, Colors1) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> U5_AGA(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_AG(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> MEMBERS_IN_AG(Neighbors, Colors1) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) MEMBERS_IN_AG(.(X, Xs), Ys) -> MEMBER_IN_AG(X, Ys) MEMBER_IN_AG(X, .(X2, Xs)) -> U8_AG(X, X2, Xs, member_in_ag(X, Xs)) MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_AG(X, Xs, Ys, members_in_ag(Xs, Ys)) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_AG(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) COLOR_REGION_IN_AG(x1, x2) = COLOR_REGION_IN_AG(x2) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x5) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) U5_AGA(x1, x2, x3, x4, x5) = U5_AGA(x2, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x2, x5) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) U8_AG(x1, x2, x3, x4) = U8_AG(x4) U7_AG(x1, x2, x3, x4) = U7_AG(x1, x4) U2_AG(x1, x2, x3, x4) = U2_AG(x1, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (32) Obligation: Pi DP problem: The TRS P consists of the following rules: COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> COLOR_REGION_IN_AG(Region, Colors) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> U3_AG(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) COLOR_REGION_IN_AG(region(Name, Color, Neighbors), Colors) -> SELECT_IN_AGA(Color, Colors, Colors1) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> U5_AGA(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_AG(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) U3_AG(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> MEMBERS_IN_AG(Neighbors, Colors1) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) MEMBERS_IN_AG(.(X, Xs), Ys) -> MEMBER_IN_AG(X, Ys) MEMBER_IN_AG(X, .(X2, Xs)) -> U8_AG(X, X2, Xs, member_in_ag(X, Xs)) MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_AG(X, Xs, Ys, members_in_ag(Xs, Ys)) U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_AG(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) COLOR_REGION_IN_AG(x1, x2) = COLOR_REGION_IN_AG(x2) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x5) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) U5_AGA(x1, x2, x3, x4, x5) = U5_AGA(x2, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x2, x5) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) U8_AG(x1, x2, x3, x4) = U8_AG(x4) U7_AG(x1, x2, x3, x4) = U7_AG(x1, x4) U2_AG(x1, x2, x3, x4) = U2_AG(x1, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (33) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 4 SCCs with 10 less nodes. ---------------------------------------- (34) Complex Obligation (AND) ---------------------------------------- (35) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (36) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (37) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER_IN_AG(X, .(X2, Xs)) -> MEMBER_IN_AG(X, Xs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBER_IN_AG(x1, x2) = MEMBER_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (38) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (39) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBER_IN_AG(.(X2, Xs)) -> MEMBER_IN_AG(Xs) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (40) QDPSizeChangeProof (EQUIVALENT) 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: *MEMBER_IN_AG(.(X2, Xs)) -> MEMBER_IN_AG(Xs) The graph contains the following edges 1 > 1 ---------------------------------------- (41) YES ---------------------------------------- (42) Obligation: Pi DP problem: The TRS P consists of the following rules: U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (43) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (44) Obligation: Pi DP problem: The TRS P consists of the following rules: U6_AG(X, Xs, Ys, member_out_ag(X, Ys)) -> MEMBERS_IN_AG(Xs, Ys) MEMBERS_IN_AG(.(X, Xs), Ys) -> U6_AG(X, Xs, Ys, member_in_ag(X, Ys)) The TRS R consists of the following rules: member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) MEMBERS_IN_AG(x1, x2) = MEMBERS_IN_AG(x2) U6_AG(x1, x2, x3, x4) = U6_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (45) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (46) Obligation: Q DP problem: The TRS P consists of the following rules: U6_AG(Ys, member_out_ag(X)) -> MEMBERS_IN_AG(Ys) MEMBERS_IN_AG(Ys) -> U6_AG(Ys, member_in_ag(Ys)) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X) member_in_ag(.(X2, Xs)) -> U8_ag(member_in_ag(Xs)) U8_ag(member_out_ag(X)) -> member_out_ag(X) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (47) TransformationProof (SOUND) By narrowing [LPAR04] the rule MEMBERS_IN_AG(Ys) -> U6_AG(Ys, member_in_ag(Ys)) at position [1] we obtained the following new rules [LPAR04]: (MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0)),MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0))) (MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(member_in_ag(x1))),MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(member_in_ag(x1)))) ---------------------------------------- (48) Obligation: Q DP problem: The TRS P consists of the following rules: U6_AG(Ys, member_out_ag(X)) -> MEMBERS_IN_AG(Ys) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0)) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(member_in_ag(x1))) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X) member_in_ag(.(X2, Xs)) -> U8_ag(member_in_ag(Xs)) U8_ag(member_out_ag(X)) -> member_out_ag(X) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (49) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U6_AG(Ys, member_out_ag(X)) -> MEMBERS_IN_AG(Ys) we obtained the following new rules [LPAR04]: (U6_AG(.(z0, z1), member_out_ag(z0)) -> MEMBERS_IN_AG(.(z0, z1)),U6_AG(.(z0, z1), member_out_ag(z0)) -> MEMBERS_IN_AG(.(z0, z1))) (U6_AG(.(z0, z1), member_out_ag(x1)) -> MEMBERS_IN_AG(.(z0, z1)),U6_AG(.(z0, z1), member_out_ag(x1)) -> MEMBERS_IN_AG(.(z0, z1))) ---------------------------------------- (50) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0)) MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), U8_ag(member_in_ag(x1))) U6_AG(.(z0, z1), member_out_ag(z0)) -> MEMBERS_IN_AG(.(z0, z1)) U6_AG(.(z0, z1), member_out_ag(x1)) -> MEMBERS_IN_AG(.(z0, z1)) The TRS R consists of the following rules: member_in_ag(.(X, X1)) -> member_out_ag(X) member_in_ag(.(X2, Xs)) -> U8_ag(member_in_ag(Xs)) U8_ag(member_out_ag(X)) -> member_out_ag(X) The set Q consists of the following terms: member_in_ag(x0) U8_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (51) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by narrowing to the left: s = U6_AG(.(z0, z1), member_out_ag(z0)) evaluates to t =U6_AG(.(z0, z1), member_out_ag(z0)) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence U6_AG(.(z0, z1), member_out_ag(z0)) -> MEMBERS_IN_AG(.(z0, z1)) with rule U6_AG(.(z0', z1'), member_out_ag(z0')) -> MEMBERS_IN_AG(.(z0', z1')) at position [] and matcher [z0' / z0, z1' / z1] MEMBERS_IN_AG(.(z0, z1)) -> U6_AG(.(z0, z1), member_out_ag(z0)) with rule MEMBERS_IN_AG(.(x0, x1)) -> U6_AG(.(x0, x1), member_out_ag(x0)) Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence All these steps are and every following step will be a correct step w.r.t to Q. ---------------------------------------- (52) NO ---------------------------------------- (53) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (54) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (55) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECT_IN_AGA(X, .(Y, Ys), .(Y, Zs)) -> SELECT_IN_AGA(X, Ys, Zs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) SELECT_IN_AGA(x1, x2, x3) = SELECT_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (56) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (57) Obligation: Q DP problem: The TRS P consists of the following rules: SELECT_IN_AGA(.(Y, Ys)) -> SELECT_IN_AGA(Ys) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (58) QDPSizeChangeProof (EQUIVALENT) 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: *SELECT_IN_AGA(.(Y, Ys)) -> SELECT_IN_AGA(Ys) The graph contains the following edges 1 > 1 ---------------------------------------- (59) YES ---------------------------------------- (60) Obligation: Pi DP problem: The TRS P consists of the following rules: U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) The TRS R consists of the following rules: color_map_in_ag(.(Region, Regions), Colors) -> U1_ag(Region, Regions, Colors, color_region_in_ag(Region, Colors)) color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U1_ag(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> U2_ag(Region, Regions, Colors, color_map_in_ag(Regions, Colors)) color_map_in_ag([], Colors) -> color_map_out_ag([], Colors) U2_ag(Region, Regions, Colors, color_map_out_ag(Regions, Colors)) -> color_map_out_ag(.(Region, Regions), Colors) The argument filtering Pi contains the following mapping: color_map_in_ag(x1, x2) = color_map_in_ag(x2) U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4) color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) U2_ag(x1, x2, x3, x4) = U2_ag(x1, x4) color_map_out_ag(x1, x2) = color_map_out_ag(x1) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (61) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (62) Obligation: Pi DP problem: The TRS P consists of the following rules: U1_AG(Region, Regions, Colors, color_region_out_ag(Region, Colors)) -> COLOR_MAP_IN_AG(Regions, Colors) COLOR_MAP_IN_AG(.(Region, Regions), Colors) -> U1_AG(Region, Regions, Colors, color_region_in_ag(Region, Colors)) The TRS R consists of the following rules: color_region_in_ag(region(Name, Color, Neighbors), Colors) -> U3_ag(Name, Color, Neighbors, Colors, select_in_aga(Color, Colors, Colors1)) U3_ag(Name, Color, Neighbors, Colors, select_out_aga(Color, Colors, Colors1)) -> U4_ag(Name, Color, Neighbors, Colors, members_in_ag(Neighbors, Colors1)) select_in_aga(X, .(X, Xs), Xs) -> select_out_aga(X, .(X, Xs), Xs) select_in_aga(X, .(Y, Ys), .(Y, Zs)) -> U5_aga(X, Y, Ys, Zs, select_in_aga(X, Ys, Zs)) U4_ag(Name, Color, Neighbors, Colors, members_out_ag(Neighbors, Colors1)) -> color_region_out_ag(region(Name, Color, Neighbors), Colors) U5_aga(X, Y, Ys, Zs, select_out_aga(X, Ys, Zs)) -> select_out_aga(X, .(Y, Ys), .(Y, Zs)) members_in_ag(.(X, Xs), Ys) -> U6_ag(X, Xs, Ys, member_in_ag(X, Ys)) members_in_ag([], Ys) -> members_out_ag([], Ys) U6_ag(X, Xs, Ys, member_out_ag(X, Ys)) -> U7_ag(X, Xs, Ys, members_in_ag(Xs, Ys)) member_in_ag(X, .(X, X1)) -> member_out_ag(X, .(X, X1)) member_in_ag(X, .(X2, Xs)) -> U8_ag(X, X2, Xs, member_in_ag(X, Xs)) U7_ag(X, Xs, Ys, members_out_ag(Xs, Ys)) -> members_out_ag(.(X, Xs), Ys) U8_ag(X, X2, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(X2, Xs)) The argument filtering Pi contains the following mapping: color_region_in_ag(x1, x2) = color_region_in_ag(x2) U3_ag(x1, x2, x3, x4, x5) = U3_ag(x5) select_in_aga(x1, x2, x3) = select_in_aga(x2) .(x1, x2) = .(x1, x2) select_out_aga(x1, x2, x3) = select_out_aga(x1, x3) U5_aga(x1, x2, x3, x4, x5) = U5_aga(x2, x5) U4_ag(x1, x2, x3, x4, x5) = U4_ag(x2, x5) members_in_ag(x1, x2) = members_in_ag(x2) U6_ag(x1, x2, x3, x4) = U6_ag(x3, x4) member_in_ag(x1, x2) = member_in_ag(x2) member_out_ag(x1, x2) = member_out_ag(x1) U8_ag(x1, x2, x3, x4) = U8_ag(x4) U7_ag(x1, x2, x3, x4) = U7_ag(x1, x4) members_out_ag(x1, x2) = members_out_ag(x1) color_region_out_ag(x1, x2) = color_region_out_ag(x1) region(x1, x2, x3) = region(x2, x3) COLOR_MAP_IN_AG(x1, x2) = COLOR_MAP_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (63) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (64) Obligation: Q DP problem: The TRS P consists of the following rules: U1_AG(Colors, color_region_out_ag(Region)) -> COLOR_MAP_IN_AG(Colors) COLOR_MAP_IN_AG(Colors) -> U1_AG(Colors, color_region_in_ag(Colors)) The TRS R consists of the following rules: color_region_in_ag(Colors) -> U3_ag(select_in_aga(Colors)) U3_ag(select_out_aga(Color, Colors1)) -> U4_ag(Color, members_in_ag(Colors1)) select_in_aga(.(X, Xs)) -> select_out_aga(X, Xs) select_in_aga(.(Y, Ys)) -> U5_aga(Y, select_in_aga(Ys)) U4_ag(Color, members_out_ag(Neighbors)) -> color_region_out_ag(region(Color, Neighbors)) U5_aga(Y, select_out_aga(X, Zs)) -> select_out_aga(X, .(Y, Zs)) members_in_ag(Ys) -> U6_ag(Ys, member_in_ag(Ys)) members_in_ag(Ys) -> members_out_ag([]) U6_ag(Ys, member_out_ag(X)) -> U7_ag(X, members_in_ag(Ys)) member_in_ag(.(X, X1)) -> member_out_ag(X) member_in_ag(.(X2, Xs)) -> U8_ag(member_in_ag(Xs)) U7_ag(X, members_out_ag(Xs)) -> members_out_ag(.(X, Xs)) U8_ag(member_out_ag(X)) -> member_out_ag(X) The set Q consists of the following terms: color_region_in_ag(x0) U3_ag(x0) select_in_aga(x0) U4_ag(x0, x1) U5_aga(x0, x1) members_in_ag(x0) U6_ag(x0, x1) member_in_ag(x0) U7_ag(x0, x1) U8_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (65) PrologToTRSTransformerProof (SOUND) Transformed Prolog program to TRS. { "root": 2, "program": { "directives": [], "clauses": [ [ "(color_map (. Region Regions) Colors)", "(',' (color_region Region Colors) (color_map Regions Colors))" ], [ "(color_map ([]) Colors)", null ], [ "(color_region (region Name Color Neighbors) Colors)", "(',' (select Color Colors Colors1) (members Neighbors Colors1))" ], [ "(select X (. X Xs) Xs)", null ], [ "(select X (. Y Ys) (. Y Zs))", "(select X Ys Zs)" ], [ "(members (. X Xs) Ys)", "(',' (member X Ys) (members Xs Ys))" ], [ "(members ([]) Ys)", null ], [ "(member X (. X X1))", null ], [ "(member X (. X2 Xs))", "(member X Xs)" ] ] }, "graph": { "nodes": { "45": { "goal": [{ "clause": 0, "scope": 1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "46": { "goal": [{ "clause": 1, "scope": 1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "47": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (color_region T18 T17) (color_map T19 T17))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "48": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "392": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member T95 T94) (members T96 T94))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "394": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "352": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "451": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "452": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "354": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "453": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "179": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_region T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "355": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "454": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "356": { "goal": [ { "clause": 3, "scope": 3, "term": "(select T41 T40 X41)" }, { "clause": 4, "scope": 3, "term": "(select T41 T40 X41)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "455": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "357": { "goal": [{ "clause": 3, "scope": 3, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "456": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "358": { "goal": [{ "clause": 4, "scope": 3, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "359": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "338": { "goal": [{ "clause": 2, "scope": 2, "term": "(color_region T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "437": { "goal": [ { "clause": 7, "scope": 5, "term": "(member T95 T94)" }, { "clause": 8, "scope": 5, "term": "(member T95 T94)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "438": { "goal": [{ "clause": 7, "scope": 5, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "439": { "goal": [{ "clause": 8, "scope": 5, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "180": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T24 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "360": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "361": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "385": { "goal": [ { "clause": 5, "scope": 4, "term": "(members T48 T47)" }, { "clause": 6, "scope": 4, "term": "(members T48 T47)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "364": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T72 T71 X74)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T71"], "free": ["X74"], "exprvars": [] } }, "2": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "365": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "387": { "goal": [{ "clause": 5, "scope": 4, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "442": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "443": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "389": { "goal": [{ "clause": 6, "scope": 4, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "444": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "5": { "goal": [ { "clause": 0, "scope": 1, "term": "(color_map T1 T2)" }, { "clause": 1, "scope": 1, "term": "(color_map T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "425": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "349": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (select T41 T40 X41) (members T42 X41))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "426": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T101 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "448": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T125 T124)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T124"], "free": [], "exprvars": [] } }, "449": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 2, "to": 5, "label": "CASE" }, { "from": 5, "to": 45, "label": "PARALLEL" }, { "from": 5, "to": 46, "label": "PARALLEL" }, { "from": 45, "to": 47, "label": "EVAL with clause\ncolor_map(.(X15, X16), X17) :- ','(color_region(X15, X17), color_map(X16, X17)).\nand substitutionX15 -> T18,\nX16 -> T19,\nT1 -> .(T18, T19),\nT2 -> T17,\nX17 -> T17,\nT15 -> T18,\nT16 -> T19" }, { "from": 45, "to": 48, "label": "EVAL-BACKTRACK" }, { "from": 46, "to": 454, "label": "EVAL with clause\ncolor_map([], X139).\nand substitutionT1 -> [],\nT2 -> T141,\nX139 -> T141" }, { "from": 46, "to": 455, "label": "EVAL-BACKTRACK" }, { "from": 47, "to": 179, "label": "SPLIT 1" }, { "from": 47, "to": 180, "label": "SPLIT 2\nnew knowledge:\nT17 is ground\nreplacements:T19 -> T24" }, { "from": 179, "to": 338, "label": "CASE" }, { "from": 180, "to": 2, "label": "INSTANCE with matching:\nT1 -> T24\nT2 -> T17" }, { "from": 338, "to": 349, "label": "EVAL with clause\ncolor_region(region(X37, X38, X39), X40) :- ','(select(X38, X40, X41), members(X39, X41)).\nand substitutionX37 -> T37,\nX38 -> T41,\nX39 -> T42,\nT18 -> region(T37, T41, T42),\nT17 -> T40,\nX40 -> T40,\nT38 -> T41,\nT39 -> T42" }, { "from": 338, "to": 352, "label": "EVAL-BACKTRACK" }, { "from": 349, "to": 354, "label": "SPLIT 1" }, { "from": 349, "to": 355, "label": "SPLIT 2\nnew knowledge:\nT41 is ground\nT40 is ground\nT47 is ground\nreplacements:X41 -> T47,\nT42 -> T48" }, { "from": 354, "to": 356, "label": "CASE" }, { "from": 355, "to": 385, "label": "CASE" }, { "from": 356, "to": 357, "label": "PARALLEL" }, { "from": 356, "to": 358, "label": "PARALLEL" }, { "from": 357, "to": 359, "label": "EVAL with clause\nselect(X58, .(X58, X59), X59).\nand substitutionT41 -> T61,\nX58 -> T61,\nX59 -> T62,\nT40 -> .(T61, T62),\nX41 -> T62" }, { "from": 357, "to": 360, "label": "EVAL-BACKTRACK" }, { "from": 358, "to": 364, "label": "EVAL with clause\nselect(X70, .(X71, X72), .(X71, X73)) :- select(X70, X72, X73).\nand substitutionT41 -> T72,\nX70 -> T72,\nX71 -> T70,\nX72 -> T71,\nT40 -> .(T70, T71),\nX73 -> X74,\nX41 -> .(T70, X74),\nT69 -> T72" }, { "from": 358, "to": 365, "label": "EVAL-BACKTRACK" }, { "from": 359, "to": 361, "label": "SUCCESS" }, { "from": 364, "to": 354, "label": "INSTANCE with matching:\nT41 -> T72\nT40 -> T71\nX41 -> X74" }, { "from": 385, "to": 387, "label": "PARALLEL" }, { "from": 385, "to": 389, "label": "PARALLEL" }, { "from": 387, "to": 392, "label": "EVAL with clause\nmembers(.(X94, X95), X96) :- ','(member(X94, X96), members(X95, X96)).\nand substitutionX94 -> T95,\nX95 -> T96,\nT48 -> .(T95, T96),\nT47 -> T94,\nX96 -> T94,\nT92 -> T95,\nT93 -> T96" }, { "from": 387, "to": 394, "label": "EVAL-BACKTRACK" }, { "from": 389, "to": 451, "label": "EVAL with clause\nmembers([], X133).\nand substitutionT48 -> [],\nT47 -> T135,\nX133 -> T135" }, { "from": 389, "to": 452, "label": "EVAL-BACKTRACK" }, { "from": 392, "to": 425, "label": "SPLIT 1" }, { "from": 392, "to": 426, "label": "SPLIT 2\nnew knowledge:\nT95 is ground\nT94 is ground\nreplacements:T96 -> T101" }, { "from": 425, "to": 437, "label": "CASE" }, { "from": 426, "to": 355, "label": "INSTANCE with matching:\nT48 -> T101\nT47 -> T94" }, { "from": 437, "to": 438, "label": "PARALLEL" }, { "from": 437, "to": 439, "label": "PARALLEL" }, { "from": 438, "to": 442, "label": "EVAL with clause\nmember(X113, .(X113, X114)).\nand substitutionT95 -> T114,\nX113 -> T114,\nX114 -> T115,\nT94 -> .(T114, T115)" }, { "from": 438, "to": 443, "label": "EVAL-BACKTRACK" }, { "from": 439, "to": 448, "label": "EVAL with clause\nmember(X121, .(X122, X123)) :- member(X121, X123).\nand substitutionT95 -> T125,\nX121 -> T125,\nX122 -> T123,\nX123 -> T124,\nT94 -> .(T123, T124),\nT122 -> T125" }, { "from": 439, "to": 449, "label": "EVAL-BACKTRACK" }, { "from": 442, "to": 444, "label": "SUCCESS" }, { "from": 448, "to": 425, "label": "INSTANCE with matching:\nT95 -> T125\nT94 -> T124" }, { "from": 451, "to": 453, "label": "SUCCESS" }, { "from": 454, "to": 456, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (66) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. ---------------------------------------- (67) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (68) Obligation: Q DP problem: The TRS P consists of the following rules: F2_IN(T17) -> U1^1(f47_in(T17), T17) F2_IN(T17) -> F47_IN(T17) F354_IN(.(T70, T71)) -> U2^1(f354_in(T71), .(T70, T71)) F354_IN(.(T70, T71)) -> F354_IN(T71) F355_IN(T94) -> U3^1(f392_in(T94), T94) F355_IN(T94) -> F392_IN(T94) F425_IN(.(T123, T124)) -> U4^1(f425_in(T124), .(T123, T124)) F425_IN(.(T123, T124)) -> F425_IN(T124) F179_IN(T40) -> U5^1(f349_in(T40), T40) F179_IN(T40) -> F349_IN(T40) F47_IN(T17) -> U6^1(f179_in(T17), T17) F47_IN(T17) -> F179_IN(T17) U6^1(f179_out1, T17) -> U7^1(f2_in(T17), T17) U6^1(f179_out1, T17) -> F2_IN(T17) F349_IN(T40) -> U8^1(f354_in(T40), T40) F349_IN(T40) -> F354_IN(T40) U8^1(f354_out1(T41, T47), T40) -> U9^1(f355_in(T47), T40, T41, T47) U8^1(f354_out1(T41, T47), T40) -> F355_IN(T47) F392_IN(T94) -> U10^1(f425_in(T94), T94) F392_IN(T94) -> F425_IN(T94) U10^1(f425_out1(T95), T94) -> U11^1(f355_in(T94), T94, T95) U10^1(f425_out1(T95), T94) -> F355_IN(T94) The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (69) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 4 SCCs with 14 less nodes. ---------------------------------------- (70) Complex Obligation (AND) ---------------------------------------- (71) Obligation: Q DP problem: The TRS P consists of the following rules: F425_IN(.(T123, T124)) -> F425_IN(T124) The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (72) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (73) Obligation: Q DP problem: The TRS P consists of the following rules: F425_IN(.(T123, T124)) -> F425_IN(T124) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (74) QDPSizeChangeProof (EQUIVALENT) 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: *F425_IN(.(T123, T124)) -> F425_IN(T124) The graph contains the following edges 1 > 1 ---------------------------------------- (75) YES ---------------------------------------- (76) Obligation: Q DP problem: The TRS P consists of the following rules: F355_IN(T94) -> F392_IN(T94) F392_IN(T94) -> U10^1(f425_in(T94), T94) U10^1(f425_out1(T95), T94) -> F355_IN(T94) The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (77) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by narrowing to the left: s = F392_IN(.(T114, T115)) evaluates to t =F392_IN(.(T114, T115)) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence F392_IN(.(T114, T115)) -> U10^1(f425_in(.(T114, T115)), .(T114, T115)) with rule F392_IN(T94) -> U10^1(f425_in(T94), T94) at position [] and matcher [T94 / .(T114, T115)] U10^1(f425_in(.(T114, T115)), .(T114, T115)) -> U10^1(f425_out1(T114), .(T114, T115)) with rule f425_in(.(T114', T115')) -> f425_out1(T114') at position [0] and matcher [T114' / T114, T115' / T115] U10^1(f425_out1(T114), .(T114, T115)) -> F355_IN(.(T114, T115)) with rule U10^1(f425_out1(T95), T94') -> F355_IN(T94') at position [] and matcher [T95 / T114, T94' / .(T114, T115)] F355_IN(.(T114, T115)) -> F392_IN(.(T114, T115)) with rule F355_IN(T94) -> F392_IN(T94) Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence All these steps are and every following step will be a correct step w.r.t to Q. ---------------------------------------- (78) NO ---------------------------------------- (79) Obligation: Q DP problem: The TRS P consists of the following rules: F354_IN(.(T70, T71)) -> F354_IN(T71) The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (80) UsableRulesProof (EQUIVALENT) We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R. ---------------------------------------- (81) Obligation: Q DP problem: The TRS P consists of the following rules: F354_IN(.(T70, T71)) -> F354_IN(T71) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (82) QDPSizeChangeProof (EQUIVALENT) 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: *F354_IN(.(T70, T71)) -> F354_IN(T71) The graph contains the following edges 1 > 1 ---------------------------------------- (83) YES ---------------------------------------- (84) Obligation: Q DP problem: The TRS P consists of the following rules: F2_IN(T17) -> F47_IN(T17) F47_IN(T17) -> U6^1(f179_in(T17), T17) U6^1(f179_out1, T17) -> F2_IN(T17) The TRS R consists of the following rules: f2_in(T17) -> U1(f47_in(T17), T17) U1(f47_out1, T17) -> f2_out1 f2_in(T141) -> f2_out1 f354_in(.(T61, T62)) -> f354_out1(T61, T62) f354_in(.(T70, T71)) -> U2(f354_in(T71), .(T70, T71)) U2(f354_out1(T72, X74), .(T70, T71)) -> f354_out1(T72, .(T70, X74)) f355_in(T94) -> U3(f392_in(T94), T94) U3(f392_out1(T95, T96), T94) -> f355_out1(.(T95, T96)) f355_in(T135) -> f355_out1([]) f425_in(.(T114, T115)) -> f425_out1(T114) f425_in(.(T123, T124)) -> U4(f425_in(T124), .(T123, T124)) U4(f425_out1(T125), .(T123, T124)) -> f425_out1(T125) f179_in(T40) -> U5(f349_in(T40), T40) U5(f349_out1(T41, X41, T42), T40) -> f179_out1 f47_in(T17) -> U6(f179_in(T17), T17) U6(f179_out1, T17) -> U7(f2_in(T17), T17) U7(f2_out1, T17) -> f47_out1 f349_in(T40) -> U8(f354_in(T40), T40) U8(f354_out1(T41, T47), T40) -> U9(f355_in(T47), T40, T41, T47) U9(f355_out1(T48), T40, T41, T47) -> f349_out1(T41, T47, T48) f392_in(T94) -> U10(f425_in(T94), T94) U10(f425_out1(T95), T94) -> U11(f355_in(T94), T94, T95) U11(f355_out1(T101), T94, T95) -> f392_out1(T95, T101) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (85) NonTerminationLoopProof (COMPLETE) We used the non-termination processor [FROCOS05] to show that the DP problem is infinite. Found a loop by narrowing to the left: s = F47_IN(.(T61, T62)) evaluates to t =F47_IN(.(T61, T62)) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence F47_IN(.(T61, T62)) -> U6^1(f179_in(.(T61, T62)), .(T61, T62)) with rule F47_IN(T17) -> U6^1(f179_in(T17), T17) at position [] and matcher [T17 / .(T61, T62)] U6^1(f179_in(.(T61, T62)), .(T61, T62)) -> U6^1(U5(f349_in(.(T61, T62)), .(T61, T62)), .(T61, T62)) with rule f179_in(T40') -> U5(f349_in(T40'), T40') at position [0] and matcher [T40' / .(T61, T62)] U6^1(U5(f349_in(.(T61, T62)), .(T61, T62)), .(T61, T62)) -> U6^1(U5(U8(f354_in(.(T61, T62)), .(T61, T62)), .(T61, T62)), .(T61, T62)) with rule f349_in(T40') -> U8(f354_in(T40'), T40') at position [0,0] and matcher [T40' / .(T61, T62)] U6^1(U5(U8(f354_in(.(T61, T62)), .(T61, T62)), .(T61, T62)), .(T61, T62)) -> U6^1(U5(U8(f354_out1(T61, T62), .(T61, T62)), .(T61, T62)), .(T61, T62)) with rule f354_in(.(T61', T62')) -> f354_out1(T61', T62') at position [0,0,0] and matcher [T61' / T61, T62' / T62] U6^1(U5(U8(f354_out1(T61, T62), .(T61, T62)), .(T61, T62)), .(T61, T62)) -> U6^1(U5(U9(f355_in(T62), .(T61, T62), T61, T62), .(T61, T62)), .(T61, T62)) with rule U8(f354_out1(T41, T47'), T40'') -> U9(f355_in(T47'), T40'', T41, T47') at position [0,0] and matcher [T41 / T61, T47' / T62, T40'' / .(T61, T62)] U6^1(U5(U9(f355_in(T62), .(T61, T62), T61, T62), .(T61, T62)), .(T61, T62)) -> U6^1(U5(U9(f355_out1([]), .(T61, T62), T61, T62), .(T61, T62)), .(T61, T62)) with rule f355_in(T135) -> f355_out1([]) at position [0,0,0] and matcher [T135 / T62] U6^1(U5(U9(f355_out1([]), .(T61, T62), T61, T62), .(T61, T62)), .(T61, T62)) -> U6^1(U5(f349_out1(T61, T62, []), .(T61, T62)), .(T61, T62)) with rule U9(f355_out1(T48), T40', T41', T47) -> f349_out1(T41', T47, T48) at position [0,0] and matcher [T48 / [], T40' / .(T61, T62), T41' / T61, T47 / T62] U6^1(U5(f349_out1(T61, T62, []), .(T61, T62)), .(T61, T62)) -> U6^1(f179_out1, .(T61, T62)) with rule U5(f349_out1(T41, X41, T42), T40) -> f179_out1 at position [0] and matcher [T41 / T61, X41 / T62, T42 / [], T40 / .(T61, T62)] U6^1(f179_out1, .(T61, T62)) -> F2_IN(.(T61, T62)) with rule U6^1(f179_out1, T17') -> F2_IN(T17') at position [] and matcher [T17' / .(T61, T62)] F2_IN(.(T61, T62)) -> F47_IN(.(T61, T62)) with rule F2_IN(T17) -> F47_IN(T17) Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence All these steps are and every following step will be a correct step w.r.t to Q. ---------------------------------------- (86) NO ---------------------------------------- (87) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(color_map (. Region Regions) Colors)", "(',' (color_region Region Colors) (color_map Regions Colors))" ], [ "(color_map ([]) Colors)", null ], [ "(color_region (region Name Color Neighbors) Colors)", "(',' (select Color Colors Colors1) (members Neighbors Colors1))" ], [ "(select X (. X Xs) Xs)", null ], [ "(select X (. Y Ys) (. Y Zs))", "(select X Ys Zs)" ], [ "(members (. X Xs) Ys)", "(',' (member X Ys) (members Xs Ys))" ], [ "(members ([]) Ys)", null ], [ "(member X (. X X1))", null ], [ "(member X (. X2 Xs))", "(member X Xs)" ] ] }, "graph": { "nodes": { "49": { "goal": [ { "clause": 0, "scope": 1, "term": "(color_map T1 T2)" }, { "clause": 1, "scope": 1, "term": "(color_map T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "190": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (',' (select T31 T30 X31) (members T32 X31)) (color_map T33 T30))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": ["X31"], "exprvars": [] } }, "192": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "194": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T31 T30 X31)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": ["X31"], "exprvars": [] } }, "470": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "196": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (members T39 T38) (color_map T40 T30))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T30", "T38" ], "free": [], "exprvars": [] } }, "471": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "450": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "472": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "198": { "goal": [ { "clause": 3, "scope": 3, "term": "(select T31 T30 X31)" }, { "clause": 4, "scope": 3, "term": "(select T31 T30 X31)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": ["X31"], "exprvars": [] } }, "473": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "199": { "goal": [{ "clause": 3, "scope": 3, "term": "(select T31 T30 X31)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": ["X31"], "exprvars": [] } }, "432": { "goal": [ { "clause": 5, "scope": 4, "term": "(members T39 T38)" }, { "clause": 6, "scope": 4, "term": "(members T39 T38)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T38"], "free": [], "exprvars": [] } }, "433": { "goal": [{ "clause": 5, "scope": 4, "term": "(members T39 T38)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T38"], "free": [], "exprvars": [] } }, "434": { "goal": [{ "clause": 6, "scope": 4, "term": "(members T39 T38)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T38"], "free": [], "exprvars": [] } }, "435": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member T91 T90) (members T92 T90))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "457": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "436": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "459": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "181": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (color_region T9 T8) (color_map T10 T8))" }, { "clause": 1, "scope": 1, "term": "(color_map T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "182": { "goal": [{ "clause": 1, "scope": 1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [[ "(color_map T1 T2)", "(color_map (. X6 X7) X8)" ]], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [ "X6", "X7", "X8" ], "exprvars": [] } }, "185": { "goal": [ { "clause": 2, "scope": 2, "term": "(',' (color_region T9 T8) (color_map T10 T8))" }, { "clause": -1, "scope": 2, "term": null }, { "clause": 1, "scope": 1, "term": "(color_map T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "362": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T64 T63 X64)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T63"], "free": ["X64"], "exprvars": [] } }, "187": { "goal": [{ "clause": 2, "scope": 2, "term": "(',' (color_region T9 T8) (color_map T10 T8))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "363": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "440": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T91 T90)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "462": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T121 T120)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T120"], "free": [], "exprvars": [] } }, "1": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "188": { "goal": [ { "clause": -1, "scope": 2, "term": null }, { "clause": 1, "scope": 1, "term": "(color_map T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "441": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T97 T90)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "463": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "464": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "201": { "goal": [{ "clause": 4, "scope": 3, "term": "(select T31 T30 X31)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": ["X31"], "exprvars": [] } }, "465": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "466": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "203": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "445": { "goal": [ { "clause": 7, "scope": 5, "term": "(member T91 T90)" }, { "clause": 8, "scope": 5, "term": "(member T91 T90)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "467": { "goal": [{ "clause": 1, "scope": 1, "term": "(color_map T1 T8)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "446": { "goal": [{ "clause": 7, "scope": 5, "term": "(member T91 T90)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "468": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "205": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "447": { "goal": [{ "clause": 8, "scope": 5, "term": "(member T91 T90)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T90"], "free": [], "exprvars": [] } }, "469": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "207": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "427": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T39 T38)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T38"], "free": [], "exprvars": [] } }, "428": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T72 T30)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T30"], "free": [], "exprvars": [] } } }, "edges": [ { "from": 1, "to": 49, "label": "CASE" }, { "from": 49, "to": 181, "label": "EVAL with clause\ncolor_map(.(X6, X7), X8) :- ','(color_region(X6, X8), color_map(X7, X8)).\nand substitutionX6 -> T9,\nX7 -> T10,\nT1 -> .(T9, T10),\nT2 -> T8,\nX8 -> T8,\nT6 -> T9,\nT7 -> T10" }, { "from": 49, "to": 182, "label": "EVAL-BACKTRACK" }, { "from": 181, "to": 185, "label": "CASE" }, { "from": 182, "to": 471, "label": "EVAL with clause\ncolor_map([], X134).\nand substitutionT1 -> [],\nT2 -> T139,\nX134 -> T139" }, { "from": 182, "to": 472, "label": "EVAL-BACKTRACK" }, { "from": 185, "to": 187, "label": "PARALLEL" }, { "from": 185, "to": 188, "label": "PARALLEL" }, { "from": 187, "to": 190, "label": "EVAL with clause\ncolor_region(region(X27, X28, X29), X30) :- ','(select(X28, X30, X31), members(X29, X31)).\nand substitutionX27 -> T27,\nX28 -> T31,\nX29 -> T32,\nT9 -> region(T27, T31, T32),\nT8 -> T30,\nX30 -> T30,\nT28 -> T31,\nT29 -> T32,\nT10 -> T33" }, { "from": 187, "to": 192, "label": "EVAL-BACKTRACK" }, { "from": 188, "to": 467, "label": "FAILURE" }, { "from": 190, "to": 194, "label": "SPLIT 1" }, { "from": 190, "to": 196, "label": "SPLIT 2\nnew knowledge:\nT31 is ground\nT30 is ground\nT38 is ground\nreplacements:X31 -> T38,\nT32 -> T39,\nT33 -> T40" }, { "from": 194, "to": 198, "label": "CASE" }, { "from": 196, "to": 427, "label": "SPLIT 1" }, { "from": 196, "to": 428, "label": "SPLIT 2\nnew knowledge:\nT39 is ground\nT38 is ground\nreplacements:T40 -> T72" }, { "from": 198, "to": 199, "label": "PARALLEL" }, { "from": 198, "to": 201, "label": "PARALLEL" }, { "from": 199, "to": 203, "label": "EVAL with clause\nselect(X48, .(X48, X49), X49).\nand substitutionT31 -> T53,\nX48 -> T53,\nX49 -> T54,\nT30 -> .(T53, T54),\nX31 -> T54" }, { "from": 199, "to": 205, "label": "EVAL-BACKTRACK" }, { "from": 201, "to": 362, "label": "EVAL with clause\nselect(X60, .(X61, X62), .(X61, X63)) :- select(X60, X62, X63).\nand substitutionT31 -> T64,\nX60 -> T64,\nX61 -> T62,\nX62 -> T63,\nT30 -> .(T62, T63),\nX63 -> X64,\nX31 -> .(T62, X64),\nT61 -> T64" }, { "from": 201, "to": 363, "label": "EVAL-BACKTRACK" }, { "from": 203, "to": 207, "label": "SUCCESS" }, { "from": 362, "to": 194, "label": "INSTANCE with matching:\nT31 -> T64\nT30 -> T63\nX31 -> X64" }, { "from": 427, "to": 432, "label": "CASE" }, { "from": 428, "to": 1, "label": "INSTANCE with matching:\nT1 -> T72\nT2 -> T30" }, { "from": 432, "to": 433, "label": "PARALLEL" }, { "from": 432, "to": 434, "label": "PARALLEL" }, { "from": 433, "to": 435, "label": "EVAL with clause\nmembers(.(X87, X88), X89) :- ','(member(X87, X89), members(X88, X89)).\nand substitutionX87 -> T91,\nX88 -> T92,\nT39 -> .(T91, T92),\nT38 -> T90,\nX89 -> T90,\nT88 -> T91,\nT89 -> T92" }, { "from": 433, "to": 436, "label": "EVAL-BACKTRACK" }, { "from": 434, "to": 464, "label": "EVAL with clause\nmembers([], X126).\nand substitutionT39 -> [],\nT38 -> T131,\nX126 -> T131" }, { "from": 434, "to": 465, "label": "EVAL-BACKTRACK" }, { "from": 435, "to": 440, "label": "SPLIT 1" }, { "from": 435, "to": 441, "label": "SPLIT 2\nnew knowledge:\nT91 is ground\nT90 is ground\nreplacements:T92 -> T97" }, { "from": 440, "to": 445, "label": "CASE" }, { "from": 441, "to": 427, "label": "INSTANCE with matching:\nT39 -> T97\nT38 -> T90" }, { "from": 445, "to": 446, "label": "PARALLEL" }, { "from": 445, "to": 447, "label": "PARALLEL" }, { "from": 446, "to": 450, "label": "EVAL with clause\nmember(X106, .(X106, X107)).\nand substitutionT91 -> T110,\nX106 -> T110,\nX107 -> T111,\nT90 -> .(T110, T111)" }, { "from": 446, "to": 457, "label": "EVAL-BACKTRACK" }, { "from": 447, "to": 462, "label": "EVAL with clause\nmember(X114, .(X115, X116)) :- member(X114, X116).\nand substitutionT91 -> T121,\nX114 -> T121,\nX115 -> T119,\nX116 -> T120,\nT90 -> .(T119, T120),\nT118 -> T121" }, { "from": 447, "to": 463, "label": "EVAL-BACKTRACK" }, { "from": 450, "to": 459, "label": "SUCCESS" }, { "from": 462, "to": 440, "label": "INSTANCE with matching:\nT91 -> T121\nT90 -> T120" }, { "from": 464, "to": 466, "label": "SUCCESS" }, { "from": 467, "to": 468, "label": "EVAL with clause\ncolor_map([], X132).\nand substitutionT1 -> [],\nT8 -> T137,\nX132 -> T137" }, { "from": 467, "to": 469, "label": "EVAL-BACKTRACK" }, { "from": 468, "to": 470, "label": "SUCCESS" }, { "from": 471, "to": 473, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (88) Obligation: Triples: selectA(X1, .(X2, X3), .(X2, X4)) :- selectA(X1, X3, X4). membersC(.(X1, X2), X3) :- memberD(X1, X3). membersC(.(X1, X2), X3) :- ','(membercD(X1, X3), membersC(X2, X3)). memberD(X1, .(X2, X3)) :- memberD(X1, X3). color_mapB(.(region(X1, X2, X3), X4), X5) :- selectA(X2, X5, X6). color_mapB(.(region(X1, X2, X3), X4), X5) :- ','(selectcA(X2, X5, X6), membersC(X3, X6)). color_mapB(.(region(X1, X2, X3), X4), X5) :- ','(selectcA(X2, X5, X6), ','(memberscC(X3, X6), color_mapB(X4, X5))). Clauses: selectcA(X1, .(X1, X2), X2). selectcA(X1, .(X2, X3), .(X2, X4)) :- selectcA(X1, X3, X4). color_mapcB(.(region(X1, X2, X3), X4), X5) :- ','(selectcA(X2, X5, X6), ','(memberscC(X3, X6), color_mapcB(X4, X5))). color_mapcB([], X1). color_mapcB([], X1). memberscC(.(X1, X2), X3) :- ','(membercD(X1, X3), memberscC(X2, X3)). memberscC([], X1). membercD(X1, .(X1, X2)). membercD(X1, .(X2, X3)) :- membercD(X1, X3). Afs: color_mapB(x1, x2) = color_mapB(x2) ---------------------------------------- (89) TriplesToPiDPProof (SOUND) We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes: color_mapB_in_2: (f,b) selectA_in_3: (f,b,f) selectcA_in_3: (f,b,f) membersC_in_2: (f,b) memberD_in_2: (f,b) membercD_in_2: (f,b) memberscC_in_2: (f,b) Transforming TRIPLES into the following Term Rewriting System: Pi DP problem: The TRS P consists of the following rules: COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> U6_AG(X1, X2, X3, X4, X5, selectA_in_aga(X2, X5, X6)) COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> SELECTA_IN_AGA(X2, X5, X6) SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> U1_AGA(X1, X2, X3, X4, selectA_in_aga(X1, X3, X4)) SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> SELECTA_IN_AGA(X1, X3, X4) COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> U7_AG(X1, X2, X3, X4, X5, selectcA_in_aga(X2, X5, X6)) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> U8_AG(X1, X2, X3, X4, X5, membersC_in_ag(X3, X6)) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> MEMBERSC_IN_AG(X3, X6) MEMBERSC_IN_AG(.(X1, X2), X3) -> U2_AG(X1, X2, X3, memberD_in_ag(X1, X3)) MEMBERSC_IN_AG(.(X1, X2), X3) -> MEMBERD_IN_AG(X1, X3) MEMBERD_IN_AG(X1, .(X2, X3)) -> U5_AG(X1, X2, X3, memberD_in_ag(X1, X3)) MEMBERD_IN_AG(X1, .(X2, X3)) -> MEMBERD_IN_AG(X1, X3) MEMBERSC_IN_AG(.(X1, X2), X3) -> U3_AG(X1, X2, X3, membercD_in_ag(X1, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> U4_AG(X1, X2, X3, membersC_in_ag(X2, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X2, X3) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> U9_AG(X1, X2, X3, X4, X5, memberscC_in_ag(X3, X6)) U9_AG(X1, X2, X3, X4, X5, memberscC_out_ag(X3, X6)) -> U10_AG(X1, X2, X3, X4, X5, color_mapB_in_ag(X4, X5)) U9_AG(X1, X2, X3, X4, X5, memberscC_out_ag(X3, X6)) -> COLOR_MAPB_IN_AG(X4, X5) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: color_mapB_in_ag(x1, x2) = color_mapB_in_ag(x2) selectA_in_aga(x1, x2, x3) = selectA_in_aga(x2) .(x1, x2) = .(x1, x2) region(x1, x2, x3) = region(x2, x3) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membersC_in_ag(x1, x2) = membersC_in_ag(x2) memberD_in_ag(x1, x2) = memberD_in_ag(x2) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) COLOR_MAPB_IN_AG(x1, x2) = COLOR_MAPB_IN_AG(x2) U6_AG(x1, x2, x3, x4, x5, x6) = U6_AG(x5, x6) SELECTA_IN_AGA(x1, x2, x3) = SELECTA_IN_AGA(x2) U1_AGA(x1, x2, x3, x4, x5) = U1_AGA(x2, x3, x5) U7_AG(x1, x2, x3, x4, x5, x6) = U7_AG(x5, x6) U8_AG(x1, x2, x3, x4, x5, x6) = U8_AG(x5, x6) MEMBERSC_IN_AG(x1, x2) = MEMBERSC_IN_AG(x2) U2_AG(x1, x2, x3, x4) = U2_AG(x3, x4) MEMBERD_IN_AG(x1, x2) = MEMBERD_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x2, x3, x4) U3_AG(x1, x2, x3, x4) = U3_AG(x3, x4) U4_AG(x1, x2, x3, x4) = U4_AG(x3, x4) U9_AG(x1, x2, x3, x4, x5, x6) = U9_AG(x5, x6) U10_AG(x1, x2, x3, x4, x5, x6) = U10_AG(x5, x6) We have to consider all (P,R,Pi)-chains Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES ---------------------------------------- (90) Obligation: Pi DP problem: The TRS P consists of the following rules: COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> U6_AG(X1, X2, X3, X4, X5, selectA_in_aga(X2, X5, X6)) COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> SELECTA_IN_AGA(X2, X5, X6) SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> U1_AGA(X1, X2, X3, X4, selectA_in_aga(X1, X3, X4)) SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> SELECTA_IN_AGA(X1, X3, X4) COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> U7_AG(X1, X2, X3, X4, X5, selectcA_in_aga(X2, X5, X6)) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> U8_AG(X1, X2, X3, X4, X5, membersC_in_ag(X3, X6)) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> MEMBERSC_IN_AG(X3, X6) MEMBERSC_IN_AG(.(X1, X2), X3) -> U2_AG(X1, X2, X3, memberD_in_ag(X1, X3)) MEMBERSC_IN_AG(.(X1, X2), X3) -> MEMBERD_IN_AG(X1, X3) MEMBERD_IN_AG(X1, .(X2, X3)) -> U5_AG(X1, X2, X3, memberD_in_ag(X1, X3)) MEMBERD_IN_AG(X1, .(X2, X3)) -> MEMBERD_IN_AG(X1, X3) MEMBERSC_IN_AG(.(X1, X2), X3) -> U3_AG(X1, X2, X3, membercD_in_ag(X1, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> U4_AG(X1, X2, X3, membersC_in_ag(X2, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X2, X3) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> U9_AG(X1, X2, X3, X4, X5, memberscC_in_ag(X3, X6)) U9_AG(X1, X2, X3, X4, X5, memberscC_out_ag(X3, X6)) -> U10_AG(X1, X2, X3, X4, X5, color_mapB_in_ag(X4, X5)) U9_AG(X1, X2, X3, X4, X5, memberscC_out_ag(X3, X6)) -> COLOR_MAPB_IN_AG(X4, X5) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: color_mapB_in_ag(x1, x2) = color_mapB_in_ag(x2) selectA_in_aga(x1, x2, x3) = selectA_in_aga(x2) .(x1, x2) = .(x1, x2) region(x1, x2, x3) = region(x2, x3) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membersC_in_ag(x1, x2) = membersC_in_ag(x2) memberD_in_ag(x1, x2) = memberD_in_ag(x2) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) COLOR_MAPB_IN_AG(x1, x2) = COLOR_MAPB_IN_AG(x2) U6_AG(x1, x2, x3, x4, x5, x6) = U6_AG(x5, x6) SELECTA_IN_AGA(x1, x2, x3) = SELECTA_IN_AGA(x2) U1_AGA(x1, x2, x3, x4, x5) = U1_AGA(x2, x3, x5) U7_AG(x1, x2, x3, x4, x5, x6) = U7_AG(x5, x6) U8_AG(x1, x2, x3, x4, x5, x6) = U8_AG(x5, x6) MEMBERSC_IN_AG(x1, x2) = MEMBERSC_IN_AG(x2) U2_AG(x1, x2, x3, x4) = U2_AG(x3, x4) MEMBERD_IN_AG(x1, x2) = MEMBERD_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x2, x3, x4) U3_AG(x1, x2, x3, x4) = U3_AG(x3, x4) U4_AG(x1, x2, x3, x4) = U4_AG(x3, x4) U9_AG(x1, x2, x3, x4, x5, x6) = U9_AG(x5, x6) U10_AG(x1, x2, x3, x4, x5, x6) = U10_AG(x5, x6) We have to consider all (P,R,Pi)-chains ---------------------------------------- (91) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 4 SCCs with 10 less nodes. ---------------------------------------- (92) Complex Obligation (AND) ---------------------------------------- (93) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBERD_IN_AG(X1, .(X2, X3)) -> MEMBERD_IN_AG(X1, X3) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) MEMBERD_IN_AG(x1, x2) = MEMBERD_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (94) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (95) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBERD_IN_AG(X1, .(X2, X3)) -> MEMBERD_IN_AG(X1, X3) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBERD_IN_AG(x1, x2) = MEMBERD_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (96) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (97) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBERD_IN_AG(.(X2, X3)) -> MEMBERD_IN_AG(X3) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (98) QDPSizeChangeProof (EQUIVALENT) 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: *MEMBERD_IN_AG(.(X2, X3)) -> MEMBERD_IN_AG(X3) The graph contains the following edges 1 > 1 ---------------------------------------- (99) YES ---------------------------------------- (100) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBERSC_IN_AG(.(X1, X2), X3) -> U3_AG(X1, X2, X3, membercD_in_ag(X1, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X2, X3) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) MEMBERSC_IN_AG(x1, x2) = MEMBERSC_IN_AG(x2) U3_AG(x1, x2, x3, x4) = U3_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (101) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (102) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBERSC_IN_AG(.(X1, X2), X3) -> U3_AG(X1, X2, X3, membercD_in_ag(X1, X3)) U3_AG(X1, X2, X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X2, X3) The TRS R consists of the following rules: membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) MEMBERSC_IN_AG(x1, x2) = MEMBERSC_IN_AG(x2) U3_AG(x1, x2, x3, x4) = U3_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (103) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (104) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBERSC_IN_AG(X3) -> U3_AG(X3, membercD_in_ag(X3)) U3_AG(X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X3) The TRS R consists of the following rules: membercD_in_ag(.(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(.(X2, X3)) -> U18_ag(X2, X3, membercD_in_ag(X3)) U18_ag(X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: membercD_in_ag(x0) U18_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (105) TransformationProof (SOUND) By narrowing [LPAR04] the rule MEMBERSC_IN_AG(X3) -> U3_AG(X3, membercD_in_ag(X3)) at position [1] we obtained the following new rules [LPAR04]: (MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), membercD_out_ag(x0, .(x0, x1))),MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), membercD_out_ag(x0, .(x0, x1)))) (MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), U18_ag(x0, x1, membercD_in_ag(x1))),MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), U18_ag(x0, x1, membercD_in_ag(x1)))) ---------------------------------------- (106) Obligation: Q DP problem: The TRS P consists of the following rules: U3_AG(X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X3) MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), membercD_out_ag(x0, .(x0, x1))) MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), U18_ag(x0, x1, membercD_in_ag(x1))) The TRS R consists of the following rules: membercD_in_ag(.(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(.(X2, X3)) -> U18_ag(X2, X3, membercD_in_ag(X3)) U18_ag(X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: membercD_in_ag(x0) U18_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (107) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U3_AG(X3, membercD_out_ag(X1, X3)) -> MEMBERSC_IN_AG(X3) we obtained the following new rules [LPAR04]: (U3_AG(.(z0, z1), membercD_out_ag(z0, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1)),U3_AG(.(z0, z1), membercD_out_ag(z0, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1))) (U3_AG(.(z0, z1), membercD_out_ag(x1, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1)),U3_AG(.(z0, z1), membercD_out_ag(x1, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1))) ---------------------------------------- (108) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), membercD_out_ag(x0, .(x0, x1))) MEMBERSC_IN_AG(.(x0, x1)) -> U3_AG(.(x0, x1), U18_ag(x0, x1, membercD_in_ag(x1))) U3_AG(.(z0, z1), membercD_out_ag(z0, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1)) U3_AG(.(z0, z1), membercD_out_ag(x1, .(z0, z1))) -> MEMBERSC_IN_AG(.(z0, z1)) The TRS R consists of the following rules: membercD_in_ag(.(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(.(X2, X3)) -> U18_ag(X2, X3, membercD_in_ag(X3)) U18_ag(X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: membercD_in_ag(x0) U18_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (109) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> SELECTA_IN_AGA(X1, X3, X4) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) SELECTA_IN_AGA(x1, x2, x3) = SELECTA_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (110) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (111) Obligation: Pi DP problem: The TRS P consists of the following rules: SELECTA_IN_AGA(X1, .(X2, X3), .(X2, X4)) -> SELECTA_IN_AGA(X1, X3, X4) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) SELECTA_IN_AGA(x1, x2, x3) = SELECTA_IN_AGA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (112) Obligation: Pi DP problem: The TRS P consists of the following rules: COLOR_MAPB_IN_AG(.(region(X1, X2, X3), X4), X5) -> U7_AG(X1, X2, X3, X4, X5, selectcA_in_aga(X2, X5, X6)) U7_AG(X1, X2, X3, X4, X5, selectcA_out_aga(X2, X5, X6)) -> U9_AG(X1, X2, X3, X4, X5, memberscC_in_ag(X3, X6)) U9_AG(X1, X2, X3, X4, X5, memberscC_out_ag(X3, X6)) -> COLOR_MAPB_IN_AG(X4, X5) The TRS R consists of the following rules: selectcA_in_aga(X1, .(X1, X2), X2) -> selectcA_out_aga(X1, .(X1, X2), X2) selectcA_in_aga(X1, .(X2, X3), .(X2, X4)) -> U12_aga(X1, X2, X3, X4, selectcA_in_aga(X1, X3, X4)) U12_aga(X1, X2, X3, X4, selectcA_out_aga(X1, X3, X4)) -> selectcA_out_aga(X1, .(X2, X3), .(X2, X4)) membercD_in_ag(X1, .(X1, X2)) -> membercD_out_ag(X1, .(X1, X2)) membercD_in_ag(X1, .(X2, X3)) -> U18_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U18_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> membercD_out_ag(X1, .(X2, X3)) memberscC_in_ag(.(X1, X2), X3) -> U16_ag(X1, X2, X3, membercD_in_ag(X1, X3)) U16_ag(X1, X2, X3, membercD_out_ag(X1, X3)) -> U17_ag(X1, X2, X3, memberscC_in_ag(X2, X3)) memberscC_in_ag([], X1) -> memberscC_out_ag([], X1) U17_ag(X1, X2, X3, memberscC_out_ag(X2, X3)) -> memberscC_out_ag(.(X1, X2), X3) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) region(x1, x2, x3) = region(x2, x3) selectcA_in_aga(x1, x2, x3) = selectcA_in_aga(x2) selectcA_out_aga(x1, x2, x3) = selectcA_out_aga(x1, x2, x3) U12_aga(x1, x2, x3, x4, x5) = U12_aga(x2, x3, x5) membercD_in_ag(x1, x2) = membercD_in_ag(x2) membercD_out_ag(x1, x2) = membercD_out_ag(x1, x2) U18_ag(x1, x2, x3, x4) = U18_ag(x2, x3, x4) memberscC_in_ag(x1, x2) = memberscC_in_ag(x2) U16_ag(x1, x2, x3, x4) = U16_ag(x3, x4) U17_ag(x1, x2, x3, x4) = U17_ag(x1, x3, x4) memberscC_out_ag(x1, x2) = memberscC_out_ag(x1, x2) COLOR_MAPB_IN_AG(x1, x2) = COLOR_MAPB_IN_AG(x2) U7_AG(x1, x2, x3, x4, x5, x6) = U7_AG(x5, x6) U9_AG(x1, x2, x3, x4, x5, x6) = U9_AG(x5, x6) We have to consider all (P,R,Pi)-chains ---------------------------------------- (113) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 23, "program": { "directives": [], "clauses": [ [ "(color_map (. Region Regions) Colors)", "(',' (color_region Region Colors) (color_map Regions Colors))" ], [ "(color_map ([]) Colors)", null ], [ "(color_region (region Name Color Neighbors) Colors)", "(',' (select Color Colors Colors1) (members Neighbors Colors1))" ], [ "(select X (. X Xs) Xs)", null ], [ "(select X (. Y Ys) (. Y Zs))", "(select X Ys Zs)" ], [ "(members (. X Xs) Ys)", "(',' (member X Ys) (members Xs Ys))" ], [ "(members ([]) Ys)", null ], [ "(member X (. X X1))", null ], [ "(member X (. X2 Xs))", "(member X Xs)" ] ] }, "graph": { "nodes": { "44": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (color_region T18 T17) (color_map T19 T17))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "23": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "24": { "goal": [ { "clause": 0, "scope": 1, "term": "(color_map T1 T2)" }, { "clause": 1, "scope": 1, "term": "(color_map T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "25": { "goal": [{ "clause": 0, "scope": 1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "26": { "goal": [{ "clause": 1, "scope": 1, "term": "(color_map T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "191": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "390": { "goal": [{ "clause": 6, "scope": 4, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "193": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "391": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member T95 T94) (members T96 T94))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "type": "Nodes", "195": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "393": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "372": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "197": { "goal": [ { "clause": 3, "scope": 3, "term": "(select T41 T40 X41)" }, { "clause": 4, "scope": 3, "term": "(select T41 T40 X41)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "430": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "431": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "410": { "goal": [{ "clause": -1, "scope": -1, "term": "(members T101 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "458": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "417": { "goal": [ { "clause": 7, "scope": 5, "term": "(member T95 T94)" }, { "clause": 8, "scope": 5, "term": "(member T95 T94)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "50": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "418": { "goal": [{ "clause": 7, "scope": 5, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "419": { "goal": [{ "clause": 8, "scope": 5, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "183": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_region T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "184": { "goal": [{ "clause": -1, "scope": -1, "term": "(color_map T24 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "460": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "186": { "goal": [{ "clause": 2, "scope": 2, "term": "(color_region T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "461": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "386": { "goal": [ { "clause": 5, "scope": 4, "term": "(members T48 T47)" }, { "clause": 6, "scope": 4, "term": "(members T48 T47)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "189": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (select T41 T40 X41) (members T42 X41))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "200": { "goal": [{ "clause": 3, "scope": 3, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "420": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "388": { "goal": [{ "clause": 5, "scope": 4, "term": "(members T48 T47)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T47"], "free": [], "exprvars": [] } }, "421": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "202": { "goal": [{ "clause": 4, "scope": 3, "term": "(select T41 T40 X41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T40"], "free": ["X41"], "exprvars": [] } }, "422": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "423": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T125 T124)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T124"], "free": [], "exprvars": [] } }, "204": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "369": { "goal": [{ "clause": -1, "scope": -1, "term": "(select T72 T71 X74)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T71"], "free": ["X74"], "exprvars": [] } }, "424": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "403": { "goal": [{ "clause": -1, "scope": -1, "term": "(member T95 T94)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T94"], "free": [], "exprvars": [] } }, "206": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "208": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "429": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 23, "to": 24, "label": "CASE" }, { "from": 24, "to": 25, "label": "PARALLEL" }, { "from": 24, "to": 26, "label": "PARALLEL" }, { "from": 25, "to": 44, "label": "EVAL with clause\ncolor_map(.(X15, X16), X17) :- ','(color_region(X15, X17), color_map(X16, X17)).\nand substitutionX15 -> T18,\nX16 -> T19,\nT1 -> .(T18, T19),\nT2 -> T17,\nX17 -> T17,\nT15 -> T18,\nT16 -> T19" }, { "from": 25, "to": 50, "label": "EVAL-BACKTRACK" }, { "from": 26, "to": 458, "label": "EVAL with clause\ncolor_map([], X139).\nand substitutionT1 -> [],\nT2 -> T141,\nX139 -> T141" }, { "from": 26, "to": 460, "label": "EVAL-BACKTRACK" }, { "from": 44, "to": 183, "label": "SPLIT 1" }, { "from": 44, "to": 184, "label": "SPLIT 2\nnew knowledge:\nT17 is ground\nreplacements:T19 -> T24" }, { "from": 183, "to": 186, "label": "CASE" }, { "from": 184, "to": 23, "label": "INSTANCE with matching:\nT1 -> T24\nT2 -> T17" }, { "from": 186, "to": 189, "label": "EVAL with clause\ncolor_region(region(X37, X38, X39), X40) :- ','(select(X38, X40, X41), members(X39, X41)).\nand substitutionX37 -> T37,\nX38 -> T41,\nX39 -> T42,\nT18 -> region(T37, T41, T42),\nT17 -> T40,\nX40 -> T40,\nT38 -> T41,\nT39 -> T42" }, { "from": 186, "to": 191, "label": "EVAL-BACKTRACK" }, { "from": 189, "to": 193, "label": "SPLIT 1" }, { "from": 189, "to": 195, "label": "SPLIT 2\nnew knowledge:\nT41 is ground\nT40 is ground\nT47 is ground\nreplacements:X41 -> T47,\nT42 -> T48" }, { "from": 193, "to": 197, "label": "CASE" }, { "from": 195, "to": 386, "label": "CASE" }, { "from": 197, "to": 200, "label": "PARALLEL" }, { "from": 197, "to": 202, "label": "PARALLEL" }, { "from": 200, "to": 204, "label": "EVAL with clause\nselect(X58, .(X58, X59), X59).\nand substitutionT41 -> T61,\nX58 -> T61,\nX59 -> T62,\nT40 -> .(T61, T62),\nX41 -> T62" }, { "from": 200, "to": 206, "label": "EVAL-BACKTRACK" }, { "from": 202, "to": 369, "label": "EVAL with clause\nselect(X70, .(X71, X72), .(X71, X73)) :- select(X70, X72, X73).\nand substitutionT41 -> T72,\nX70 -> T72,\nX71 -> T70,\nX72 -> T71,\nT40 -> .(T70, T71),\nX73 -> X74,\nX41 -> .(T70, X74),\nT69 -> T72" }, { "from": 202, "to": 372, "label": "EVAL-BACKTRACK" }, { "from": 204, "to": 208, "label": "SUCCESS" }, { "from": 369, "to": 193, "label": "INSTANCE with matching:\nT41 -> T72\nT40 -> T71\nX41 -> X74" }, { "from": 386, "to": 388, "label": "PARALLEL" }, { "from": 386, "to": 390, "label": "PARALLEL" }, { "from": 388, "to": 391, "label": "EVAL with clause\nmembers(.(X94, X95), X96) :- ','(member(X94, X96), members(X95, X96)).\nand substitutionX94 -> T95,\nX95 -> T96,\nT48 -> .(T95, T96),\nT47 -> T94,\nX96 -> T94,\nT92 -> T95,\nT93 -> T96" }, { "from": 388, "to": 393, "label": "EVAL-BACKTRACK" }, { "from": 390, "to": 429, "label": "EVAL with clause\nmembers([], X133).\nand substitutionT48 -> [],\nT47 -> T135,\nX133 -> T135" }, { "from": 390, "to": 430, "label": "EVAL-BACKTRACK" }, { "from": 391, "to": 403, "label": "SPLIT 1" }, { "from": 391, "to": 410, "label": "SPLIT 2\nnew knowledge:\nT95 is ground\nT94 is ground\nreplacements:T96 -> T101" }, { "from": 403, "to": 417, "label": "CASE" }, { "from": 410, "to": 195, "label": "INSTANCE with matching:\nT48 -> T101\nT47 -> T94" }, { "from": 417, "to": 418, "label": "PARALLEL" }, { "from": 417, "to": 419, "label": "PARALLEL" }, { "from": 418, "to": 420, "label": "EVAL with clause\nmember(X113, .(X113, X114)).\nand substitutionT95 -> T114,\nX113 -> T114,\nX114 -> T115,\nT94 -> .(T114, T115)" }, { "from": 418, "to": 421, "label": "EVAL-BACKTRACK" }, { "from": 419, "to": 423, "label": "EVAL with clause\nmember(X121, .(X122, X123)) :- member(X121, X123).\nand substitutionT95 -> T125,\nX121 -> T125,\nX122 -> T123,\nX123 -> T124,\nT94 -> .(T123, T124),\nT122 -> T125" }, { "from": 419, "to": 424, "label": "EVAL-BACKTRACK" }, { "from": 420, "to": 422, "label": "SUCCESS" }, { "from": 423, "to": 403, "label": "INSTANCE with matching:\nT95 -> T125\nT94 -> T124" }, { "from": 429, "to": 431, "label": "SUCCESS" }, { "from": 458, "to": 461, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (114) Complex Obligation (AND) ---------------------------------------- (115) Obligation: Rules: f423_in(T124) -> f403_in(T124) :|: TRUE f403_out(x) -> f423_out(x) :|: TRUE f418_out(T94) -> f417_out(T94) :|: TRUE f419_out(x1) -> f417_out(x1) :|: TRUE f417_in(x2) -> f418_in(x2) :|: TRUE f417_in(x3) -> f419_in(x3) :|: TRUE f424_out -> f419_out(x4) :|: TRUE f419_in(x5) -> f424_in :|: TRUE f423_out(x6) -> f419_out(.(x7, x6)) :|: TRUE f419_in(.(x8, x9)) -> f423_in(x9) :|: TRUE f417_out(x10) -> f403_out(x10) :|: TRUE f403_in(x11) -> f417_in(x11) :|: TRUE f23_in(T2) -> f24_in(T2) :|: TRUE f24_out(x12) -> f23_out(x12) :|: TRUE f24_in(x13) -> f25_in(x13) :|: TRUE f26_out(x14) -> f24_out(x14) :|: TRUE f25_out(x15) -> f24_out(x15) :|: TRUE f24_in(x16) -> f26_in(x16) :|: TRUE f44_out(T17) -> f25_out(T17) :|: TRUE f25_in(x17) -> f50_in :|: TRUE f25_in(x18) -> f44_in(x18) :|: TRUE f50_out -> f25_out(x19) :|: TRUE f44_in(x20) -> f183_in(x20) :|: TRUE f183_out(x21) -> f184_in(x21) :|: TRUE f184_out(x22) -> f44_out(x22) :|: TRUE f186_out(x23) -> f183_out(x23) :|: TRUE f183_in(x24) -> f186_in(x24) :|: TRUE f186_in(x25) -> f191_in :|: TRUE f186_in(T40) -> f189_in(T40) :|: TRUE f191_out -> f186_out(x26) :|: TRUE f189_out(x27) -> f186_out(x27) :|: TRUE f195_out(x28) -> f189_out(x29) :|: TRUE f189_in(x30) -> f193_in(x30) :|: TRUE f193_out(x31) -> f195_in(x32) :|: TRUE f386_out(T47) -> f195_out(T47) :|: TRUE f195_in(x33) -> f386_in(x33) :|: TRUE f386_in(x34) -> f390_in(x34) :|: TRUE f388_out(x35) -> f386_out(x35) :|: TRUE f386_in(x36) -> f388_in(x36) :|: TRUE f390_out(x37) -> f386_out(x37) :|: TRUE f391_out(x38) -> f388_out(x38) :|: TRUE f388_in(x39) -> f393_in :|: TRUE f388_in(x40) -> f391_in(x40) :|: TRUE f393_out -> f388_out(x41) :|: TRUE f391_in(x42) -> f403_in(x42) :|: TRUE f410_out(x43) -> f391_out(x43) :|: TRUE f403_out(x44) -> f410_in(x44) :|: TRUE Start term: f23_in(T2) ---------------------------------------- (116) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: ---------------------------------------- (117) TRUE ---------------------------------------- (118) Obligation: Rules: f391_out(T94) -> f388_out(T94) :|: TRUE f388_in(T47) -> f393_in :|: TRUE f388_in(x) -> f391_in(x) :|: TRUE f393_out -> f388_out(x1) :|: TRUE f423_in(T124) -> f403_in(T124) :|: TRUE f403_out(x2) -> f423_out(x2) :|: TRUE f420_in -> f420_out :|: TRUE f386_out(x3) -> f195_out(x3) :|: TRUE f195_in(x4) -> f386_in(x4) :|: TRUE f424_out -> f419_out(x5) :|: TRUE f419_in(x6) -> f424_in :|: TRUE f423_out(x7) -> f419_out(.(x8, x7)) :|: TRUE f419_in(.(x9, x10)) -> f423_in(x10) :|: TRUE f417_out(x11) -> f403_out(x11) :|: TRUE f403_in(x12) -> f417_in(x12) :|: TRUE f420_out -> f418_out(.(T114, T115)) :|: TRUE f418_in(.(x13, x14)) -> f420_in :|: TRUE f418_in(x15) -> f421_in :|: TRUE f421_out -> f418_out(x16) :|: TRUE f386_in(x17) -> f390_in(x17) :|: TRUE f388_out(x18) -> f386_out(x18) :|: TRUE f386_in(x19) -> f388_in(x19) :|: TRUE f390_out(x20) -> f386_out(x20) :|: TRUE f391_in(x21) -> f403_in(x21) :|: TRUE f410_out(x22) -> f391_out(x22) :|: TRUE f403_out(x23) -> f410_in(x23) :|: TRUE f418_out(x24) -> f417_out(x24) :|: TRUE f419_out(x25) -> f417_out(x25) :|: TRUE f417_in(x26) -> f418_in(x26) :|: TRUE f417_in(x27) -> f419_in(x27) :|: TRUE f195_out(x28) -> f410_out(x28) :|: TRUE f410_in(x29) -> f195_in(x29) :|: TRUE f23_in(T2) -> f24_in(T2) :|: TRUE f24_out(x30) -> f23_out(x30) :|: TRUE f24_in(x31) -> f25_in(x31) :|: TRUE f26_out(x32) -> f24_out(x32) :|: TRUE f25_out(x33) -> f24_out(x33) :|: TRUE f24_in(x34) -> f26_in(x34) :|: TRUE f44_out(T17) -> f25_out(T17) :|: TRUE f25_in(x35) -> f50_in :|: TRUE f25_in(x36) -> f44_in(x36) :|: TRUE f50_out -> f25_out(x37) :|: TRUE f44_in(x38) -> f183_in(x38) :|: TRUE f183_out(x39) -> f184_in(x39) :|: TRUE f184_out(x40) -> f44_out(x40) :|: TRUE f186_out(x41) -> f183_out(x41) :|: TRUE f183_in(x42) -> f186_in(x42) :|: TRUE f186_in(x43) -> f191_in :|: TRUE f186_in(T40) -> f189_in(T40) :|: TRUE f191_out -> f186_out(x44) :|: TRUE f189_out(x45) -> f186_out(x45) :|: TRUE f195_out(x46) -> f189_out(x47) :|: TRUE f189_in(x48) -> f193_in(x48) :|: TRUE f193_out(x49) -> f195_in(x50) :|: TRUE Start term: f23_in(T2) ---------------------------------------- (119) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: ---------------------------------------- (120) TRUE ---------------------------------------- (121) Obligation: Rules: f193_in(T40) -> f197_in(T40) :|: TRUE f197_out(x) -> f193_out(x) :|: TRUE f202_in(x1) -> f372_in :|: TRUE f372_out -> f202_out(x2) :|: TRUE f369_out(T71) -> f202_out(.(T70, T71)) :|: TRUE f202_in(.(x3, x4)) -> f369_in(x4) :|: TRUE f200_out(x5) -> f197_out(x5) :|: TRUE f197_in(x6) -> f200_in(x6) :|: TRUE f197_in(x7) -> f202_in(x7) :|: TRUE f202_out(x8) -> f197_out(x8) :|: TRUE f193_out(x9) -> f369_out(x9) :|: TRUE f369_in(x10) -> f193_in(x10) :|: TRUE f23_in(T2) -> f24_in(T2) :|: TRUE f24_out(x11) -> f23_out(x11) :|: TRUE f24_in(x12) -> f25_in(x12) :|: TRUE f26_out(x13) -> f24_out(x13) :|: TRUE f25_out(x14) -> f24_out(x14) :|: TRUE f24_in(x15) -> f26_in(x15) :|: TRUE f44_out(T17) -> f25_out(T17) :|: TRUE f25_in(x16) -> f50_in :|: TRUE f25_in(x17) -> f44_in(x17) :|: TRUE f50_out -> f25_out(x18) :|: TRUE f44_in(x19) -> f183_in(x19) :|: TRUE f183_out(x20) -> f184_in(x20) :|: TRUE f184_out(x21) -> f44_out(x21) :|: TRUE f186_out(x22) -> f183_out(x22) :|: TRUE f183_in(x23) -> f186_in(x23) :|: TRUE f186_in(x24) -> f191_in :|: TRUE f186_in(x25) -> f189_in(x25) :|: TRUE f191_out -> f186_out(x26) :|: TRUE f189_out(x27) -> f186_out(x27) :|: TRUE f195_out(x28) -> f189_out(x29) :|: TRUE f189_in(x30) -> f193_in(x30) :|: TRUE f193_out(x31) -> f195_in(x32) :|: TRUE Start term: f23_in(T2) ---------------------------------------- (122) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: intTRSProblem: f193_in(T40) -> f197_in(T40) :|: TRUE f202_in(.(x3, x4)) -> f369_in(x4) :|: TRUE f197_in(x7) -> f202_in(x7) :|: TRUE f369_in(x10) -> f193_in(x10) :|: TRUE ---------------------------------------- (123) Obligation: Rules: f193_in(T40) -> f197_in(T40) :|: TRUE f202_in(.(x3, x4)) -> f369_in(x4) :|: TRUE f197_in(x7) -> f202_in(x7) :|: TRUE f369_in(x10) -> f193_in(x10) :|: TRUE ---------------------------------------- (124) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (125) Obligation: Rules: f193_in(.(x3:0, x4:0)) -> f193_in(x4:0) :|: TRUE ---------------------------------------- (126) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (127) Obligation: Rules: f193_in(.(x3:0, x4:0)) -> f193_in(x4:0) :|: TRUE ---------------------------------------- (128) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f193_in(.(x3:0, x4:0)) -> f193_in(x4:0) :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (129) Obligation: Termination digraph: Nodes: (1) f193_in(.(x3:0, x4:0)) -> f193_in(x4:0) :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (130) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: .(x1, x2) -> .(x2) ---------------------------------------- (131) Obligation: Rules: f193_in(.(x4:0)) -> f193_in(x4:0) :|: TRUE ---------------------------------------- (132) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f193_in(VARIABLE) .(VARIABLE) Removed predefined arithmetic. ---------------------------------------- (133) Obligation: Rules: f193_in(.(x4:0)) -> f193_in(x4:0) ---------------------------------------- (134) IRSwTToQDPProof (SOUND) Removed the integers and created a QDP-Problem. ---------------------------------------- (135) Obligation: Q DP problem: The TRS P consists of the following rules: f193_in(.(x4:0)) -> f193_in(x4:0) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (136) QDPSizeChangeProof (EQUIVALENT) 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: *f193_in(.(x4:0)) -> f193_in(x4:0) The graph contains the following edges 1 > 1 ---------------------------------------- (137) YES ---------------------------------------- (138) Obligation: Rules: f184_in(T17) -> f23_in(T17) :|: TRUE f23_out(x) -> f184_out(x) :|: TRUE f391_out(T94) -> f388_out(T94) :|: TRUE f388_in(T47) -> f393_in :|: TRUE f388_in(x1) -> f391_in(x1) :|: TRUE f393_out -> f388_out(x2) :|: TRUE f186_in(x3) -> f191_in :|: TRUE f186_in(T40) -> f189_in(T40) :|: TRUE f191_out -> f186_out(x4) :|: TRUE f189_out(x5) -> f186_out(x5) :|: TRUE f204_out -> f200_out(.(T61, T62)) :|: TRUE f200_in(.(x6, x7)) -> f204_in :|: TRUE f206_out -> f200_out(x8) :|: TRUE f200_in(x9) -> f206_in :|: TRUE f193_in(x10) -> f197_in(x10) :|: TRUE f197_out(x11) -> f193_out(x11) :|: TRUE f204_in -> f204_out :|: TRUE f430_out -> f390_out(x12) :|: TRUE f390_in(x13) -> f430_in :|: TRUE f429_out -> f390_out(T135) :|: TRUE f390_in(x14) -> f429_in :|: TRUE f418_out(x15) -> f417_out(x15) :|: TRUE f419_out(x16) -> f417_out(x16) :|: TRUE f417_in(x17) -> f418_in(x17) :|: TRUE f417_in(x18) -> f419_in(x18) :|: TRUE f186_out(x19) -> f183_out(x19) :|: TRUE f183_in(x20) -> f186_in(x20) :|: TRUE f195_out(x21) -> f410_out(x21) :|: TRUE f410_in(x22) -> f195_in(x22) :|: TRUE f44_out(x23) -> f25_out(x23) :|: TRUE f25_in(T2) -> f50_in :|: TRUE f25_in(x24) -> f44_in(x24) :|: TRUE f50_out -> f25_out(x25) :|: TRUE f23_in(x26) -> f24_in(x26) :|: TRUE f24_out(x27) -> f23_out(x27) :|: TRUE f202_in(x28) -> f372_in :|: TRUE f372_out -> f202_out(x29) :|: TRUE f369_out(T71) -> f202_out(.(T70, T71)) :|: TRUE f202_in(.(x30, x31)) -> f369_in(x31) :|: TRUE f200_out(x32) -> f197_out(x32) :|: TRUE f197_in(x33) -> f200_in(x33) :|: TRUE f197_in(x34) -> f202_in(x34) :|: TRUE f202_out(x35) -> f197_out(x35) :|: TRUE f193_out(x36) -> f369_out(x36) :|: TRUE f369_in(x37) -> f193_in(x37) :|: TRUE f423_in(T124) -> f403_in(T124) :|: TRUE f403_out(x38) -> f423_out(x38) :|: TRUE f44_in(x39) -> f183_in(x39) :|: TRUE f183_out(x40) -> f184_in(x40) :|: TRUE f184_out(x41) -> f44_out(x41) :|: TRUE f420_in -> f420_out :|: TRUE f386_out(x42) -> f195_out(x42) :|: TRUE f195_in(x43) -> f386_in(x43) :|: TRUE f424_out -> f419_out(x44) :|: TRUE f419_in(x45) -> f424_in :|: TRUE f423_out(x46) -> f419_out(.(x47, x46)) :|: TRUE f419_in(.(x48, x49)) -> f423_in(x49) :|: TRUE f417_out(x50) -> f403_out(x50) :|: TRUE f403_in(x51) -> f417_in(x51) :|: TRUE f429_in -> f429_out :|: TRUE f420_out -> f418_out(.(T114, T115)) :|: TRUE f418_in(.(x52, x53)) -> f420_in :|: TRUE f418_in(x54) -> f421_in :|: TRUE f421_out -> f418_out(x55) :|: TRUE f386_in(x56) -> f390_in(x56) :|: TRUE f388_out(x57) -> f386_out(x57) :|: TRUE f386_in(x58) -> f388_in(x58) :|: TRUE f390_out(x59) -> f386_out(x59) :|: TRUE f391_in(x60) -> f403_in(x60) :|: TRUE f410_out(x61) -> f391_out(x61) :|: TRUE f403_out(x62) -> f410_in(x62) :|: TRUE f24_in(x63) -> f25_in(x63) :|: TRUE f26_out(x64) -> f24_out(x64) :|: TRUE f25_out(x65) -> f24_out(x65) :|: TRUE f24_in(x66) -> f26_in(x66) :|: TRUE f195_out(x67) -> f189_out(x68) :|: TRUE f189_in(x69) -> f193_in(x69) :|: TRUE f193_out(x70) -> f195_in(x71) :|: TRUE Start term: f23_in(T2) ---------------------------------------- (139) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: intTRSProblem: f184_in(T17) -> f23_in(T17) :|: TRUE f391_out(T94) -> f388_out(T94) :|: TRUE f388_in(x1) -> f391_in(x1) :|: TRUE f186_in(T40) -> f189_in(T40) :|: TRUE f189_out(x5) -> f186_out(x5) :|: TRUE f204_out -> f200_out(.(T61, T62)) :|: TRUE f200_in(.(x6, x7)) -> f204_in :|: TRUE f193_in(x10) -> f197_in(x10) :|: TRUE f197_out(x11) -> f193_out(x11) :|: TRUE f204_in -> f204_out :|: TRUE f429_out -> f390_out(T135) :|: TRUE f390_in(x14) -> f429_in :|: TRUE f418_out(x15) -> f417_out(x15) :|: TRUE f419_out(x16) -> f417_out(x16) :|: TRUE f417_in(x17) -> f418_in(x17) :|: TRUE f417_in(x18) -> f419_in(x18) :|: TRUE f186_out(x19) -> f183_out(x19) :|: TRUE f183_in(x20) -> f186_in(x20) :|: TRUE f195_out(x21) -> f410_out(x21) :|: TRUE f410_in(x22) -> f195_in(x22) :|: TRUE f25_in(x24) -> f44_in(x24) :|: TRUE f23_in(x26) -> f24_in(x26) :|: TRUE f369_out(T71) -> f202_out(.(T70, T71)) :|: TRUE f202_in(.(x30, x31)) -> f369_in(x31) :|: TRUE f200_out(x32) -> f197_out(x32) :|: TRUE f197_in(x33) -> f200_in(x33) :|: TRUE f197_in(x34) -> f202_in(x34) :|: TRUE f202_out(x35) -> f197_out(x35) :|: TRUE f193_out(x36) -> f369_out(x36) :|: TRUE f369_in(x37) -> f193_in(x37) :|: TRUE f423_in(T124) -> f403_in(T124) :|: TRUE f403_out(x38) -> f423_out(x38) :|: TRUE f44_in(x39) -> f183_in(x39) :|: TRUE f183_out(x40) -> f184_in(x40) :|: TRUE f420_in -> f420_out :|: TRUE f386_out(x42) -> f195_out(x42) :|: TRUE f195_in(x43) -> f386_in(x43) :|: TRUE f423_out(x46) -> f419_out(.(x47, x46)) :|: TRUE f419_in(.(x48, x49)) -> f423_in(x49) :|: TRUE f417_out(x50) -> f403_out(x50) :|: TRUE f403_in(x51) -> f417_in(x51) :|: TRUE f429_in -> f429_out :|: TRUE f420_out -> f418_out(.(T114, T115)) :|: TRUE f418_in(.(x52, x53)) -> f420_in :|: TRUE f386_in(x56) -> f390_in(x56) :|: TRUE f388_out(x57) -> f386_out(x57) :|: TRUE f386_in(x58) -> f388_in(x58) :|: TRUE f390_out(x59) -> f386_out(x59) :|: TRUE f391_in(x60) -> f403_in(x60) :|: TRUE f410_out(x61) -> f391_out(x61) :|: TRUE f403_out(x62) -> f410_in(x62) :|: TRUE f24_in(x63) -> f25_in(x63) :|: TRUE f195_out(x67) -> f189_out(x68) :|: TRUE f189_in(x69) -> f193_in(x69) :|: TRUE f193_out(x70) -> f195_in(x71) :|: TRUE ---------------------------------------- (140) Obligation: Rules: f184_in(T17) -> f23_in(T17) :|: TRUE f391_out(T94) -> f388_out(T94) :|: TRUE f388_in(x1) -> f391_in(x1) :|: TRUE f186_in(T40) -> f189_in(T40) :|: TRUE f189_out(x5) -> f186_out(x5) :|: TRUE f204_out -> f200_out(.(T61, T62)) :|: TRUE f200_in(.(x6, x7)) -> f204_in :|: TRUE f193_in(x10) -> f197_in(x10) :|: TRUE f197_out(x11) -> f193_out(x11) :|: TRUE f204_in -> f204_out :|: TRUE f429_out -> f390_out(T135) :|: TRUE f390_in(x14) -> f429_in :|: TRUE f418_out(x15) -> f417_out(x15) :|: TRUE f419_out(x16) -> f417_out(x16) :|: TRUE f417_in(x17) -> f418_in(x17) :|: TRUE f417_in(x18) -> f419_in(x18) :|: TRUE f186_out(x19) -> f183_out(x19) :|: TRUE f183_in(x20) -> f186_in(x20) :|: TRUE f195_out(x21) -> f410_out(x21) :|: TRUE f410_in(x22) -> f195_in(x22) :|: TRUE f25_in(x24) -> f44_in(x24) :|: TRUE f23_in(x26) -> f24_in(x26) :|: TRUE f369_out(T71) -> f202_out(.(T70, T71)) :|: TRUE f202_in(.(x30, x31)) -> f369_in(x31) :|: TRUE f200_out(x32) -> f197_out(x32) :|: TRUE f197_in(x33) -> f200_in(x33) :|: TRUE f197_in(x34) -> f202_in(x34) :|: TRUE f202_out(x35) -> f197_out(x35) :|: TRUE f193_out(x36) -> f369_out(x36) :|: TRUE f369_in(x37) -> f193_in(x37) :|: TRUE f423_in(T124) -> f403_in(T124) :|: TRUE f403_out(x38) -> f423_out(x38) :|: TRUE f44_in(x39) -> f183_in(x39) :|: TRUE f183_out(x40) -> f184_in(x40) :|: TRUE f420_in -> f420_out :|: TRUE f386_out(x42) -> f195_out(x42) :|: TRUE f195_in(x43) -> f386_in(x43) :|: TRUE f423_out(x46) -> f419_out(.(x47, x46)) :|: TRUE f419_in(.(x48, x49)) -> f423_in(x49) :|: TRUE f417_out(x50) -> f403_out(x50) :|: TRUE f403_in(x51) -> f417_in(x51) :|: TRUE f429_in -> f429_out :|: TRUE f420_out -> f418_out(.(T114, T115)) :|: TRUE f418_in(.(x52, x53)) -> f420_in :|: TRUE f386_in(x56) -> f390_in(x56) :|: TRUE f388_out(x57) -> f386_out(x57) :|: TRUE f386_in(x58) -> f388_in(x58) :|: TRUE f390_out(x59) -> f386_out(x59) :|: TRUE f391_in(x60) -> f403_in(x60) :|: TRUE f410_out(x61) -> f391_out(x61) :|: TRUE f403_out(x62) -> f410_in(x62) :|: TRUE f24_in(x63) -> f25_in(x63) :|: TRUE f195_out(x67) -> f189_out(x68) :|: TRUE f189_in(x69) -> f193_in(x69) :|: TRUE f193_out(x70) -> f195_in(x71) :|: TRUE ---------------------------------------- (141) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (142) Obligation: Rules: f417_in(.(x48:0, x49:0)) -> f417_in(x49:0) :|: TRUE f193_in(.(x30:0, x31:0)) -> f193_in(x31:0) :|: TRUE f386_in(x58:0) -> f417_in(x58:0) :|: TRUE f386_in(x56:0) -> f386_out(T135:0) :|: TRUE f197_out(x11:0) -> f197_out(.(T70:0, x11:0)) :|: TRUE f386_out(x42:0) -> f386_out(x42:0) :|: TRUE f417_in(.(x52:0, x53:0)) -> f403_out(.(T114:0, T115:0)) :|: TRUE f403_out(x62:0) -> f386_in(x62:0) :|: TRUE f197_out(x) -> f386_in(x1) :|: TRUE f386_out(x2) -> f193_in(x3) :|: TRUE f193_in(.(x6:0, x7:0)) -> f197_out(.(T61:0, T62:0)) :|: TRUE f403_out(x38:0) -> f403_out(.(x47:0, x38:0)) :|: TRUE ---------------------------------------- (143) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (144) Obligation: Rules: f417_in(.(x48:0, x49:0)) -> f417_in(x49:0) :|: TRUE f193_in(.(x30:0, x31:0)) -> f193_in(x31:0) :|: TRUE f386_in(x58:0) -> f417_in(x58:0) :|: TRUE f386_in(x56:0) -> f386_out(T135:0) :|: TRUE f197_out(x11:0) -> f197_out(.(T70:0, x11:0)) :|: TRUE f386_out(x42:0) -> f386_out(x42:0) :|: TRUE f417_in(.(x52:0, x53:0)) -> f403_out(.(T114:0, T115:0)) :|: TRUE f403_out(x62:0) -> f386_in(x62:0) :|: TRUE f197_out(x) -> f386_in(x1) :|: TRUE f386_out(x2) -> f193_in(x3) :|: TRUE f193_in(.(x6:0, x7:0)) -> f197_out(.(T61:0, T62:0)) :|: TRUE f403_out(x38:0) -> f403_out(.(x47:0, x38:0)) :|: TRUE ---------------------------------------- (145) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f417_in(.(x48:0, x49:0)) -> f417_in(x49:0) :|: TRUE (2) f193_in(.(x30:0, x31:0)) -> f193_in(x31:0) :|: TRUE (3) f386_in(x58:0) -> f417_in(x58:0) :|: TRUE (4) f386_in(x56:0) -> f386_out(T135:0) :|: TRUE (5) f197_out(x11:0) -> f197_out(.(T70:0, x11:0)) :|: TRUE (6) f386_out(x42:0) -> f386_out(x42:0) :|: TRUE (7) f417_in(.(x52:0, x53:0)) -> f403_out(.(T114:0, T115:0)) :|: TRUE (8) f403_out(x62:0) -> f386_in(x62:0) :|: TRUE (9) f197_out(x) -> f386_in(x1) :|: TRUE (10) f386_out(x2) -> f193_in(x3) :|: TRUE (11) f193_in(.(x6:0, x7:0)) -> f197_out(.(T61:0, T62:0)) :|: TRUE (12) f403_out(x38:0) -> f403_out(.(x47:0, x38:0)) :|: TRUE Arcs: (1) -> (1), (7) (2) -> (2), (11) (3) -> (1), (7) (4) -> (6), (10) (5) -> (5), (9) (6) -> (6), (10) (7) -> (8), (12) (8) -> (3), (4) (9) -> (3), (4) (10) -> (2), (11) (11) -> (5), (9) (12) -> (8), (12) This digraph is fully evaluated! ---------------------------------------- (146) Obligation: Termination digraph: Nodes: (1) f417_in(.(x48:0, x49:0)) -> f417_in(x49:0) :|: TRUE (2) f386_in(x58:0) -> f417_in(x58:0) :|: TRUE (3) f197_out(x) -> f386_in(x1) :|: TRUE (4) f197_out(x11:0) -> f197_out(.(T70:0, x11:0)) :|: TRUE (5) f193_in(.(x6:0, x7:0)) -> f197_out(.(T61:0, T62:0)) :|: TRUE (6) f193_in(.(x30:0, x31:0)) -> f193_in(x31:0) :|: TRUE (7) f386_out(x2) -> f193_in(x3) :|: TRUE (8) f386_out(x42:0) -> f386_out(x42:0) :|: TRUE (9) f386_in(x56:0) -> f386_out(T135:0) :|: TRUE (10) f403_out(x62:0) -> f386_in(x62:0) :|: TRUE (11) f403_out(x38:0) -> f403_out(.(x47:0, x38:0)) :|: TRUE (12) f417_in(.(x52:0, x53:0)) -> f403_out(.(T114:0, T115:0)) :|: TRUE Arcs: (1) -> (1), (12) (2) -> (1), (12) (3) -> (2), (9) (4) -> (3), (4) (5) -> (3), (4) (6) -> (5), (6) (7) -> (5), (6) (8) -> (7), (8) (9) -> (7), (8) (10) -> (2), (9) (11) -> (10), (11) (12) -> (10), (11) This digraph is fully evaluated! ---------------------------------------- (147) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: .(x1, x2) -> .(x2) ---------------------------------------- (148) Obligation: Rules: f417_in(.(x49:0)) -> f417_in(x49:0) :|: TRUE f386_in(x58:0) -> f417_in(x58:0) :|: TRUE f197_out(x) -> f386_in(x1) :|: TRUE f197_out(x11:0) -> f197_out(.(x11:0)) :|: TRUE f193_in(.(x7:0)) -> f197_out(.(T62:0)) :|: TRUE f193_in(.(x31:0)) -> f193_in(x31:0) :|: TRUE f386_out(x2) -> f193_in(x3) :|: TRUE f386_out(x42:0) -> f386_out(x42:0) :|: TRUE f386_in(x56:0) -> f386_out(T135:0) :|: TRUE f403_out(x62:0) -> f386_in(x62:0) :|: TRUE f403_out(x38:0) -> f403_out(.(x38:0)) :|: TRUE f417_in(.(x53:0)) -> f403_out(.(T115:0)) :|: TRUE ---------------------------------------- (149) IRSwTToIntTRSProof (SOUND) Applied path-length measure to transform intTRS with terms to intTRS. ---------------------------------------- (150) Obligation: Rules: f417_in(.(x)) -> f417_in(x) :|: TRUE f386_in(x1) -> f417_in(x1) :|: TRUE f197_out(x2) -> f386_in(x3) :|: TRUE f197_out(x4) -> f197_out(.(x4)) :|: TRUE f193_in(.(x5)) -> f197_out(.(x6)) :|: TRUE f193_in(.(x7)) -> f193_in(x7) :|: TRUE f386_out(x8) -> f193_in(x9) :|: TRUE f386_out(x10) -> f386_out(x10) :|: TRUE f386_in(x11) -> f386_out(x12) :|: TRUE f403_out(x13) -> f386_in(x13) :|: TRUE f403_out(x14) -> f403_out(.(x14)) :|: TRUE f417_in(.(x15)) -> f403_out(.(x16)) :|: TRUE