/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern p(a) 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) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) PrologToPiTRSProof [SOUND, 0 ms] (12) PiTRS (13) DependencyPairsProof [EQUIVALENT, 0 ms] (14) PiDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) PiDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) PiDP (19) PiDPToQDPProof [SOUND, 0 ms] (20) QDP (21) PrologToDTProblemTransformerProof [SOUND, 0 ms] (22) TRIPLES (23) TriplesToPiDPProof [SOUND, 0 ms] (24) PiDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) PiDP (27) PiDPToQDPProof [SOUND, 0 ms] (28) QDP (29) PrologToTRSTransformerProof [SOUND, 0 ms] (30) QTRS (31) QTRSRRRProof [EQUIVALENT, 63 ms] (32) QTRS (33) QTRSRRRProof [EQUIVALENT, 14 ms] (34) QTRS (35) QTRSRRRProof [EQUIVALENT, 11 ms] (36) QTRS (37) QTRSRRRProof [EQUIVALENT, 7 ms] (38) QTRS (39) QTRSRRRProof [EQUIVALENT, 0 ms] (40) QTRS (41) PrologToIRSwTTransformerProof [SOUND, 0 ms] (42) IRSwT (43) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (44) IRSwT (45) IntTRSCompressionProof [EQUIVALENT, 27 ms] (46) IRSwT (47) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (48) IRSwT (49) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms] (50) IRSwT (51) FilterProof [EQUIVALENT, 0 ms] (52) IntTRS (53) IntTRSPeriodicNontermProof [COMPLETE, 0 ms] (54) NO ---------------------------------------- (0) Obligation: Clauses: p(X) :- ','(l(X), q(X)). q(.(A, [])). r(1). l([]). l(.(H, T)) :- ','(r(H), l(T)). Query: p(a) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: p_in_1: (f) l_in_1: (f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g p_out_a(x1) = p_out_a(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g p_out_a(x1) = p_out_a(x1) ---------------------------------------- (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: P_IN_A(X) -> U1_A(X, l_in_a(X)) P_IN_A(X) -> L_IN_A(X) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) L_IN_A(.(H, T)) -> R_IN_A(H) U3_A(H, T, r_out_a(H)) -> U4_A(H, T, l_in_a(T)) U3_A(H, T, r_out_a(H)) -> L_IN_A(T) U1_A(X, l_out_a(X)) -> U2_A(X, q_in_g(X)) U1_A(X, l_out_a(X)) -> Q_IN_G(X) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g p_out_a(x1) = p_out_a(x1) P_IN_A(x1) = P_IN_A U1_A(x1, x2) = U1_A(x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) R_IN_A(x1) = R_IN_A U4_A(x1, x2, x3) = U4_A(x1, x3) U2_A(x1, x2) = U2_A(x1, x2) Q_IN_G(x1) = Q_IN_G(x1) We have to consider all (P,R,Pi)-chains ---------------------------------------- (4) Obligation: Pi DP problem: The TRS P consists of the following rules: P_IN_A(X) -> U1_A(X, l_in_a(X)) P_IN_A(X) -> L_IN_A(X) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) L_IN_A(.(H, T)) -> R_IN_A(H) U3_A(H, T, r_out_a(H)) -> U4_A(H, T, l_in_a(T)) U3_A(H, T, r_out_a(H)) -> L_IN_A(T) U1_A(X, l_out_a(X)) -> U2_A(X, q_in_g(X)) U1_A(X, l_out_a(X)) -> Q_IN_G(X) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g p_out_a(x1) = p_out_a(x1) P_IN_A(x1) = P_IN_A U1_A(x1, x2) = U1_A(x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) R_IN_A(x1) = R_IN_A U4_A(x1, x2, x3) = U4_A(x1, x3) U2_A(x1, x2) = U2_A(x1, x2) Q_IN_G(x1) = Q_IN_G(x1) We have to consider all (P,R,Pi)-chains ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 6 less nodes. ---------------------------------------- (6) Obligation: Pi DP problem: The TRS P consists of the following rules: U3_A(H, T, r_out_a(H)) -> L_IN_A(T) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g p_out_a(x1) = p_out_a(x1) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) We have to consider all (P,R,Pi)-chains ---------------------------------------- (7) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (8) Obligation: Pi DP problem: The TRS P consists of the following rules: U3_A(H, T, r_out_a(H)) -> L_IN_A(T) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) The TRS R consists of the following rules: r_in_a(1) -> r_out_a(1) The argument filtering Pi contains the following mapping: r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) .(x1, x2) = .(x1, x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) We have to consider all (P,R,Pi)-chains ---------------------------------------- (9) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (10) Obligation: Q DP problem: The TRS P consists of the following rules: U3_A(r_out_a(H)) -> L_IN_A L_IN_A -> U3_A(r_in_a) The TRS R consists of the following rules: r_in_a -> r_out_a(1) The set Q consists of the following terms: r_in_a We have to consider all (P,Q,R)-chains. ---------------------------------------- (11) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: p_in_1: (f) l_in_1: (f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g(x1) p_out_a(x1) = p_out_a(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (12) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g(x1) p_out_a(x1) = p_out_a(x1) ---------------------------------------- (13) 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: P_IN_A(X) -> U1_A(X, l_in_a(X)) P_IN_A(X) -> L_IN_A(X) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) L_IN_A(.(H, T)) -> R_IN_A(H) U3_A(H, T, r_out_a(H)) -> U4_A(H, T, l_in_a(T)) U3_A(H, T, r_out_a(H)) -> L_IN_A(T) U1_A(X, l_out_a(X)) -> U2_A(X, q_in_g(X)) U1_A(X, l_out_a(X)) -> Q_IN_G(X) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g(x1) p_out_a(x1) = p_out_a(x1) P_IN_A(x1) = P_IN_A U1_A(x1, x2) = U1_A(x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) R_IN_A(x1) = R_IN_A U4_A(x1, x2, x3) = U4_A(x1, x3) U2_A(x1, x2) = U2_A(x1, x2) Q_IN_G(x1) = Q_IN_G(x1) We have to consider all (P,R,Pi)-chains ---------------------------------------- (14) Obligation: Pi DP problem: The TRS P consists of the following rules: P_IN_A(X) -> U1_A(X, l_in_a(X)) P_IN_A(X) -> L_IN_A(X) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) L_IN_A(.(H, T)) -> R_IN_A(H) U3_A(H, T, r_out_a(H)) -> U4_A(H, T, l_in_a(T)) U3_A(H, T, r_out_a(H)) -> L_IN_A(T) U1_A(X, l_out_a(X)) -> U2_A(X, q_in_g(X)) U1_A(X, l_out_a(X)) -> Q_IN_G(X) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g(x1) p_out_a(x1) = p_out_a(x1) P_IN_A(x1) = P_IN_A U1_A(x1, x2) = U1_A(x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) R_IN_A(x1) = R_IN_A U4_A(x1, x2, x3) = U4_A(x1, x3) U2_A(x1, x2) = U2_A(x1, x2) Q_IN_G(x1) = Q_IN_G(x1) We have to consider all (P,R,Pi)-chains ---------------------------------------- (15) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 6 less nodes. ---------------------------------------- (16) Obligation: Pi DP problem: The TRS P consists of the following rules: U3_A(H, T, r_out_a(H)) -> L_IN_A(T) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) The TRS R consists of the following rules: p_in_a(X) -> U1_a(X, l_in_a(X)) l_in_a([]) -> l_out_a([]) l_in_a(.(H, T)) -> U3_a(H, T, r_in_a(H)) r_in_a(1) -> r_out_a(1) U3_a(H, T, r_out_a(H)) -> U4_a(H, T, l_in_a(T)) U4_a(H, T, l_out_a(T)) -> l_out_a(.(H, T)) U1_a(X, l_out_a(X)) -> U2_a(X, q_in_g(X)) q_in_g(.(A, [])) -> q_out_g(.(A, [])) U2_a(X, q_out_g(X)) -> p_out_a(X) The argument filtering Pi contains the following mapping: p_in_a(x1) = p_in_a U1_a(x1, x2) = U1_a(x2) l_in_a(x1) = l_in_a l_out_a(x1) = l_out_a(x1) U3_a(x1, x2, x3) = U3_a(x3) r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) U4_a(x1, x2, x3) = U4_a(x1, x3) U2_a(x1, x2) = U2_a(x1, x2) q_in_g(x1) = q_in_g(x1) .(x1, x2) = .(x1, x2) [] = [] q_out_g(x1) = q_out_g(x1) p_out_a(x1) = p_out_a(x1) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) We have to consider all (P,R,Pi)-chains ---------------------------------------- (17) UsableRulesProof (EQUIVALENT) For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R. ---------------------------------------- (18) Obligation: Pi DP problem: The TRS P consists of the following rules: U3_A(H, T, r_out_a(H)) -> L_IN_A(T) L_IN_A(.(H, T)) -> U3_A(H, T, r_in_a(H)) The TRS R consists of the following rules: r_in_a(1) -> r_out_a(1) The argument filtering Pi contains the following mapping: r_in_a(x1) = r_in_a r_out_a(x1) = r_out_a(x1) .(x1, x2) = .(x1, x2) L_IN_A(x1) = L_IN_A U3_A(x1, x2, x3) = U3_A(x3) We have to consider all (P,R,Pi)-chains ---------------------------------------- (19) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (20) Obligation: Q DP problem: The TRS P consists of the following rules: U3_A(r_out_a(H)) -> L_IN_A L_IN_A -> U3_A(r_in_a) The TRS R consists of the following rules: r_in_a -> r_out_a(1) The set Q consists of the following terms: r_in_a We have to consider all (P,Q,R)-chains. ---------------------------------------- (21) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 2, "program": { "directives": [], "clauses": [ [ "(p X)", "(',' (l X) (q X))" ], [ "(q (. A ([])))", null ], [ "(r (1))", null ], [ "(l ([]))", null ], [ "(l (. H T))", "(',' (r H) (l T))" ] ] }, "graph": { "nodes": { "27": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (l T4) (q T4))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "29": { "goal": [ { "clause": 3, "scope": 2, "term": "(',' (l T4) (q T4))" }, { "clause": 4, "scope": 2, "term": "(',' (l T4) (q T4))" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "190": { "goal": [{ "clause": 1, "scope": 7, "term": "(q (. (1) T14))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T14"], "free": [], "exprvars": [] } }, "191": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "192": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "171": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T13)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "193": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "172": { "goal": [{ "clause": -1, "scope": -1, "term": "(q (. (1) T14))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T14"], "free": [], "exprvars": [] } }, "173": { "goal": [ { "clause": 3, "scope": 5, "term": "(l T13)" }, { "clause": 4, "scope": 5, "term": "(l T13)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "174": { "goal": [{ "clause": 3, "scope": 5, "term": "(l T13)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "175": { "goal": [{ "clause": 4, "scope": 5, "term": "(l T13)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "176": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "177": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "178": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "30": { "goal": [{ "clause": 3, "scope": 2, "term": "(',' (l T4) (q T4))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "31": { "goal": [{ "clause": 4, "scope": 2, "term": "(',' (l T4) (q T4))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "32": { "goal": [{ "clause": -1, "scope": -1, "term": "(q ([]))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "33": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "34": { "goal": [{ "clause": 1, "scope": 3, "term": "(q ([]))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "35": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "16": { "goal": [{ "clause": 0, "scope": 1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "38": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (',' (r T11) (l T12)) (q (. T11 T12)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "39": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "181": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (r T21) (l T22))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "182": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "183": { "goal": [{ "clause": 2, "scope": 6, "term": "(',' (r T21) (l T22))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "184": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T23)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "185": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "2": { "goal": [{ "clause": -1, "scope": -1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "167": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (l T13) (q (. (1) T13)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "168": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "40": { "goal": [{ "clause": 2, "scope": 4, "term": "(',' (',' (r T11) (l T12)) (q (. T11 T12)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 2, "to": 16, "label": "CASE" }, { "from": 16, "to": 27, "label": "ONLY EVAL with clause\np(X2) :- ','(l(X2), q(X2)).\nand substitutionT1 -> T4,\nX2 -> T4,\nT3 -> T4" }, { "from": 27, "to": 29, "label": "CASE" }, { "from": 29, "to": 30, "label": "PARALLEL" }, { "from": 29, "to": 31, "label": "PARALLEL" }, { "from": 30, "to": 32, "label": "EVAL with clause\nl([]).\nand substitutionT4 -> []" }, { "from": 30, "to": 33, "label": "EVAL-BACKTRACK" }, { "from": 31, "to": 38, "label": "EVAL with clause\nl(.(X8, X9)) :- ','(r(X8), l(X9)).\nand substitutionX8 -> T11,\nX9 -> T12,\nT4 -> .(T11, T12),\nT9 -> T11,\nT10 -> T12" }, { "from": 31, "to": 39, "label": "EVAL-BACKTRACK" }, { "from": 32, "to": 34, "label": "CASE" }, { "from": 34, "to": 35, "label": "BACKTRACK\nfor clause: q(.(A, []))because of non-unification" }, { "from": 38, "to": 40, "label": "CASE" }, { "from": 40, "to": 167, "label": "EVAL with clause\nr(1).\nand substitutionT11 -> 1,\nT12 -> T13" }, { "from": 40, "to": 168, "label": "EVAL-BACKTRACK" }, { "from": 167, "to": 171, "label": "SPLIT 1" }, { "from": 167, "to": 172, "label": "SPLIT 2\nnew knowledge:\nT14 is ground\nreplacements:T13 -> T14" }, { "from": 171, "to": 173, "label": "CASE" }, { "from": 172, "to": 190, "label": "CASE" }, { "from": 173, "to": 174, "label": "PARALLEL" }, { "from": 173, "to": 175, "label": "PARALLEL" }, { "from": 174, "to": 176, "label": "EVAL with clause\nl([]).\nand substitutionT13 -> []" }, { "from": 174, "to": 177, "label": "EVAL-BACKTRACK" }, { "from": 175, "to": 181, "label": "EVAL with clause\nl(.(X14, X15)) :- ','(r(X14), l(X15)).\nand substitutionX14 -> T21,\nX15 -> T22,\nT13 -> .(T21, T22),\nT19 -> T21,\nT20 -> T22" }, { "from": 175, "to": 182, "label": "EVAL-BACKTRACK" }, { "from": 176, "to": 178, "label": "SUCCESS" }, { "from": 181, "to": 183, "label": "CASE" }, { "from": 183, "to": 184, "label": "EVAL with clause\nr(1).\nand substitutionT21 -> 1,\nT22 -> T23" }, { "from": 183, "to": 185, "label": "EVAL-BACKTRACK" }, { "from": 184, "to": 171, "label": "INSTANCE with matching:\nT13 -> T23" }, { "from": 190, "to": 191, "label": "EVAL with clause\nq(.(X18, [])).\nand substitutionX18 -> 1,\nT14 -> []" }, { "from": 190, "to": 192, "label": "EVAL-BACKTRACK" }, { "from": 191, "to": 193, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (22) Obligation: Triples: lA(.(1, X1)) :- lA(X1). pB(.(1, X1)) :- lA(X1). Clauses: lcA([]). lcA(.(1, X1)) :- lcA(X1). Afs: pB(x1) = pB ---------------------------------------- (23) TriplesToPiDPProof (SOUND) We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes: pB_in_1: (f) lA_in_1: (f) Transforming TRIPLES into the following Term Rewriting System: Pi DP problem: The TRS P consists of the following rules: PB_IN_A(.(1, X1)) -> U2_A(X1, lA_in_a(X1)) PB_IN_A(.(1, X1)) -> LA_IN_A(X1) LA_IN_A(.(1, X1)) -> U1_A(X1, lA_in_a(X1)) LA_IN_A(.(1, X1)) -> LA_IN_A(X1) R is empty. The argument filtering Pi contains the following mapping: lA_in_a(x1) = lA_in_a .(x1, x2) = .(x1, x2) 1 = 1 PB_IN_A(x1) = PB_IN_A U2_A(x1, x2) = U2_A(x2) LA_IN_A(x1) = LA_IN_A U1_A(x1, x2) = U1_A(x2) We have to consider all (P,R,Pi)-chains Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES ---------------------------------------- (24) Obligation: Pi DP problem: The TRS P consists of the following rules: PB_IN_A(.(1, X1)) -> U2_A(X1, lA_in_a(X1)) PB_IN_A(.(1, X1)) -> LA_IN_A(X1) LA_IN_A(.(1, X1)) -> U1_A(X1, lA_in_a(X1)) LA_IN_A(.(1, X1)) -> LA_IN_A(X1) R is empty. The argument filtering Pi contains the following mapping: lA_in_a(x1) = lA_in_a .(x1, x2) = .(x1, x2) 1 = 1 PB_IN_A(x1) = PB_IN_A U2_A(x1, x2) = U2_A(x2) LA_IN_A(x1) = LA_IN_A U1_A(x1, x2) = U1_A(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (25) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 3 less nodes. ---------------------------------------- (26) Obligation: Pi DP problem: The TRS P consists of the following rules: LA_IN_A(.(1, X1)) -> LA_IN_A(X1) R is empty. The argument filtering Pi contains the following mapping: .(x1, x2) = .(x1, x2) 1 = 1 LA_IN_A(x1) = LA_IN_A We have to consider all (P,R,Pi)-chains ---------------------------------------- (27) PiDPToQDPProof (SOUND) Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi. ---------------------------------------- (28) Obligation: Q DP problem: The TRS P consists of the following rules: LA_IN_A -> LA_IN_A R is empty. Q is empty. We have to consider all (P,Q,R)-chains. ---------------------------------------- (29) PrologToTRSTransformerProof (SOUND) Transformed Prolog program to TRS. { "root": 3, "program": { "directives": [], "clauses": [ [ "(p X)", "(',' (l X) (q X))" ], [ "(q (. A ([])))", null ], [ "(r (1))", null ], [ "(l ([]))", null ], [ "(l (. H T))", "(',' (r H) (l T))" ] ] }, "graph": { "nodes": { "44": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "45": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "46": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "36": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "47": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (r T14) (l T15))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "15": { "goal": [{ "clause": 0, "scope": 1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "37": { "goal": [{ "clause": -1, "scope": -1, "term": "(q T7)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T7"], "free": [], "exprvars": [] } }, "48": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "49": { "goal": [{ "clause": 2, "scope": 3, "term": "(',' (r T14) (l T15))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "28": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (l T6) (q T6))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "180": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "194": { "goal": [{ "clause": 1, "scope": 4, "term": "(q T7)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T7"], "free": [], "exprvars": [] } }, "195": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "196": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "197": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "3": { "goal": [{ "clause": -1, "scope": -1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "179": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T16)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "41": { "goal": [ { "clause": 3, "scope": 2, "term": "(l T6)" }, { "clause": 4, "scope": 2, "term": "(l T6)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "42": { "goal": [{ "clause": 3, "scope": 2, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "43": { "goal": [{ "clause": 4, "scope": 2, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 3, "to": 15, "label": "CASE" }, { "from": 15, "to": 28, "label": "ONLY EVAL with clause\np(X3) :- ','(l(X3), q(X3)).\nand substitutionT1 -> T6,\nX3 -> T6,\nT5 -> T6" }, { "from": 28, "to": 36, "label": "SPLIT 1" }, { "from": 28, "to": 37, "label": "SPLIT 2\nnew knowledge:\nT7 is ground\nreplacements:T6 -> T7" }, { "from": 36, "to": 41, "label": "CASE" }, { "from": 37, "to": 194, "label": "CASE" }, { "from": 41, "to": 42, "label": "PARALLEL" }, { "from": 41, "to": 43, "label": "PARALLEL" }, { "from": 42, "to": 44, "label": "EVAL with clause\nl([]).\nand substitutionT6 -> []" }, { "from": 42, "to": 45, "label": "EVAL-BACKTRACK" }, { "from": 43, "to": 47, "label": "EVAL with clause\nl(.(X8, X9)) :- ','(r(X8), l(X9)).\nand substitutionX8 -> T14,\nX9 -> T15,\nT6 -> .(T14, T15),\nT12 -> T14,\nT13 -> T15" }, { "from": 43, "to": 48, "label": "EVAL-BACKTRACK" }, { "from": 44, "to": 46, "label": "SUCCESS" }, { "from": 47, "to": 49, "label": "CASE" }, { "from": 49, "to": 179, "label": "EVAL with clause\nr(1).\nand substitutionT14 -> 1,\nT15 -> T16" }, { "from": 49, "to": 180, "label": "EVAL-BACKTRACK" }, { "from": 179, "to": 36, "label": "INSTANCE with matching:\nT6 -> T16" }, { "from": 194, "to": 195, "label": "EVAL with clause\nq(.(X12, [])).\nand substitutionX12 -> T19,\nT7 -> .(T19, [])" }, { "from": 194, "to": 196, "label": "EVAL-BACKTRACK" }, { "from": 195, "to": 197, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (30) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f3_in -> U1(f28_in) U1(f28_out1(T6)) -> f3_out1(T6) f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) f37_in(.(T19, [])) -> f37_out1 f28_in -> U3(f36_in) U3(f36_out1(T7)) -> U4(f37_in(T7), T7) U4(f37_out1, T7) -> f28_out1(T7) Q is empty. ---------------------------------------- (31) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(.(x_1, x_2)) = x_1 + 2*x_2 POL(1) = 0 POL(U1(x_1)) = 2*x_1 POL(U2(x_1)) = 2*x_1 POL(U3(x_1)) = 2*x_1 POL(U4(x_1, x_2)) = x_1 + x_2 POL([]) = 0 POL(f28_in) = 0 POL(f28_out1(x_1)) = x_1 POL(f36_in) = 0 POL(f36_out1(x_1)) = x_1 POL(f37_in(x_1)) = x_1 POL(f37_out1) = 0 POL(f3_in) = 1 POL(f3_out1(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f3_in -> U1(f28_in) ---------------------------------------- (32) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: U1(f28_out1(T6)) -> f3_out1(T6) f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) f37_in(.(T19, [])) -> f37_out1 f28_in -> U3(f36_in) U3(f36_out1(T7)) -> U4(f37_in(T7), T7) U4(f37_out1, T7) -> f28_out1(T7) Q is empty. ---------------------------------------- (33) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(.(x_1, x_2)) = 2*x_1 + x_2 POL(1) = 0 POL(U1(x_1)) = 2*x_1 POL(U2(x_1)) = x_1 POL(U3(x_1)) = 2*x_1 POL(U4(x_1, x_2)) = x_1 + 2*x_2 POL([]) = 0 POL(f28_in) = 2 POL(f28_out1(x_1)) = x_1 POL(f36_in) = 0 POL(f36_out1(x_1)) = 2*x_1 POL(f37_in(x_1)) = x_1 POL(f37_out1) = 0 POL(f3_out1(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f28_in -> U3(f36_in) ---------------------------------------- (34) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: U1(f28_out1(T6)) -> f3_out1(T6) f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) f37_in(.(T19, [])) -> f37_out1 U3(f36_out1(T7)) -> U4(f37_in(T7), T7) U4(f37_out1, T7) -> f28_out1(T7) Q is empty. ---------------------------------------- (35) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(.(x_1, x_2)) = 2*x_1 + x_2 POL(1) = 0 POL(U1(x_1)) = 2*x_1 POL(U2(x_1)) = x_1 POL(U3(x_1)) = 1 + 2*x_1 POL(U4(x_1, x_2)) = 2 + 2*x_1 + x_2 POL([]) = 0 POL(f28_out1(x_1)) = 1 + x_1 POL(f36_in) = 2 POL(f36_out1(x_1)) = 2 + 2*x_1 POL(f37_in(x_1)) = x_1 POL(f37_out1) = 0 POL(f3_out1(x_1)) = 2 + 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: U3(f36_out1(T7)) -> U4(f37_in(T7), T7) U4(f37_out1, T7) -> f28_out1(T7) ---------------------------------------- (36) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: U1(f28_out1(T6)) -> f3_out1(T6) f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) f37_in(.(T19, [])) -> f37_out1 Q is empty. ---------------------------------------- (37) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(.(x_1, x_2)) = 2*x_1 + x_2 POL(1) = 0 POL(U1(x_1)) = 2 + x_1 POL(U2(x_1)) = 2*x_1 POL([]) = 0 POL(f28_out1(x_1)) = 2 + 2*x_1 POL(f36_in) = 0 POL(f36_out1(x_1)) = x_1 POL(f37_in(x_1)) = 1 + x_1 POL(f37_out1) = 1 POL(f3_out1(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: U1(f28_out1(T6)) -> f3_out1(T6) ---------------------------------------- (38) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) f37_in(.(T19, [])) -> f37_out1 Q is empty. ---------------------------------------- (39) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(.(x_1, x_2)) = 2*x_1 + x_2 POL(1) = 0 POL(U2(x_1)) = 2*x_1 POL([]) = 0 POL(f36_in) = 0 POL(f36_out1(x_1)) = 2*x_1 POL(f37_in(x_1)) = 1 + 2*x_1 POL(f37_out1) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f37_in(.(T19, [])) -> f37_out1 ---------------------------------------- (40) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f36_in -> f36_out1([]) f36_in -> U2(f36_in) U2(f36_out1(T16)) -> f36_out1(.(1, T16)) Q is empty. ---------------------------------------- (41) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 1, "program": { "directives": [], "clauses": [ [ "(p X)", "(',' (l X) (q X))" ], [ "(q (. A ([])))", null ], [ "(r (1))", null ], [ "(l ([]))", null ], [ "(l (. H T))", "(',' (r H) (l T))" ] ] }, "graph": { "nodes": { "170": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "130": { "goal": [{ "clause": -1, "scope": -1, "term": "(q T7)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T7"], "free": [], "exprvars": [] } }, "131": { "goal": [ { "clause": 3, "scope": 2, "term": "(l T6)" }, { "clause": 4, "scope": 2, "term": "(l T6)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "142": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (r T14) (l T15))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "186": { "goal": [{ "clause": 1, "scope": 4, "term": "(q T7)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T7"], "free": [], "exprvars": [] } }, "132": { "goal": [{ "clause": 3, "scope": 2, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "187": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "1": { "goal": [{ "clause": -1, "scope": -1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "133": { "goal": [{ "clause": 4, "scope": 2, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "188": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "134": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "145": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "189": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "136": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "169": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T16)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "137": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "148": { "goal": [{ "clause": 2, "scope": 3, "term": "(',' (r T14) (l T15))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "116": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (l T6) (q T6))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "7": { "goal": [{ "clause": 0, "scope": 1, "term": "(p T1)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "129": { "goal": [{ "clause": -1, "scope": -1, "term": "(l T6)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 1, "to": 7, "label": "CASE" }, { "from": 7, "to": 116, "label": "ONLY EVAL with clause\np(X3) :- ','(l(X3), q(X3)).\nand substitutionT1 -> T6,\nX3 -> T6,\nT5 -> T6" }, { "from": 116, "to": 129, "label": "SPLIT 1" }, { "from": 116, "to": 130, "label": "SPLIT 2\nnew knowledge:\nT7 is ground\nreplacements:T6 -> T7" }, { "from": 129, "to": 131, "label": "CASE" }, { "from": 130, "to": 186, "label": "CASE" }, { "from": 131, "to": 132, "label": "PARALLEL" }, { "from": 131, "to": 133, "label": "PARALLEL" }, { "from": 132, "to": 134, "label": "EVAL with clause\nl([]).\nand substitutionT6 -> []" }, { "from": 132, "to": 136, "label": "EVAL-BACKTRACK" }, { "from": 133, "to": 142, "label": "EVAL with clause\nl(.(X8, X9)) :- ','(r(X8), l(X9)).\nand substitutionX8 -> T14,\nX9 -> T15,\nT6 -> .(T14, T15),\nT12 -> T14,\nT13 -> T15" }, { "from": 133, "to": 145, "label": "EVAL-BACKTRACK" }, { "from": 134, "to": 137, "label": "SUCCESS" }, { "from": 142, "to": 148, "label": "CASE" }, { "from": 148, "to": 169, "label": "EVAL with clause\nr(1).\nand substitutionT14 -> 1,\nT15 -> T16" }, { "from": 148, "to": 170, "label": "EVAL-BACKTRACK" }, { "from": 169, "to": 129, "label": "INSTANCE with matching:\nT6 -> T16" }, { "from": 186, "to": 187, "label": "EVAL with clause\nq(.(X12, [])).\nand substitutionX12 -> T19,\nT7 -> .(T19, [])" }, { "from": 186, "to": 188, "label": "EVAL-BACKTRACK" }, { "from": 187, "to": 189, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (42) Obligation: Rules: f132_out -> f131_out :|: TRUE f131_in -> f132_in :|: TRUE f133_out -> f131_out :|: TRUE f131_in -> f133_in :|: TRUE f129_out -> f169_out :|: TRUE f169_in -> f129_in :|: TRUE f129_in -> f131_in :|: TRUE f131_out -> f129_out :|: TRUE f142_in -> f148_in :|: TRUE f148_out -> f142_out :|: TRUE f145_out -> f133_out :|: TRUE f142_out -> f133_out :|: TRUE f133_in -> f142_in :|: TRUE f133_in -> f145_in :|: TRUE f169_out -> f148_out :|: TRUE f148_in -> f169_in :|: TRUE f170_out -> f148_out :|: TRUE f148_in -> f170_in :|: TRUE f1_in -> f7_in :|: TRUE f7_out -> f1_out :|: TRUE f7_in -> f116_in :|: TRUE f116_out -> f7_out :|: TRUE f130_out(T7) -> f116_out :|: TRUE f129_out -> f130_in(x) :|: TRUE f116_in -> f129_in :|: TRUE Start term: f1_in ---------------------------------------- (43) IRSwTSimpleDependencyGraphProof (EQUIVALENT) Constructed simple dependency graph. Simplified to the following IRSwTs: intTRSProblem: f131_in -> f133_in :|: TRUE f169_in -> f129_in :|: TRUE f129_in -> f131_in :|: TRUE f142_in -> f148_in :|: TRUE f133_in -> f142_in :|: TRUE f148_in -> f169_in :|: TRUE ---------------------------------------- (44) Obligation: Rules: f131_in -> f133_in :|: TRUE f169_in -> f129_in :|: TRUE f129_in -> f131_in :|: TRUE f142_in -> f148_in :|: TRUE f133_in -> f142_in :|: TRUE f148_in -> f169_in :|: TRUE ---------------------------------------- (45) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (46) Obligation: Rules: f169_in -> f169_in :|: TRUE ---------------------------------------- (47) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (48) Obligation: Rules: f169_in -> f169_in :|: TRUE ---------------------------------------- (49) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f169_in -> f169_in :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (50) Obligation: Termination digraph: Nodes: (1) f169_in -> f169_in :|: TRUE Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (51) FilterProof (EQUIVALENT) Used the following sort dictionary for filtering: f169_in() Replaced non-predefined constructor symbols by 0. ---------------------------------------- (52) Obligation: Rules: f169_in -> f169_in :|: TRUE ---------------------------------------- (53) IntTRSPeriodicNontermProof (COMPLETE) Normalized system to the following form: f(pc) -> f(1) :|: pc = 1 && TRUE Witness term starting non-terminating reduction: f(1) ---------------------------------------- (54) NO