/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 subset1(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, 5 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) PrologToTRSTransformerProof [SOUND, 0 ms] (24) QTRS (25) DependencyPairsProof [EQUIVALENT, 0 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) AND (29) QDP (30) UsableRulesProof [EQUIVALENT, 0 ms] (31) QDP (32) QDPSizeChangeProof [EQUIVALENT, 0 ms] (33) YES (34) QDP (35) NonTerminationLoopProof [COMPLETE, 0 ms] (36) NO (37) PrologToPiTRSProof [SOUND, 0 ms] (38) PiTRS (39) DependencyPairsProof [EQUIVALENT, 3 ms] (40) PiDP (41) DependencyGraphProof [EQUIVALENT, 0 ms] (42) AND (43) PiDP (44) UsableRulesProof [EQUIVALENT, 0 ms] (45) PiDP (46) PiDPToQDPProof [SOUND, 0 ms] (47) QDP (48) QDPSizeChangeProof [EQUIVALENT, 0 ms] (49) YES (50) PiDP (51) UsableRulesProof [EQUIVALENT, 0 ms] (52) PiDP (53) PiDPToQDPProof [SOUND, 0 ms] (54) QDP (55) TransformationProof [SOUND, 0 ms] (56) QDP (57) TransformationProof [EQUIVALENT, 0 ms] (58) QDP (59) PrologToDTProblemTransformerProof [SOUND, 0 ms] (60) TRIPLES (61) TriplesToPiDPProof [SOUND, 0 ms] (62) PiDP (63) DependencyGraphProof [EQUIVALENT, 0 ms] (64) AND (65) PiDP (66) UsableRulesProof [EQUIVALENT, 0 ms] (67) PiDP (68) PiDPToQDPProof [SOUND, 0 ms] (69) QDP (70) QDPSizeChangeProof [EQUIVALENT, 0 ms] (71) YES (72) PiDP (73) PiDPToQDPProof [SOUND, 0 ms] (74) QDP (75) TransformationProof [SOUND, 0 ms] (76) QDP (77) TransformationProof [EQUIVALENT, 0 ms] (78) QDP (79) PrologToIRSwTTransformerProof [SOUND, 40 ms] (80) AND (81) IRSwT (82) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (83) IRSwT (84) IntTRSCompressionProof [EQUIVALENT, 20 ms] (85) IRSwT (86) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (87) IRSwT (88) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms] (89) IRSwT (90) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (91) IRSwT (92) TempFilterProof [SOUND, 2 ms] (93) IRSwT (94) IRSwTToQDPProof [SOUND, 0 ms] (95) QDP (96) QDPSizeChangeProof [EQUIVALENT, 0 ms] (97) YES (98) IRSwT (99) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (100) IRSwT (101) IntTRSCompressionProof [EQUIVALENT, 8 ms] (102) IRSwT (103) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (104) IRSwT (105) IRSwTTerminationDigraphProof [EQUIVALENT, 15 ms] (106) IRSwT ---------------------------------------- (0) Obligation: Clauses: member(X, .(Y, Xs)) :- member(X, Xs). member(X, .(X, Xs)). subset(.(X, Xs), Ys) :- ','(member(X, Ys), subset(Xs, Ys)). subset([], Ys). member1(X, .(Y, Xs)) :- member1(X, Xs). member1(X, .(X, Xs)). subset1(.(X, Xs), Ys) :- ','(member1(X, Ys), subset1(Xs, Ys)). subset1([], Ys). Query: subset1(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: subset1_in_2: (f,b) member1_in_2: (f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_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: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_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: SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) SUBSET1_IN_AG(.(X, Xs), Ys) -> MEMBER1_IN_AG(X, Ys) MEMBER1_IN_AG(X, .(Y, Xs)) -> U4_AG(X, Y, Xs, member1_in_ag(X, Xs)) MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_AG(X, Xs, Ys, subset1_in_ag(Xs, Ys)) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1, x2) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) U4_AG(x1, x2, x3, x4) = U4_AG(x2, x3, x4) U6_AG(x1, x2, x3, x4) = U6_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: SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) SUBSET1_IN_AG(.(X, Xs), Ys) -> MEMBER1_IN_AG(X, Ys) MEMBER1_IN_AG(X, .(Y, Xs)) -> U4_AG(X, Y, Xs, member1_in_ag(X, Xs)) MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_AG(X, Xs, Ys, subset1_in_ag(Xs, Ys)) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1, x2) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) U4_AG(x1, x2, x3, x4) = U4_AG(x2, x3, x4) U6_AG(x1, x2, x3, x4) = U6_AG(x1, x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 3 less nodes. ---------------------------------------- (6) Complex Obligation (AND) ---------------------------------------- (7) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1, x2) MEMBER1_IN_AG(x1, x2) = MEMBER1_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: MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBER1_IN_AG(x1, x2) = MEMBER1_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: MEMBER1_IN_AG(.(Y, Xs)) -> MEMBER1_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: *MEMBER1_IN_AG(.(Y, Xs)) -> MEMBER1_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: U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x3, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1, x2) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_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: U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) The TRS R consists of the following rules: member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) The argument filtering Pi contains the following mapping: member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4) member1_out_ag(x1, x2) = member1_out_ag(x1, x2) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_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: U5_AG(Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Ys) SUBSET1_IN_AG(Ys) -> U5_AG(Ys, member1_in_ag(Ys)) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(Y, Xs, member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (19) TransformationProof (SOUND) By narrowing [LPAR04] the rule SUBSET1_IN_AG(Ys) -> U5_AG(Ys, member1_in_ag(Ys)) at position [1] we obtained the following new rules [LPAR04]: (SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(x0, x1, member1_in_ag(x1))),SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(x0, x1, member1_in_ag(x1)))) (SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0, .(x0, x1))),SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0, .(x0, x1)))) ---------------------------------------- (20) Obligation: Q DP problem: The TRS P consists of the following rules: U5_AG(Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Ys) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(x0, x1, member1_in_ag(x1))) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0, .(x0, x1))) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(Y, Xs, member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (21) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U5_AG(Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Ys) we obtained the following new rules [LPAR04]: (U5_AG(.(z0, z1), member1_out_ag(x1, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1)),U5_AG(.(z0, z1), member1_out_ag(x1, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1))) (U5_AG(.(z0, z1), member1_out_ag(z0, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1)),U5_AG(.(z0, z1), member1_out_ag(z0, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1))) ---------------------------------------- (22) Obligation: Q DP problem: The TRS P consists of the following rules: SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(x0, x1, member1_in_ag(x1))) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0, .(x0, x1))) U5_AG(.(z0, z1), member1_out_ag(x1, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1)) U5_AG(.(z0, z1), member1_out_ag(z0, .(z0, z1))) -> SUBSET1_IN_AG(.(z0, z1)) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(Y, Xs, member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (23) PrologToTRSTransformerProof (SOUND) Transformed Prolog program to TRS. { "root": 3, "program": { "directives": [], "clauses": [ [ "(member X (. Y Xs))", "(member X Xs)" ], [ "(member X (. X Xs))", null ], [ "(subset (. X Xs) Ys)", "(',' (member X Ys) (subset Xs Ys))" ], [ "(subset ([]) Ys)", null ], [ "(member1 X (. Y Xs))", "(member1 X Xs)" ], [ "(member1 X (. X Xs))", null ], [ "(subset1 (. X Xs) Ys)", "(',' (member1 X Ys) (subset1 Xs Ys))" ], [ "(subset1 ([]) Ys)", null ] ] }, "graph": { "nodes": { "78": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "280": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "272": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "274": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "276": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "3": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "278": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "289": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "5": { "goal": [ { "clause": 6, "scope": 1, "term": "(subset1 T1 T2)" }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "9": { "goal": [{ "clause": 6, "scope": 1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "70": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T42 T41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T41"], "free": [], "exprvars": [] } }, "50": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "51": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T23 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "52": { "goal": [ { "clause": 4, "scope": 2, "term": "(member1 T18 T17)" }, { "clause": 5, "scope": 2, "term": "(member1 T18 T17)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "31": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member1 T18 T17) (subset1 T19 T17))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "53": { "goal": [{ "clause": 4, "scope": 2, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "10": { "goal": [{ "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "32": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "54": { "goal": [{ "clause": 5, "scope": 2, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } } }, "edges": [ { "from": 3, "to": 5, "label": "CASE" }, { "from": 5, "to": 9, "label": "PARALLEL" }, { "from": 5, "to": 10, "label": "PARALLEL" }, { "from": 9, "to": 31, "label": "EVAL with clause\nsubset1(.(X13, X14), X15) :- ','(member1(X13, X15), subset1(X14, X15)).\nand substitutionX13 -> T18,\nX14 -> T19,\nT1 -> .(T18, T19),\nT2 -> T17,\nX15 -> T17,\nT15 -> T18,\nT16 -> T19" }, { "from": 9, "to": 32, "label": "EVAL-BACKTRACK" }, { "from": 10, "to": 278, "label": "EVAL with clause\nsubset1([], X51).\nand substitutionT1 -> [],\nT2 -> T57,\nX51 -> T57" }, { "from": 10, "to": 280, "label": "EVAL-BACKTRACK" }, { "from": 31, "to": 50, "label": "SPLIT 1" }, { "from": 31, "to": 51, "label": "SPLIT 2\nnew knowledge:\nT18 is ground\nT17 is ground\nreplacements:T19 -> T23" }, { "from": 50, "to": 52, "label": "CASE" }, { "from": 51, "to": 3, "label": "INSTANCE with matching:\nT1 -> T23\nT2 -> T17" }, { "from": 52, "to": 53, "label": "PARALLEL" }, { "from": 52, "to": 54, "label": "PARALLEL" }, { "from": 53, "to": 70, "label": "EVAL with clause\nmember1(X34, .(X35, X36)) :- member1(X34, X36).\nand substitutionT18 -> T42,\nX34 -> T42,\nX35 -> T40,\nX36 -> T41,\nT17 -> .(T40, T41),\nT39 -> T42" }, { "from": 53, "to": 78, "label": "EVAL-BACKTRACK" }, { "from": 54, "to": 272, "label": "EVAL with clause\nmember1(X44, .(X44, X45)).\nand substitutionT18 -> T50,\nX44 -> T50,\nX45 -> T51,\nT17 -> .(T50, T51)" }, { "from": 54, "to": 274, "label": "EVAL-BACKTRACK" }, { "from": 70, "to": 50, "label": "INSTANCE with matching:\nT18 -> T42\nT17 -> T41" }, { "from": 272, "to": 276, "label": "SUCCESS" }, { "from": 278, "to": 289, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (24) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f3_in(T17) -> U1(f31_in(T17), T17) U1(f31_out1(T18, T19), T17) -> f3_out1(.(T18, T19)) f3_in(T57) -> f3_out1([]) f50_in(.(T40, T41)) -> U2(f50_in(T41), .(T40, T41)) U2(f50_out1(T42), .(T40, T41)) -> f50_out1(T42) f50_in(.(T50, T51)) -> f50_out1(T50) f31_in(T17) -> U3(f50_in(T17), T17) U3(f50_out1(T18), T17) -> U4(f3_in(T17), T17, T18) U4(f3_out1(T23), T17, T18) -> f31_out1(T18, T23) Q is empty. ---------------------------------------- (25) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (26) Obligation: Q DP problem: The TRS P consists of the following rules: F3_IN(T17) -> U1^1(f31_in(T17), T17) F3_IN(T17) -> F31_IN(T17) F50_IN(.(T40, T41)) -> U2^1(f50_in(T41), .(T40, T41)) F50_IN(.(T40, T41)) -> F50_IN(T41) F31_IN(T17) -> U3^1(f50_in(T17), T17) F31_IN(T17) -> F50_IN(T17) U3^1(f50_out1(T18), T17) -> U4^1(f3_in(T17), T17, T18) U3^1(f50_out1(T18), T17) -> F3_IN(T17) The TRS R consists of the following rules: f3_in(T17) -> U1(f31_in(T17), T17) U1(f31_out1(T18, T19), T17) -> f3_out1(.(T18, T19)) f3_in(T57) -> f3_out1([]) f50_in(.(T40, T41)) -> U2(f50_in(T41), .(T40, T41)) U2(f50_out1(T42), .(T40, T41)) -> f50_out1(T42) f50_in(.(T50, T51)) -> f50_out1(T50) f31_in(T17) -> U3(f50_in(T17), T17) U3(f50_out1(T18), T17) -> U4(f3_in(T17), T17, T18) U4(f3_out1(T23), T17, T18) -> f31_out1(T18, T23) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (27) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes. ---------------------------------------- (28) Complex Obligation (AND) ---------------------------------------- (29) Obligation: Q DP problem: The TRS P consists of the following rules: F50_IN(.(T40, T41)) -> F50_IN(T41) The TRS R consists of the following rules: f3_in(T17) -> U1(f31_in(T17), T17) U1(f31_out1(T18, T19), T17) -> f3_out1(.(T18, T19)) f3_in(T57) -> f3_out1([]) f50_in(.(T40, T41)) -> U2(f50_in(T41), .(T40, T41)) U2(f50_out1(T42), .(T40, T41)) -> f50_out1(T42) f50_in(.(T50, T51)) -> f50_out1(T50) f31_in(T17) -> U3(f50_in(T17), T17) U3(f50_out1(T18), T17) -> U4(f3_in(T17), T17, T18) U4(f3_out1(T23), T17, T18) -> f31_out1(T18, T23) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (30) 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. ---------------------------------------- (31) Obligation: Q DP problem: The TRS P consists of the following rules: F50_IN(.(T40, T41)) -> F50_IN(T41) R is empty. Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (32) 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: *F50_IN(.(T40, T41)) -> F50_IN(T41) The graph contains the following edges 1 > 1 ---------------------------------------- (33) YES ---------------------------------------- (34) Obligation: Q DP problem: The TRS P consists of the following rules: F3_IN(T17) -> F31_IN(T17) F31_IN(T17) -> U3^1(f50_in(T17), T17) U3^1(f50_out1(T18), T17) -> F3_IN(T17) The TRS R consists of the following rules: f3_in(T17) -> U1(f31_in(T17), T17) U1(f31_out1(T18, T19), T17) -> f3_out1(.(T18, T19)) f3_in(T57) -> f3_out1([]) f50_in(.(T40, T41)) -> U2(f50_in(T41), .(T40, T41)) U2(f50_out1(T42), .(T40, T41)) -> f50_out1(T42) f50_in(.(T50, T51)) -> f50_out1(T50) f31_in(T17) -> U3(f50_in(T17), T17) U3(f50_out1(T18), T17) -> U4(f3_in(T17), T17, T18) U4(f3_out1(T23), T17, T18) -> f31_out1(T18, T23) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (35) 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 = F31_IN(.(T50, T51)) evaluates to t =F31_IN(.(T50, T51)) Thus s starts an infinite chain as s semiunifies with t with the following substitutions: * Matcher: [ ] * Semiunifier: [ ] -------------------------------------------------------------------------------- Rewriting sequence F31_IN(.(T50, T51)) -> U3^1(f50_in(.(T50, T51)), .(T50, T51)) with rule F31_IN(T17) -> U3^1(f50_in(T17), T17) at position [] and matcher [T17 / .(T50, T51)] U3^1(f50_in(.(T50, T51)), .(T50, T51)) -> U3^1(f50_out1(T50), .(T50, T51)) with rule f50_in(.(T50', T51')) -> f50_out1(T50') at position [0] and matcher [T50' / T50, T51' / T51] U3^1(f50_out1(T50), .(T50, T51)) -> F3_IN(.(T50, T51)) with rule U3^1(f50_out1(T18), T17') -> F3_IN(T17') at position [] and matcher [T18 / T50, T17' / .(T50, T51)] F3_IN(.(T50, T51)) -> F31_IN(.(T50, T51)) with rule F3_IN(T17) -> F31_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. ---------------------------------------- (36) NO ---------------------------------------- (37) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: subset1_in_2: (f,b) member1_in_2: (f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (38) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) ---------------------------------------- (39) 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: SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) SUBSET1_IN_AG(.(X, Xs), Ys) -> MEMBER1_IN_AG(X, Ys) MEMBER1_IN_AG(X, .(Y, Xs)) -> U4_AG(X, Y, Xs, member1_in_ag(X, Xs)) MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_AG(X, Xs, Ys, subset1_in_ag(Xs, Ys)) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) U4_AG(x1, x2, x3, x4) = U4_AG(x4) U6_AG(x1, x2, x3, x4) = U6_AG(x1, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (40) Obligation: Pi DP problem: The TRS P consists of the following rules: SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) SUBSET1_IN_AG(.(X, Xs), Ys) -> MEMBER1_IN_AG(X, Ys) MEMBER1_IN_AG(X, .(Y, Xs)) -> U4_AG(X, Y, Xs, member1_in_ag(X, Xs)) MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_AG(X, Xs, Ys, subset1_in_ag(Xs, Ys)) U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) U4_AG(x1, x2, x3, x4) = U4_AG(x4) U6_AG(x1, x2, x3, x4) = U6_AG(x1, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (41) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 3 less nodes. ---------------------------------------- (42) Complex Obligation (AND) ---------------------------------------- (43) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (44) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (45) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER1_IN_AG(X, .(Y, Xs)) -> MEMBER1_IN_AG(X, Xs) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBER1_IN_AG(x1, x2) = MEMBER1_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (46) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (47) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBER1_IN_AG(.(Y, Xs)) -> MEMBER1_IN_AG(Xs) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (48) 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: *MEMBER1_IN_AG(.(Y, Xs)) -> MEMBER1_IN_AG(Xs) The graph contains the following edges 1 > 1 ---------------------------------------- (49) YES ---------------------------------------- (50) Obligation: Pi DP problem: The TRS P consists of the following rules: U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) The TRS R consists of the following rules: subset1_in_ag(.(X, Xs), Ys) -> U5_ag(X, Xs, Ys, member1_in_ag(X, Ys)) member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) U5_ag(X, Xs, Ys, member1_out_ag(X, Ys)) -> U6_ag(X, Xs, Ys, subset1_in_ag(Xs, Ys)) subset1_in_ag([], Ys) -> subset1_out_ag([], Ys) U6_ag(X, Xs, Ys, subset1_out_ag(Xs, Ys)) -> subset1_out_ag(.(X, Xs), Ys) The argument filtering Pi contains the following mapping: subset1_in_ag(x1, x2) = subset1_in_ag(x2) U5_ag(x1, x2, x3, x4) = U5_ag(x3, x4) member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) U6_ag(x1, x2, x3, x4) = U6_ag(x1, x4) subset1_out_ag(x1, x2) = subset1_out_ag(x1) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (51) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (52) Obligation: Pi DP problem: The TRS P consists of the following rules: U5_AG(X, Xs, Ys, member1_out_ag(X, Ys)) -> SUBSET1_IN_AG(Xs, Ys) SUBSET1_IN_AG(.(X, Xs), Ys) -> U5_AG(X, Xs, Ys, member1_in_ag(X, Ys)) The TRS R consists of the following rules: member1_in_ag(X, .(Y, Xs)) -> U4_ag(X, Y, Xs, member1_in_ag(X, Xs)) member1_in_ag(X, .(X, Xs)) -> member1_out_ag(X, .(X, Xs)) U4_ag(X, Y, Xs, member1_out_ag(X, Xs)) -> member1_out_ag(X, .(Y, Xs)) The argument filtering Pi contains the following mapping: member1_in_ag(x1, x2) = member1_in_ag(x2) .(x1, x2) = .(x1, x2) U4_ag(x1, x2, x3, x4) = U4_ag(x4) member1_out_ag(x1, x2) = member1_out_ag(x1) SUBSET1_IN_AG(x1, x2) = SUBSET1_IN_AG(x2) U5_AG(x1, x2, x3, x4) = U5_AG(x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (53) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (54) Obligation: Q DP problem: The TRS P consists of the following rules: U5_AG(Ys, member1_out_ag(X)) -> SUBSET1_IN_AG(Ys) SUBSET1_IN_AG(Ys) -> U5_AG(Ys, member1_in_ag(Ys)) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X) U4_ag(member1_out_ag(X)) -> member1_out_ag(X) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (55) TransformationProof (SOUND) By narrowing [LPAR04] the rule SUBSET1_IN_AG(Ys) -> U5_AG(Ys, member1_in_ag(Ys)) at position [1] we obtained the following new rules [LPAR04]: (SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(member1_in_ag(x1))),SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(member1_in_ag(x1)))) (SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0)),SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0))) ---------------------------------------- (56) Obligation: Q DP problem: The TRS P consists of the following rules: U5_AG(Ys, member1_out_ag(X)) -> SUBSET1_IN_AG(Ys) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(member1_in_ag(x1))) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0)) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X) U4_ag(member1_out_ag(X)) -> member1_out_ag(X) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (57) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U5_AG(Ys, member1_out_ag(X)) -> SUBSET1_IN_AG(Ys) we obtained the following new rules [LPAR04]: (U5_AG(.(z0, z1), member1_out_ag(x1)) -> SUBSET1_IN_AG(.(z0, z1)),U5_AG(.(z0, z1), member1_out_ag(x1)) -> SUBSET1_IN_AG(.(z0, z1))) (U5_AG(.(z0, z1), member1_out_ag(z0)) -> SUBSET1_IN_AG(.(z0, z1)),U5_AG(.(z0, z1), member1_out_ag(z0)) -> SUBSET1_IN_AG(.(z0, z1))) ---------------------------------------- (58) Obligation: Q DP problem: The TRS P consists of the following rules: SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), U4_ag(member1_in_ag(x1))) SUBSET1_IN_AG(.(x0, x1)) -> U5_AG(.(x0, x1), member1_out_ag(x0)) U5_AG(.(z0, z1), member1_out_ag(x1)) -> SUBSET1_IN_AG(.(z0, z1)) U5_AG(.(z0, z1), member1_out_ag(z0)) -> SUBSET1_IN_AG(.(z0, z1)) The TRS R consists of the following rules: member1_in_ag(.(Y, Xs)) -> U4_ag(member1_in_ag(Xs)) member1_in_ag(.(X, Xs)) -> member1_out_ag(X) U4_ag(member1_out_ag(X)) -> member1_out_ag(X) The set Q consists of the following terms: member1_in_ag(x0) U4_ag(x0) We have to consider all (P,Q,R)-chains. ---------------------------------------- (59) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(member X (. Y Xs))", "(member X Xs)" ], [ "(member X (. X Xs))", null ], [ "(subset (. X Xs) Ys)", "(',' (member X Ys) (subset Xs Ys))" ], [ "(subset ([]) Ys)", null ], [ "(member1 X (. Y Xs))", "(member1 X Xs)" ], [ "(member1 X (. X Xs))", null ], [ "(subset1 (. X Xs) Ys)", "(',' (member1 X Ys) (subset1 Xs Ys))" ], [ "(subset1 ([]) Ys)", null ] ] }, "graph": { "nodes": { "29": { "goal": [{ "clause": 4, "scope": 2, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "290": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "291": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "292": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "293": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "294": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "152": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member1 T26 T25) (subset1 T27 (. T24 T25)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T24", "T25" ], "free": [], "exprvars": [] } }, "251": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "295": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "153": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "252": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "176": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T26 T25)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T25"], "free": [], "exprvars": [] } }, "253": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "210": { "goal": [ { "clause": 4, "scope": 3, "term": "(member1 T26 T25)" }, { "clause": 5, "scope": 3, "term": "(member1 T26 T25)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T25"], "free": [], "exprvars": [] } }, "254": { "goal": [{ "clause": 5, "scope": 2, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "255": { "goal": [ { "clause": -1, "scope": 2, "term": null }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "256": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T74 (. T72 T73))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T72", "T73" ], "free": [], "exprvars": [] } }, "236": { "goal": [{ "clause": 4, "scope": 3, "term": "(member1 T26 T25)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T25"], "free": [], "exprvars": [] } }, "239": { "goal": [{ "clause": 5, "scope": 3, "term": "(member1 T26 T25)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T25"], "free": [], "exprvars": [] } }, "30": { "goal": [ { "clause": 5, "scope": 2, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }, { "clause": -1, "scope": 2, "term": null }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "11": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "13": { "goal": [{ "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [[ "(subset1 T1 T2)", "(subset1 (. X4 X5) X6)" ]], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [ "X4", "X5", "X6" ], "exprvars": [] } }, "17": { "goal": [ { "clause": 4, "scope": 2, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }, { "clause": 5, "scope": 2, "term": "(',' (member1 T9 T8) (subset1 T10 T8))" }, { "clause": -1, "scope": 2, "term": null }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T8)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "182": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T31 (. T24 T25))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T24", "T25" ], "free": [], "exprvars": [] } }, "283": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "1": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "287": { "goal": [{ "clause": 7, "scope": 1, "term": "(subset1 T1 T8)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T8"], "free": [], "exprvars": [] } }, "247": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T50 T49)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T49"], "free": [], "exprvars": [] } }, "6": { "goal": [ { "clause": 6, "scope": 1, "term": "(subset1 T1 T2)" }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "248": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 1, "to": 6, "label": "CASE" }, { "from": 6, "to": 11, "label": "EVAL with clause\nsubset1(.(X4, X5), X6) :- ','(member1(X4, X6), subset1(X5, X6)).\nand substitutionX4 -> T9,\nX5 -> T10,\nT1 -> .(T9, T10),\nT2 -> T8,\nX6 -> T8,\nT6 -> T9,\nT7 -> T10" }, { "from": 6, "to": 13, "label": "EVAL-BACKTRACK" }, { "from": 11, "to": 17, "label": "CASE" }, { "from": 13, "to": 293, "label": "EVAL with clause\nsubset1([], X72).\nand substitutionT1 -> [],\nT2 -> T83,\nX72 -> T83" }, { "from": 13, "to": 294, "label": "EVAL-BACKTRACK" }, { "from": 17, "to": 29, "label": "PARALLEL" }, { "from": 17, "to": 30, "label": "PARALLEL" }, { "from": 29, "to": 152, "label": "EVAL with clause\nmember1(X19, .(X20, X21)) :- member1(X19, X21).\nand substitutionT9 -> T26,\nX19 -> T26,\nX20 -> T24,\nX21 -> T25,\nT8 -> .(T24, T25),\nT23 -> T26,\nT10 -> T27" }, { "from": 29, "to": 153, "label": "EVAL-BACKTRACK" }, { "from": 30, "to": 254, "label": "PARALLEL" }, { "from": 30, "to": 255, "label": "PARALLEL" }, { "from": 152, "to": 176, "label": "SPLIT 1" }, { "from": 152, "to": 182, "label": "SPLIT 2\nnew knowledge:\nT26 is ground\nT25 is ground\nreplacements:T27 -> T31" }, { "from": 176, "to": 210, "label": "CASE" }, { "from": 182, "to": 1, "label": "INSTANCE with matching:\nT1 -> T31\nT2 -> .(T24, T25)" }, { "from": 210, "to": 236, "label": "PARALLEL" }, { "from": 210, "to": 239, "label": "PARALLEL" }, { "from": 236, "to": 247, "label": "EVAL with clause\nmember1(X40, .(X41, X42)) :- member1(X40, X42).\nand substitutionT26 -> T50,\nX40 -> T50,\nX41 -> T48,\nX42 -> T49,\nT25 -> .(T48, T49),\nT47 -> T50" }, { "from": 236, "to": 248, "label": "EVAL-BACKTRACK" }, { "from": 239, "to": 251, "label": "EVAL with clause\nmember1(X50, .(X50, X51)).\nand substitutionT26 -> T58,\nX50 -> T58,\nX51 -> T59,\nT25 -> .(T58, T59)" }, { "from": 239, "to": 252, "label": "EVAL-BACKTRACK" }, { "from": 247, "to": 176, "label": "INSTANCE with matching:\nT26 -> T50\nT25 -> T49" }, { "from": 251, "to": 253, "label": "SUCCESS" }, { "from": 254, "to": 256, "label": "EVAL with clause\nmember1(X63, .(X63, X64)).\nand substitutionT9 -> T72,\nX63 -> T72,\nX64 -> T73,\nT8 -> .(T72, T73),\nT10 -> T74" }, { "from": 254, "to": 283, "label": "EVAL-BACKTRACK" }, { "from": 255, "to": 287, "label": "FAILURE" }, { "from": 256, "to": 1, "label": "INSTANCE with matching:\nT1 -> T74\nT2 -> .(T72, T73)" }, { "from": 287, "to": 290, "label": "EVAL with clause\nsubset1([], X70).\nand substitutionT1 -> [],\nT8 -> T81,\nX70 -> T81" }, { "from": 287, "to": 291, "label": "EVAL-BACKTRACK" }, { "from": 290, "to": 292, "label": "SUCCESS" }, { "from": 293, "to": 295, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (60) Obligation: Triples: member1B(X1, .(X2, X3)) :- member1B(X1, X3). subset1A(.(X1, X2), .(X3, X4)) :- member1B(X1, X4). subset1A(.(X1, X2), .(X3, X4)) :- ','(member1cB(X1, X4), subset1A(X2, .(X3, X4))). subset1A(.(X1, X2), .(X1, X3)) :- subset1A(X2, .(X1, X3)). Clauses: subset1cA(.(X1, X2), .(X3, X4)) :- ','(member1cB(X1, X4), subset1cA(X2, .(X3, X4))). subset1cA(.(X1, X2), .(X1, X3)) :- subset1cA(X2, .(X1, X3)). subset1cA([], X1). subset1cA([], X1). member1cB(X1, .(X2, X3)) :- member1cB(X1, X3). member1cB(X1, .(X1, X2)). Afs: subset1A(x1, x2) = subset1A(x2) ---------------------------------------- (61) TriplesToPiDPProof (SOUND) We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes: subset1A_in_2: (f,b) member1B_in_2: (f,b) member1cB_in_2: (f,b) Transforming TRIPLES into the following Term Rewriting System: Pi DP problem: The TRS P consists of the following rules: SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> U2_AG(X1, X2, X3, X4, member1B_in_ag(X1, X4)) SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> MEMBER1B_IN_AG(X1, X4) MEMBER1B_IN_AG(X1, .(X2, X3)) -> U1_AG(X1, X2, X3, member1B_in_ag(X1, X3)) MEMBER1B_IN_AG(X1, .(X2, X3)) -> MEMBER1B_IN_AG(X1, X3) SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> U3_AG(X1, X2, X3, X4, member1cB_in_ag(X1, X4)) U3_AG(X1, X2, X3, X4, member1cB_out_ag(X1, X4)) -> U4_AG(X1, X2, X3, X4, subset1A_in_ag(X2, .(X3, X4))) U3_AG(X1, X2, X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(X2, .(X3, X4)) SUBSET1A_IN_AG(.(X1, X2), .(X1, X3)) -> U5_AG(X1, X2, X3, subset1A_in_ag(X2, .(X1, X3))) SUBSET1A_IN_AG(.(X1, X2), .(X1, X3)) -> SUBSET1A_IN_AG(X2, .(X1, X3)) The TRS R consists of the following rules: member1cB_in_ag(X1, .(X2, X3)) -> U10_ag(X1, X2, X3, member1cB_in_ag(X1, X3)) member1cB_in_ag(X1, .(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X1, X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The argument filtering Pi contains the following mapping: subset1A_in_ag(x1, x2) = subset1A_in_ag(x2) .(x1, x2) = .(x1, x2) member1B_in_ag(x1, x2) = member1B_in_ag(x2) member1cB_in_ag(x1, x2) = member1cB_in_ag(x2) U10_ag(x1, x2, x3, x4) = U10_ag(x2, x3, x4) member1cB_out_ag(x1, x2) = member1cB_out_ag(x1, x2) SUBSET1A_IN_AG(x1, x2) = SUBSET1A_IN_AG(x2) U2_AG(x1, x2, x3, x4, x5) = U2_AG(x3, x4, x5) MEMBER1B_IN_AG(x1, x2) = MEMBER1B_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x2, x3, x4) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x3, x4, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x3, x4, x5) U5_AG(x1, x2, x3, x4) = U5_AG(x1, x3, x4) We have to consider all (P,R,Pi)-chains Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES ---------------------------------------- (62) Obligation: Pi DP problem: The TRS P consists of the following rules: SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> U2_AG(X1, X2, X3, X4, member1B_in_ag(X1, X4)) SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> MEMBER1B_IN_AG(X1, X4) MEMBER1B_IN_AG(X1, .(X2, X3)) -> U1_AG(X1, X2, X3, member1B_in_ag(X1, X3)) MEMBER1B_IN_AG(X1, .(X2, X3)) -> MEMBER1B_IN_AG(X1, X3) SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> U3_AG(X1, X2, X3, X4, member1cB_in_ag(X1, X4)) U3_AG(X1, X2, X3, X4, member1cB_out_ag(X1, X4)) -> U4_AG(X1, X2, X3, X4, subset1A_in_ag(X2, .(X3, X4))) U3_AG(X1, X2, X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(X2, .(X3, X4)) SUBSET1A_IN_AG(.(X1, X2), .(X1, X3)) -> U5_AG(X1, X2, X3, subset1A_in_ag(X2, .(X1, X3))) SUBSET1A_IN_AG(.(X1, X2), .(X1, X3)) -> SUBSET1A_IN_AG(X2, .(X1, X3)) The TRS R consists of the following rules: member1cB_in_ag(X1, .(X2, X3)) -> U10_ag(X1, X2, X3, member1cB_in_ag(X1, X3)) member1cB_in_ag(X1, .(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X1, X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The argument filtering Pi contains the following mapping: subset1A_in_ag(x1, x2) = subset1A_in_ag(x2) .(x1, x2) = .(x1, x2) member1B_in_ag(x1, x2) = member1B_in_ag(x2) member1cB_in_ag(x1, x2) = member1cB_in_ag(x2) U10_ag(x1, x2, x3, x4) = U10_ag(x2, x3, x4) member1cB_out_ag(x1, x2) = member1cB_out_ag(x1, x2) SUBSET1A_IN_AG(x1, x2) = SUBSET1A_IN_AG(x2) U2_AG(x1, x2, x3, x4, x5) = U2_AG(x3, x4, x5) MEMBER1B_IN_AG(x1, x2) = MEMBER1B_IN_AG(x2) U1_AG(x1, x2, x3, x4) = U1_AG(x2, x3, x4) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x3, x4, x5) U4_AG(x1, x2, x3, x4, x5) = U4_AG(x3, x4, x5) U5_AG(x1, x2, x3, x4) = U5_AG(x1, x3, x4) We have to consider all (P,R,Pi)-chains ---------------------------------------- (63) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 5 less nodes. ---------------------------------------- (64) Complex Obligation (AND) ---------------------------------------- (65) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER1B_IN_AG(X1, .(X2, X3)) -> MEMBER1B_IN_AG(X1, X3) The TRS R consists of the following rules: member1cB_in_ag(X1, .(X2, X3)) -> U10_ag(X1, X2, X3, member1cB_in_ag(X1, X3)) member1cB_in_ag(X1, .(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X1, X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) member1cB_in_ag(x1, x2) = member1cB_in_ag(x2) U10_ag(x1, x2, x3, x4) = U10_ag(x2, x3, x4) member1cB_out_ag(x1, x2) = member1cB_out_ag(x1, x2) MEMBER1B_IN_AG(x1, x2) = MEMBER1B_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (66) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (67) Obligation: Pi DP problem: The TRS P consists of the following rules: MEMBER1B_IN_AG(X1, .(X2, X3)) -> MEMBER1B_IN_AG(X1, X3) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) MEMBER1B_IN_AG(x1, x2) = MEMBER1B_IN_AG(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (68) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (69) Obligation: Q DP problem: The TRS P consists of the following rules: MEMBER1B_IN_AG(.(X2, X3)) -> MEMBER1B_IN_AG(X3) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (70) 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: *MEMBER1B_IN_AG(.(X2, X3)) -> MEMBER1B_IN_AG(X3) The graph contains the following edges 1 > 1 ---------------------------------------- (71) YES ---------------------------------------- (72) Obligation: Pi DP problem: The TRS P consists of the following rules: SUBSET1A_IN_AG(.(X1, X2), .(X3, X4)) -> U3_AG(X1, X2, X3, X4, member1cB_in_ag(X1, X4)) U3_AG(X1, X2, X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(X2, .(X3, X4)) SUBSET1A_IN_AG(.(X1, X2), .(X1, X3)) -> SUBSET1A_IN_AG(X2, .(X1, X3)) The TRS R consists of the following rules: member1cB_in_ag(X1, .(X2, X3)) -> U10_ag(X1, X2, X3, member1cB_in_ag(X1, X3)) member1cB_in_ag(X1, .(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X1, X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) member1cB_in_ag(x1, x2) = member1cB_in_ag(x2) U10_ag(x1, x2, x3, x4) = U10_ag(x2, x3, x4) member1cB_out_ag(x1, x2) = member1cB_out_ag(x1, x2) SUBSET1A_IN_AG(x1, x2) = SUBSET1A_IN_AG(x2) U3_AG(x1, x2, x3, x4, x5) = U3_AG(x3, x4, x5) We have to consider all (P,R,Pi)-chains ---------------------------------------- (73) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (74) Obligation: Q DP problem: The TRS P consists of the following rules: SUBSET1A_IN_AG(.(X3, X4)) -> U3_AG(X3, X4, member1cB_in_ag(X4)) U3_AG(X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(.(X3, X4)) SUBSET1A_IN_AG(.(X1, X3)) -> SUBSET1A_IN_AG(.(X1, X3)) The TRS R consists of the following rules: member1cB_in_ag(.(X2, X3)) -> U10_ag(X2, X3, member1cB_in_ag(X3)) member1cB_in_ag(.(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: member1cB_in_ag(x0) U10_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (75) TransformationProof (SOUND) By narrowing [LPAR04] the rule SUBSET1A_IN_AG(.(X3, X4)) -> U3_AG(X3, X4, member1cB_in_ag(X4)) at position [2] we obtained the following new rules [LPAR04]: (SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), U10_ag(x0, x1, member1cB_in_ag(x1))),SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), U10_ag(x0, x1, member1cB_in_ag(x1)))) (SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), member1cB_out_ag(x0, .(x0, x1))),SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), member1cB_out_ag(x0, .(x0, x1)))) ---------------------------------------- (76) Obligation: Q DP problem: The TRS P consists of the following rules: U3_AG(X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(.(X3, X4)) SUBSET1A_IN_AG(.(X1, X3)) -> SUBSET1A_IN_AG(.(X1, X3)) SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), U10_ag(x0, x1, member1cB_in_ag(x1))) SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), member1cB_out_ag(x0, .(x0, x1))) The TRS R consists of the following rules: member1cB_in_ag(.(X2, X3)) -> U10_ag(X2, X3, member1cB_in_ag(X3)) member1cB_in_ag(.(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: member1cB_in_ag(x0) U10_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (77) TransformationProof (EQUIVALENT) By instantiating [LPAR04] the rule U3_AG(X3, X4, member1cB_out_ag(X1, X4)) -> SUBSET1A_IN_AG(.(X3, X4)) we obtained the following new rules [LPAR04]: (U3_AG(z0, .(z1, z2), member1cB_out_ag(x2, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2))),U3_AG(z0, .(z1, z2), member1cB_out_ag(x2, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2)))) (U3_AG(z0, .(z1, z2), member1cB_out_ag(z1, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2))),U3_AG(z0, .(z1, z2), member1cB_out_ag(z1, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2)))) ---------------------------------------- (78) Obligation: Q DP problem: The TRS P consists of the following rules: SUBSET1A_IN_AG(.(X1, X3)) -> SUBSET1A_IN_AG(.(X1, X3)) SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), U10_ag(x0, x1, member1cB_in_ag(x1))) SUBSET1A_IN_AG(.(y0, .(x0, x1))) -> U3_AG(y0, .(x0, x1), member1cB_out_ag(x0, .(x0, x1))) U3_AG(z0, .(z1, z2), member1cB_out_ag(x2, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2))) U3_AG(z0, .(z1, z2), member1cB_out_ag(z1, .(z1, z2))) -> SUBSET1A_IN_AG(.(z0, .(z1, z2))) The TRS R consists of the following rules: member1cB_in_ag(.(X2, X3)) -> U10_ag(X2, X3, member1cB_in_ag(X3)) member1cB_in_ag(.(X1, X2)) -> member1cB_out_ag(X1, .(X1, X2)) U10_ag(X2, X3, member1cB_out_ag(X1, X3)) -> member1cB_out_ag(X1, .(X2, X3)) The set Q consists of the following terms: member1cB_in_ag(x0) U10_ag(x0, x1, x2) We have to consider all (P,Q,R)-chains. ---------------------------------------- (79) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(member X (. Y Xs))", "(member X Xs)" ], [ "(member X (. X Xs))", null ], [ "(subset (. X Xs) Ys)", "(',' (member X Ys) (subset Xs Ys))" ], [ "(subset ([]) Ys)", null ], [ "(member1 X (. Y Xs))", "(member1 X Xs)" ], [ "(member1 X (. X Xs))", null ], [ "(subset1 (. X Xs) Ys)", "(',' (member1 X Ys) (subset1 Xs Ys))" ], [ "(subset1 ([]) Ys)", null ] ] }, "graph": { "nodes": { "55": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "56": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T23 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "57": { "goal": [ { "clause": 4, "scope": 2, "term": "(member1 T18 T17)" }, { "clause": 5, "scope": 2, "term": "(member1 T18 T17)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "58": { "goal": [{ "clause": 4, "scope": 2, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "48": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (member1 T18 T17) (subset1 T19 T17))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "59": { "goal": [{ "clause": 5, "scope": 2, "term": "(member1 T18 T17)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T17"], "free": [], "exprvars": [] } }, "49": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "281": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "273": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "275": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "2": { "goal": [{ "clause": -1, "scope": -1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "277": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "288": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "4": { "goal": [ { "clause": 6, "scope": 1, "term": "(subset1 T1 T2)" }, { "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "279": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "7": { "goal": [{ "clause": 6, "scope": 1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "8": { "goal": [{ "clause": 7, "scope": 1, "term": "(subset1 T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T2"], "free": [], "exprvars": [] } }, "60": { "goal": [{ "clause": -1, "scope": -1, "term": "(member1 T42 T41)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T41"], "free": [], "exprvars": [] } }, "61": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 2, "to": 4, "label": "CASE" }, { "from": 4, "to": 7, "label": "PARALLEL" }, { "from": 4, "to": 8, "label": "PARALLEL" }, { "from": 7, "to": 48, "label": "EVAL with clause\nsubset1(.(X13, X14), X15) :- ','(member1(X13, X15), subset1(X14, X15)).\nand substitutionX13 -> T18,\nX14 -> T19,\nT1 -> .(T18, T19),\nT2 -> T17,\nX15 -> T17,\nT15 -> T18,\nT16 -> T19" }, { "from": 7, "to": 49, "label": "EVAL-BACKTRACK" }, { "from": 8, "to": 279, "label": "EVAL with clause\nsubset1([], X51).\nand substitutionT1 -> [],\nT2 -> T57,\nX51 -> T57" }, { "from": 8, "to": 281, "label": "EVAL-BACKTRACK" }, { "from": 48, "to": 55, "label": "SPLIT 1" }, { "from": 48, "to": 56, "label": "SPLIT 2\nnew knowledge:\nT18 is ground\nT17 is ground\nreplacements:T19 -> T23" }, { "from": 55, "to": 57, "label": "CASE" }, { "from": 56, "to": 2, "label": "INSTANCE with matching:\nT1 -> T23\nT2 -> T17" }, { "from": 57, "to": 58, "label": "PARALLEL" }, { "from": 57, "to": 59, "label": "PARALLEL" }, { "from": 58, "to": 60, "label": "EVAL with clause\nmember1(X34, .(X35, X36)) :- member1(X34, X36).\nand substitutionT18 -> T42,\nX34 -> T42,\nX35 -> T40,\nX36 -> T41,\nT17 -> .(T40, T41),\nT39 -> T42" }, { "from": 58, "to": 61, "label": "EVAL-BACKTRACK" }, { "from": 59, "to": 273, "label": "EVAL with clause\nmember1(X44, .(X44, X45)).\nand substitutionT18 -> T50,\nX44 -> T50,\nX45 -> T51,\nT17 -> .(T50, T51)" }, { "from": 59, "to": 275, "label": "EVAL-BACKTRACK" }, { "from": 60, "to": 55, "label": "INSTANCE with matching:\nT18 -> T42\nT17 -> T41" }, { "from": 273, "to": 277, "label": "SUCCESS" }, { "from": 279, "to": 288, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (80) Complex Obligation (AND) ---------------------------------------- (81) Obligation: Rules: f55_in(T17) -> f57_in(T17) :|: TRUE f57_out(x) -> f55_out(x) :|: TRUE f59_out(x1) -> f57_out(x1) :|: TRUE f57_in(x2) -> f59_in(x2) :|: TRUE f58_out(x3) -> f57_out(x3) :|: TRUE f57_in(x4) -> f58_in(x4) :|: TRUE f60_in(T41) -> f55_in(T41) :|: TRUE f55_out(x5) -> f60_out(x5) :|: TRUE f60_out(x6) -> f58_out(.(x7, x6)) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE f61_out -> f58_out(x10) :|: TRUE f58_in(x11) -> f61_in :|: TRUE f2_in(T2) -> f4_in(T2) :|: TRUE f4_out(x12) -> f2_out(x12) :|: TRUE f7_out(x13) -> f4_out(x13) :|: TRUE f4_in(x14) -> f7_in(x14) :|: TRUE f4_in(x15) -> f8_in(x15) :|: TRUE f8_out(x16) -> f4_out(x16) :|: TRUE f48_out(x17) -> f7_out(x17) :|: TRUE f7_in(x18) -> f49_in :|: TRUE f49_out -> f7_out(x19) :|: TRUE f7_in(x20) -> f48_in(x20) :|: TRUE f56_out(x21) -> f48_out(x21) :|: TRUE f48_in(x22) -> f55_in(x22) :|: TRUE f55_out(x23) -> f56_in(x23) :|: TRUE Start term: f2_in(T2) ---------------------------------------- (82) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: intTRSProblem: f55_in(T17) -> f57_in(T17) :|: TRUE f57_in(x4) -> f58_in(x4) :|: TRUE f60_in(T41) -> f55_in(T41) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE ---------------------------------------- (83) Obligation: Rules: f55_in(T17) -> f57_in(T17) :|: TRUE f57_in(x4) -> f58_in(x4) :|: TRUE f60_in(T41) -> f55_in(T41) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE ---------------------------------------- (84) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (85) Obligation: Rules: f60_in(.(x8:0, x9:0)) -> f60_in(x9:0) :|: TRUE ---------------------------------------- (86) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (87) Obligation: Rules: f60_in(.(x8:0, x9:0)) -> f60_in(x9:0) :|: TRUE ---------------------------------------- (88) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f60_in(.(x8:0, x9:0)) -> f60_in(x9:0) :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (89) Obligation: Termination digraph: Nodes: (1) f60_in(.(x8:0, x9:0)) -> f60_in(x9:0) :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (90) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: .(x1, x2) -> .(x2) ---------------------------------------- (91) Obligation: Rules: f60_in(.(x9:0)) -> f60_in(x9:0) :|: TRUE ---------------------------------------- (92) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f60_in(VARIABLE) .(VARIABLE) Removed predefined arithmetic. ---------------------------------------- (93) Obligation: Rules: f60_in(.(x9:0)) -> f60_in(x9:0) ---------------------------------------- (94) IRSwTToQDPProof (SOUND) Removed the integers and created a QDP-Problem. ---------------------------------------- (95) Obligation: Q DP problem: The TRS P consists of the following rules: f60_in(.(x9:0)) -> f60_in(x9:0) R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (96) 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: *f60_in(.(x9:0)) -> f60_in(x9:0) The graph contains the following edges 1 > 1 ---------------------------------------- (97) YES ---------------------------------------- (98) Obligation: Rules: f55_in(T17) -> f57_in(T17) :|: TRUE f57_out(x) -> f55_out(x) :|: TRUE f56_in(x1) -> f2_in(x1) :|: TRUE f2_out(x2) -> f56_out(x2) :|: TRUE f59_out(x3) -> f57_out(x3) :|: TRUE f57_in(x4) -> f59_in(x4) :|: TRUE f58_out(x5) -> f57_out(x5) :|: TRUE f57_in(x6) -> f58_in(x6) :|: TRUE f2_in(T2) -> f4_in(T2) :|: TRUE f4_out(x7) -> f2_out(x7) :|: TRUE f60_out(T41) -> f58_out(.(T40, T41)) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE f61_out -> f58_out(x10) :|: TRUE f58_in(x11) -> f61_in :|: TRUE f273_in -> f273_out :|: TRUE f48_out(x12) -> f7_out(x12) :|: TRUE f7_in(x13) -> f49_in :|: TRUE f49_out -> f7_out(x14) :|: TRUE f7_in(x15) -> f48_in(x15) :|: TRUE f7_out(x16) -> f4_out(x16) :|: TRUE f4_in(x17) -> f7_in(x17) :|: TRUE f4_in(x18) -> f8_in(x18) :|: TRUE f8_out(x19) -> f4_out(x19) :|: TRUE f56_out(x20) -> f48_out(x20) :|: TRUE f48_in(x21) -> f55_in(x21) :|: TRUE f55_out(x22) -> f56_in(x22) :|: TRUE f60_in(x23) -> f55_in(x23) :|: TRUE f55_out(x24) -> f60_out(x24) :|: TRUE f59_in(.(T50, T51)) -> f273_in :|: TRUE f273_out -> f59_out(.(x25, x26)) :|: TRUE f275_out -> f59_out(x27) :|: TRUE f59_in(x28) -> f275_in :|: TRUE Start term: f2_in(T2) ---------------------------------------- (99) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: intTRSProblem: f55_in(T17) -> f57_in(T17) :|: TRUE f57_out(x) -> f55_out(x) :|: TRUE f56_in(x1) -> f2_in(x1) :|: TRUE f59_out(x3) -> f57_out(x3) :|: TRUE f57_in(x4) -> f59_in(x4) :|: TRUE f58_out(x5) -> f57_out(x5) :|: TRUE f57_in(x6) -> f58_in(x6) :|: TRUE f2_in(T2) -> f4_in(T2) :|: TRUE f60_out(T41) -> f58_out(.(T40, T41)) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE f273_in -> f273_out :|: TRUE f7_in(x15) -> f48_in(x15) :|: TRUE f4_in(x17) -> f7_in(x17) :|: TRUE f48_in(x21) -> f55_in(x21) :|: TRUE f55_out(x22) -> f56_in(x22) :|: TRUE f60_in(x23) -> f55_in(x23) :|: TRUE f55_out(x24) -> f60_out(x24) :|: TRUE f59_in(.(T50, T51)) -> f273_in :|: TRUE f273_out -> f59_out(.(x25, x26)) :|: TRUE ---------------------------------------- (100) Obligation: Rules: f55_in(T17) -> f57_in(T17) :|: TRUE f57_out(x) -> f55_out(x) :|: TRUE f56_in(x1) -> f2_in(x1) :|: TRUE f59_out(x3) -> f57_out(x3) :|: TRUE f57_in(x4) -> f59_in(x4) :|: TRUE f58_out(x5) -> f57_out(x5) :|: TRUE f57_in(x6) -> f58_in(x6) :|: TRUE f2_in(T2) -> f4_in(T2) :|: TRUE f60_out(T41) -> f58_out(.(T40, T41)) :|: TRUE f58_in(.(x8, x9)) -> f60_in(x9) :|: TRUE f273_in -> f273_out :|: TRUE f7_in(x15) -> f48_in(x15) :|: TRUE f4_in(x17) -> f7_in(x17) :|: TRUE f48_in(x21) -> f55_in(x21) :|: TRUE f55_out(x22) -> f56_in(x22) :|: TRUE f60_in(x23) -> f55_in(x23) :|: TRUE f55_out(x24) -> f60_out(x24) :|: TRUE f59_in(.(T50, T51)) -> f273_in :|: TRUE f273_out -> f59_out(.(x25, x26)) :|: TRUE ---------------------------------------- (101) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (102) Obligation: Rules: f57_out(x:0) -> f57_out(.(T40:0, x:0)) :|: TRUE f55_in(.(T50:0, T51:0)) -> f57_out(.(x25:0, x26:0)) :|: TRUE f55_in(.(x8:0, x9:0)) -> f55_in(x9:0) :|: TRUE f57_out(x) -> f55_in(x) :|: TRUE ---------------------------------------- (103) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (104) Obligation: Rules: f57_out(x:0) -> f57_out(.(T40:0, x:0)) :|: TRUE f55_in(.(T50:0, T51:0)) -> f57_out(.(x25:0, x26:0)) :|: TRUE f55_in(.(x8:0, x9:0)) -> f55_in(x9:0) :|: TRUE f57_out(x) -> f55_in(x) :|: TRUE ---------------------------------------- (105) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f57_out(x:0) -> f57_out(.(T40:0, x:0)) :|: TRUE (2) f55_in(.(T50:0, T51:0)) -> f57_out(.(x25:0, x26:0)) :|: TRUE (3) f55_in(.(x8:0, x9:0)) -> f55_in(x9:0) :|: TRUE (4) f57_out(x) -> f55_in(x) :|: TRUE Arcs: (1) -> (1), (4) (2) -> (1), (4) (3) -> (2), (3) (4) -> (2), (3) This digraph is fully evaluated! ---------------------------------------- (106) Obligation: Termination digraph: Nodes: (1) f57_out(x:0) -> f57_out(.(T40:0, x:0)) :|: TRUE (2) f55_in(.(T50:0, T51:0)) -> f57_out(.(x25:0, x26:0)) :|: TRUE (3) f55_in(.(x8:0, x9:0)) -> f55_in(x9:0) :|: TRUE (4) f57_out(x) -> f55_in(x) :|: TRUE Arcs: (1) -> (1), (4) (2) -> (1), (4) (3) -> (2), (3) (4) -> (2), (3) This digraph is fully evaluated!